Timeline for Numbers that are the sum of 2 distinct nonzero squares in exactly 1 way

12 events

when toggle format	what		by	license	comment
Jan 29, 2019 at 3:02	comment	added	Konstantinos Kanakoglou		You are welcome Greggz.
Jan 24, 2019 at 3:42	history	edited	Konstantinos Kanakoglou	CC BY-SA 4.0	added 248 characters in body
Jan 21, 2019 at 18:57	comment	added	Greggz		Thank you so much for your work and dedication
Jan 21, 2019 at 18:57	vote	accept	Greggz
Jan 21, 2019 at 18:22	history	edited	Konstantinos Kanakoglou	CC BY-SA 4.0	added 8 characters in body
Jan 21, 2019 at 18:13	comment	added	Konstantinos Kanakoglou		I have edited the answer providing more details and some examples.
Jan 21, 2019 at 18:10	history	edited	Konstantinos Kanakoglou	CC BY-SA 4.0	added 832 characters in body
Jan 21, 2019 at 15:33	comment	added	Konstantinos Kanakoglou		@Greggz, when a number $p=4k+1$ i just mean that $p\equiv 1(\mod 4)$. Regarding your second question: If all $a_i$ are integers then $r'_2(n)=1$ is equivalent to either $B=b+1=1+1=2$ or $B=b+1=2+1=3$ and $a_0$: even. In the latter case we get: $r'_2(n)=\frac{1}{2}(B-(-1)^{a_0})=\frac{1}{2}(3-1)=1$.
Jan 21, 2019 at 9:21	comment	added	Greggz		Also, in your last point between brackets, can you explain it trough an example ? My math syntax is really limited. Thank you so much
Jan 21, 2019 at 9:19	comment	added	Greggz		Thanks for your answer, can you please explain to me how do I test if a number is 4k+1
Jan 21, 2019 at 3:46	history	edited	Konstantinos Kanakoglou	CC BY-SA 4.0	added 440 characters in body
Jan 21, 2019 at 3:19	history	answered	Konstantinos Kanakoglou	CC BY-SA 4.0