Perfect Square in Matlab
显示 更早的评论
What is the most efficient way to check wether a number is a perfect square or not in matlab. Perfect square are 4,9,16 and so on
采纳的回答
Hi,
It is my understanding that you want to know the easiest way to find whether a number is a perfect square or not.
For this first you can take the square root of the number and then see if the square root is a proper integer or not. We know that any integer when divided by one leaves zero as the remainder, therefore we can use the “modulo” function to find the remainder of the square root when divided by one and if the remainder is zero means that the number is a perfect square.
n = 49;
%take the square root
sq_rt = sqrt(n);
% now check if the sq_rt is a proper integer or not
int_or_not = mod(sq_rt,1);
if(int_or_not == 0)
disp("Prefect Square");
else
disp("Not a Perfect Square");
end
更多回答（3 个）
x = (1:20);
mod(sqrt(x), 1) == 0
Karan Kannoujiya
2022-7-4
Hi Zaid,
You can use below code to check for a perfect square-->
%num---> number you want to check
y=sqrt(num);
z=ceil(y);
if(z==y)
disp('The number is perfect square number');
else
disp('The number is not a perfect square number');
end
Shivam Lahoti
2022-7-4
you can check for perfect square by using the following check, however representable number might sparse if n is large enough.
if floor(sqrt(n)).^2 == n
类别
在 帮助中心 和 File Exchange 中查找有关 Networks 的更多信息
Translated by 
