Perfect number Program Plan: Import required packages. Declare the class “PerfectNumber”. Define the main method. Traverse the “for” loop to get the perfect number. Call the method “isPerfect()”. Check whether “res” is not equal to “null”. Print the result. Definition of method “isPerfect()”. Assign the “factor” value to “1”. Assign the “fac” to “1”. Check the condition using “for loop. Check whether the “num” mod “i” equals to “0”. Assign the factors with the value of “i”. Check whether the “factor” equals to “num”. Return the “factors”. Return “null”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 18.1E

Program Plan Intro

Perfect number

Program Plan:

Import required packages.

Declare the class “PerfectNumber”.

Define the main method.

Traverse the “for” loop to get the perfect number.

Call the method “isPerfect()”.

Check whether “res” is not equal to “null”.

Print the result.

Definition of method “isPerfect()”.

Assign the “factor” value to “1”.

Assign the “fac” to “1”.

Check the condition using “for loop.

Check whether the “num” mod “i” equals to “0”.

Assign the factors with the value of “i”.

Check whether the “factor” equals to “num”.

Return the “factors”.

Return “null”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

a) Write a boolean method called sumDivisibleByFive that returns true if the sum of the digits of its integer parameter is divisible by 5 and false otherwise. For example, if the parameter passed to the method is 73 then the sum of its digits is 10 (7+3) The method should return true since 10 is divisible by 5. b) Write a main method that calls the method sumDivisibleByFive for the values between 10 and 100 inclusive 10 per line. This should output the following numbers: 14 19 23 28 32 3741 46 50 55 64 69 73 78 82 87 91 96

Method overloading: given the following methods, write down the printed output of the method calls.

Here's the problem " (Math: approximate the square root) There are several techniques for implementingthe sqrt method in the Math class. One such technique is known as theBabylonian method. It approximates the square root of a number, n, by repeatedlyperforming a calculation using the following formula: nextGuess = (lastGuess + n / lastGuess) / 2 When nextGuess and lastGuess are almost identical, nextGuess is theapproximated square root. The initial guess can be any positive value (e.g., 1).This value will be the starting value for lastGuess. If the difference betweennextGuess and lastGuess is less than a very small number, such as 0.0001,you can claim that nextGuess is the approximated square root of n. If not, next-Guess becomes lastGuess and the approximation process continues. Implementthe following method that returns the square root of n.public static double sqrt(long n)" I have my java code here " import java.util.Scanner;public class Main2 {public static void main(String[]…