This would require some computer knowledge. It can make it easier to find out the prime numbers without figuring it out in your head.
Chat with our AI personalities
By learning how to program on C+.
$n = 10*(1+10)/2;
int i, sum = 0; for (i=0; i<20; i+=2) sum+=i;
First, multiply the consecutive numbers. Your total will be the highest factor.
-- Write down a list of the first ten whole numbers. -- For each one, multiply it by itself, and write the product next to it.