The integer 30 can be written as a sum of consecutive positive integers in three ways:
30 = 9+10+11 = 6+7+8+9 = 4+5+6+7+8.

Find the smallest positive integer which can be written as a sum of consecutive positive integers in 12 ways.

what about when you want to find the smallest positive int. which can be written as a sum of 12 ints in exactly 12 ways?

is there a set method where that can be done for: x ints in x ways??/

Posted by Ruby on 2005-04-20 18:40:15