MathDB
Complex Numbers

Source:

February 21, 2006
modular arithmeticAMCAIMEcomplex numbers

Problem Statement

Given a positive integer nn, it can be shown that every complex number of the form r+sir+si, where rr and ss are integers, can be uniquely expressed in the base n+i-n+i using the integers 1,2,,n21,2,\ldots,n^2 as digits. That is, the equationr+si=am(n+i)m+am1(n+i)m1++a1(n+i)+a0 r+si=a_m(-n+i)^m+a_{m-1}(-n+i)^{m-1}+\cdots +a_1(-n+i)+a_0 is true for a unique choice of non-negative integer mm and digits a0,a1,,ama_0,a_1,\ldots,a_m chosen from the set {0,1,2,,n2}\{0,1,2,\ldots,n^2\}, with am0a_m\ne 0. We write r+si=(amam1a1a0)n+i r+si=(a_ma_{m-1}\ldots a_1a_0)_{-n+i} to denote the base n+i-n+i expansion of r+sir+si. There are only finitely many integers k+0ik+0i that have four-digit expansions k=(a3a2a1a0)3+i    a30. k=(a_3a_2a_1a_0)_{-3+i}~~~~a_3\ne 0. Find the sum of all such kk.