Write a boolean method that checks whether a given positive integer n is a perfect square. Use Math's sqrt and round methods to find the square root of n, round it, then square the result and compare with n. Do not use any iterations or recursion.

Question

Computers and Technology

Mosley

2 January, 17:23

Write a boolean method that checks whether a given positive integer n is a perfect square. Use Math's sqrt and round methods to find the square root of n, round it, then square the result and compare with n. Do not use any iterations or recursion.

+2

Answers (1)

Know the Answer?

Maddox Knapp · Answer 1

In java ...

public boolean checkSquare (int n) {

int actualNumber = n;

int squareRoot = (int) Math. sqrt (n);

int squaredNumber = Math. pow (squareRoot, 2);

if (squaredNumber==actualNumber) {

return true;

} else {

return false;

}

}