Integers as sum of squares
This paper delt on the representation of integers as the sum of two or more than two squares. A natural question to ask is What is the smallest positive integer n such that every positive integer can be represented as sum of not more than n squares? Theorems, lemmas, and corollaries that support the...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
1995
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16243 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |
| 總結: | This paper delt on the representation of integers as the sum of two or more than two squares. A natural question to ask is What is the smallest positive integer n such that every positive integer can be represented as sum of not more than n squares? Theorems, lemmas, and corollaries that support the following results provide the answer to this inquiry.(a) Prime of the form 4k + 1 can be expressed uniquely as sum of two squares, (b) Integers of the form n = N2m, where m is square-free, can be represented as sum of two squares if and onlyif m contains no prime factor of the form 4k + 3, (c) Integers having prime factors of the form 4k + 3 raised to an even power can be expressed as sum of two squares, (d) No positive integer of the form 4 n (8m + 7) can be represented as sum of three squares, (3) Any positive integer n can be represented as sum of four squares, some of which may be zero. |
|---|