MathDB
Four parts question

Source:

October 5, 2010
quadraticsalgebranumber theory unsolvednumber theory

Problem Statement

Let b2b \geq 2 be a positive integer.
(a) Show that for an integer NN, written in base bb, to be equal to the sum of the squares of its digits, it is necessary either that N=1N = 1 or that NN have only two digits.
(b) Give a complete list of all integers not exceeding 5050 that, relative to some base bb, are equal to the sum of the squares of their digits.
(c) Show that for any base b the number of two-digit integers that are equal to the sum of the squares of their digits is even.
(d) Show that for any odd base bb there is an integer other than 11 that is equal to the sum of the squares of its digits.