partitions

asked 2013-10-08 04:53:20 -0500

Komolo gravatar image

updated 2015-01-13 15:37:41 -0500

FrédéricC gravatar image
Let f(k) be the sum of the first k odd natural numbers; that is, f(k)=1+2+…+(2k?1).  Compute the values f(k) for several values.  Can you see a pattern?  Can you prove the pattern?
Which positive integers can be written as the sum of two squares of (nonnegative) integers?  For example, 4=02+22, 5=12+22, and 8=22+22.  However, 3 cannot be written as the sum of two squares.  Determine which of the first 100 natural numbers can be written as the sum of two squares.  What patterns do you observe? How could you gain more evidence to support your conjectures?
edit retag flag offensive close merge delete

Comments

This is just a homework problem. Please rephrase as a specific question about Sage or it should be closed.

kcrisman gravatar imagekcrisman ( 2013-10-08 06:14:25 -0500 )edit