The cannonball problem asks when the number of cannonballs in a pyramidal stack can be one of these-the answer is only twice, when the number of cannonballs is either 1 or 4900. Lagrange proved that every positive integer can be expressed as the sum of four of these numbers, and the zeta function of two is defined as the su
The cannonball problem asks when the number of cannonballs in a pyramidal stack can be one of these-the answer is only twice, when the number of cannonballs is either 1 or 4900. Lagrange proved that every positive integer can be expressed as the sum of four of these numbers, and the zeta function of two is defined as the sum of their reciprocals. They are always congruent to zero or one modulo four, and their last digit is always 1, 4, 9, 6, or 5. FTP, identify these numbers which are formed by raising an integer to the second power.
The cannonball problem asks when the number of cannonballs in a pyramidal stack can be one of these-the answer is only twice, when the number of cannonballs is either 1 or 4900.
Square numbers or Squares