You can use the Math.sqrt() method.
k
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.
There are two solution: -3 and +2.
write an assembly language program to find sum of N numbers
write an algorithm and draw a flow chart to find perimeter of a square
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.
Write a program to find the number and sum of all integers from 100 to 300 that are divisible by 11
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.
For first find an example program.