0
Simple and easy solution:-
http://codepad.org/svhkJpxp
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
How do you check if a number is a perfect square?
For a number to be a perfect square, the number's square root has to be a whole number. 9 is a perfect square because its square root is a whole number, 3. If the square root of the number is a decimal, then it is not a perfect square. For example, 13 does not divide evenly so it not a perfect square.
How do you find the square of a root number?
to find the square root of a number you can use the guess and check method which is kind of complicated to explain with just words but i will answer soon and try searching for "How to do the Guess and Check Method" on Google.com or Bing.com by Microsoft or Ask.com To find the square root of a number with a calculator you hit the weird division thingy... after the number/ before the number depending on type of calculator.
How do you know if a number is square number?
I'm assuming you're wondering if a number is a perfect square? Well, memorization will help as will guess and check. However, if you feel like doing it all by hand, simplifying the square will help you determine if it is a perfect square. Example: let's figure out if the number 225 is a perfect square. Let's take 225 and factor it. When you factor this number, you want to look at factoring numbers which are a perfect square in and of themselves. So 22 is 4, but that doesn't factor, how about 52 ? 25 will indeed factor, so we have 25*9 (look at that, 9 is also a factor). If we split it up like this, we have sqrt(25*9). We can take the square root of these individually and multiply them together. sqrt(25)*sqrt(9) = 5*3 = 15. Therefore 225 is a perfect square of 15.
How do you find the quad root of a number?
What I do is find the square root of that number and then find the square root of the answer. Example: 1,296. Square root of 1,296, which can be done easily on most calculators: 36 Square root of 36: 6 Your answer is 6 If you want to check up on that, go ahead, but 6x6x6x6=1,296
What is the first beprisque greater than 100?
Since a Beprisque is a whole number that is consecutive and between a prime and a square, we look to the squares above 100 to begin our search. 121 is a square, but the the two odd numbers on either side of it (119 and 123) are not prime, so we check the next odd perfect square. (Why would we skip over 144?) 167 is prime and 169 is a square, so 168 is Beprisque, and is the first 3-digit Beprisque.
How do you check if a number is a perfect square?
For a number to be a perfect square, the number's square root has to be a whole number. 9 is a perfect square because its square root is a whole number, 3. If the square root of the number is a decimal, then it is not a perfect square. For example, 13 does not divide evenly so it not a perfect square.
How to draw a flowchart to check if a number is a perfect square?
dot you will draw that's all thank you for selected
How can you determine if a number is a prime number by using square root theory?
we can check if it is aprime no or not by sqaure root method (ex 4isnot aprime no but ots square root is aprime no)
How do you find the square of a root number?
to find the square root of a number you can use the guess and check method which is kind of complicated to explain with just words but i will answer soon and try searching for "How to do the Guess and Check Method" on Google.com or Bing.com by Microsoft or Ask.com To find the square root of a number with a calculator you hit the weird division thingy... after the number/ before the number depending on type of calculator.
How do you check whether a number is a square number?
if it's square root is an integer, it is a square number.
How do you know if a number is square number?
I'm assuming you're wondering if a number is a perfect square? Well, memorization will help as will guess and check. However, if you feel like doing it all by hand, simplifying the square will help you determine if it is a perfect square. Example: let's figure out if the number 225 is a perfect square. Let's take 225 and factor it. When you factor this number, you want to look at factoring numbers which are a perfect square in and of themselves. So 22 is 4, but that doesn't factor, how about 52 ? 25 will indeed factor, so we have 25*9 (look at that, 9 is also a factor). If we split it up like this, we have sqrt(25*9). We can take the square root of these individually and multiply them together. sqrt(25)*sqrt(9) = 5*3 = 15. Therefore 225 is a perfect square of 15.
Is this a perfect square trinomial 9x2 12x 4?
Yes, it is the square of (3x + 2). 3x is the square root of 9x2; 4 is the square of 2; to check whether it is a perfect square, the center term must be twice (3x times 2).
What is the method you use to square root?
geuss and check. ? x ?=25 ?=5 so the square root of 25 is 5
Why is 469 a perfect number?
It isn't. In fact, not a single odd perfect number is known so far. To check this, just use the definition of a perfect number: in this case, add all the factor of 467 other than 469 itself, and check whether you get 469.
C program to check given number is a perfect square or not?
#include <stdio.h> #include <math.h> int main(void) { int number; double result; printf ("\n Introduce an integer: "); scanf ("%i", &number); result= sqrt (number); if ((result * result)== number) printf ("\n The integer HAS a perfect square \n\n"); else printf ("\n The integer DOES NOT HAVE a perfect square \n\n"); getch (); } Shrikanth Ganure The Oxford College of Engineering (MCA-2010 Batch) Bangalore..
How do you determine if a number is a square number?
To check if your number is a square number, draw little dots. like, for 4 it will 2 dots by 2 dots. if this doesn't work equally, it is not a square number.
Easier way to select prime numbers?
Check if a number is divisible by 2. Then check divisibility by all odd numbers, up to the square root of the number. If it isn't divisible by any of those, your number is a prime number. For higher numbers, this method may be very slow - but you asked for EASY methods, and the faster methods are certainly not easy.
