Want this question answered?
Since there is an infinite set of prime numbers the answer would be infinity.
Write your own prime number program and find out.
program to find prime number in 8085 microprocessor
You write down the multiples of those four numbers and find the LCM. EX. 1:1,2,3,4,5,6,7,8,9,10,11,12 2:1,2 3:1,3 4:1,2,3 So the LCM is 2.
Shell program to find LCM and hcf of two no.s tput clear echo "Enter first no" read a echo "Enter 2nd no" read b p= 'expr $a \* $b' while [$b -ne 0] do r= 'expr $a % $b' a=$b b=$r done LCM = 'expr $p / $a' echo "LCM = $LCM" echo "Hcf = $a"
program to find maximum of two numbers using pointers
write an assembly language program to find sum of N numbers
VBnet program to find the prime numbers between 100 to 200?
k
(defun max3 (a b c) (cond ((> a b) (cond ((> a c) a) (t c))) ((> b c) b) (t c) ) )
i need this answer
Please visit http://talentsealed.blogspot.com/2009/10/to-find-sqaure-of-numbers-using-c.htmlfor the answer.
Since there is an infinite set of prime numbers the answer would be infinity.
maxValue = function (array) {mxm = array[0];for (i=0; i<array.length; i++) {if (array[i]>mxm) {mxm = array[i];}}return mxm;}; i don't know
huh?
The maximum of a set of numbers is the largest number in the set.
for(int i = 1; i < 100; i+=2) { System.out.println(i); }