You can use the Math.sqrt() method.
k
There are two solution: -3 and +2.
There are many shell programs that will find the sum of the square of individual digits of a number. A small example is: SD=3n=2, sum=2, and SD=2.
write an assembly language program to find sum of N numbers
The square root of 121 is the number which multiplied by itself will give 121, the answer is 11. (11*11=121). we write 11*11 as 112 thus if 112 = 121, then the square root of 121 or √121= 11 as you can see a square root of a number is the opposite of the square of a number
write a vb program to find the magic square
square and cube caculator
int square (int N) return N*N;
k
no thanks
You find the square root an then label it as the side.
Yes, do write, or if you're too lazy to your homework, use google.
Write your own prime number program and find out.
Please visit http://talentsealed.blogspot.com/2009/10/to-find-sqaure-of-numbers-using-c.htmlfor the answer.
There are two solution: -3 and +2.
To find the square root of a given number using the 8086 microprocessor, you can implement the Newton-Raphson method in assembly language. First, load the number into a register, then set an initial guess for the square root. Use the iterative formula guess = (guess + number / guess) / 2 until the guess converges to a stable value. Finally, store or display the result.
Write a program to find the number and sum of all integers from 100 to 300 that are divisible by 11