1105 as Sum of Two Squares
Jump to navigation
Jump to search
This theorem requires a proof.
Demonstrate there are no smaller with as many ways of doing this
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
$1105$ can be expressed as the sum of two squares in more ways than any smaller integer:
| \(\displaystyle 1105\) | \(=\) | \(\, \displaystyle 1089 + 16 \, \) | \(\, \displaystyle =\, \) | \(\displaystyle 33^2 + 4^2\) | |||||||||
| \(\displaystyle \) | \(=\) | \(\, \displaystyle 1024 + 81 \, \) | \(\, \displaystyle =\, \) | \(\displaystyle 32^2 + 9^2\) | |||||||||
| \(\displaystyle \) | \(=\) | \(\, \displaystyle 961 + 144 \, \) | \(\, \displaystyle =\, \) | \(\displaystyle 31^2 + 12^2\) | |||||||||
| \(\displaystyle \) | \(=\) | \(\, \displaystyle 625 + 529 \, \) | \(\, \displaystyle =\, \) | \(\displaystyle 24^2 + 23^2\) |
Demonstrate there are no smaller with as many ways of doing this
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $1105$
- 1994: Richard K. Guy: Unsolved Problems in Number Theory (2nd ed.)
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $1105$
