Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.Just write a method or function that calculates the LCM for two numbers at a time. Then calculate the LCM for the first two numbers, get the LCM of the result with the third number, etc.
#include<iostream.h> #include<conio.h> void main() { int a, b, c; clrscr(); cout<<"enter the two numbers"; cin>>a; cin>b; c=a+b; cout<<"Addition of two numbers="<<c; getch(); }
public int findSum(int n1, int n2) { return n1 + n2; }
#include<iostream> int main() { std::cout << "Enter two numbers: "; double a, b; std::cin >> a >> b; // note: error handling omitted for brevity! std::cout <<"The product of " << a << " and " << b << " is " << a*b << '\n'; }
$vi sum.sh echo "enter the 1st no." read num1 echo "enter the 2nd no." read num2 sum= 'expr $num1 + $num2' echo "sum of the numbers is $sum"
write it in 8085
program to find maximum of two numbers using pointers
fish
write a shell program for finding out gcd of three given numbers? write a shell program for finding out gcd of three given numbers? write a shell program for finding out gcd of three given numbers? check bellow link http://bashscript.blogspot.com/2009/08/gcd-of-more-than-two-numbers.html
substracion of any two number program in c
i need this answer
Name two variables x and y. Divide the largest by smallest. If remainder is zero then the smallest is the HCF.
Try the triangle program on a search engine. Replace numbers with stars and that should do the trick
They are numbers that each of the two numbers can divide without remainder.
In math it means when you divide two numbers, there is no remainder or there is a remainder of zero.
Store both the number in two variable X and Y. Divide X by Y. If remainder is zero then Y is HCF.
Please visit http://talentsealed.blogspot.com/2009/10/to-find-sqaure-of-numbers-using-c.htmlfor the answer.