#include<iostream>
int main()
{
unsigned num = 25; // or use user-input to assign the value
unsigned root = sqrt ((double) num)
std::cout << "The square root of " << num << " is " << root;
}
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.
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.
Yes, do write. That's what you always have to do when you have got a homework-program.
It is the number that youve hat to square to get to that number.
write a vb program to find the magic square
You can use the Math.sqrt() method.
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.