Take the numbers, factor them, then make a list of all the proper divisors and add them up.
To factor use a Computer Algebra System like Maple, Mathematica or Axiom, if you like.
http://en.wikipedia.org/wiki/Amicable_number
http://en.wikipedia.org/wiki/Divisor
http://axiom-wiki.newsynthesis.org/uploads/chapter-9.13-26.xhtml#sec-9.22
You do nothing! A sequence of numbers will contain no X and so nothing needs doing!
To write a C++ program to display the student details using class and array of object.
ring me and ill explain - 086 22222222222222227 ring me
The generation of palindromic numbers within a given range is best done with a computer program. Space it limited so an example of program code cannot be shown here, but the Codecast website gives full guidance.
<html> <head><title>Check palindrim or not</title> <script language="javascript"> var no,rem,sum=0,temp; no=prompt("Enter the no from user for check"," "); temp=no; while(no>0) { rem=no%10; sum=sum*10+rem; no=no/10; } if(temp==sum) document.write("The given no is palindrom"); else document.write("The given no is not palindrom") </script> <body> </body> </html>
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
You do nothing! A sequence of numbers will contain no X and so nothing needs doing!
8086 assembly language program to check wether given number is perfect or not
Reference: cprogramming-bd.com/c_page4.aspx#ODD%20 Numbers
To write a C++ program to display the student details using class and array of object.
Count all the given numbers then count all the numbers of a given value. Divide one by the other and multiply by 100. For instance, if there are 50 numbers in total and 5 of them have the value 42, then the percentage of numbers with the value 42 is 5 / 50 * 100 = 10%.
ring me and ill explain - 086 22222222222222227 ring me
Check below link
for(int i = 1; i < 100; i+=2) { System.out.println(i); }
quotient is the answer to a division problem so after dividing, to check your answer, you need to take the quotient and multiply it to one of the given numbers.
the following program will display all numbers given in the array in ascending order #include<stdio.h> void main() { int i,h,p; int numbers[10]={5,8,3,2,6,7,9,4,1,10}; for(p=0;p<=8;p=p+1) { for(i=0;i<=8;i=i+1) { if(numbers[i]>numbers[i+1]) { a=numbers[i]; numbers[i]=numbers[i+1]; numbers[i+1]=a; } } } for(i=0;i<=9;i=i+1) { printf("%d ",numbers[i]); } }
No numbers are given!