Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Nonhypotenuse number

From Wikipedia, the free encyclopedia
Number whose square is not the sum of 2 non-zero squares
5 isnot a nonhypotenuse number

Inmathematics, anonhypotenuse number is anatural number whose squarecannot be written as the sum of two nonzero squares. The name stems from the fact that an edge of length equal to a nonhypotenuse numbercannot form thehypotenuse of aright angle triangle with integer sides.

The numbers 1, 2, 3, and 4 are all nonhypotenuse numbers. The number 5, however, isnot a nonhypotenuse number as52=32+42{\displaystyle 5^{2}=3^{2}+4^{2}}.

The first fifty nonhypotenuse numbers are:

1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 14, 16, 18, 19, 21, 22, 23, 24, 27, 28, 31, 32, 33, 36, 38, 42, 43, 44, 46, 47, 48, 49, 54, 56, 57, 59, 62, 63, 64, 66, 67, 69, 71, 72, 76, 77, 79, 81, 83, 84 (sequenceA004144 in theOEIS)

Although nonhypotenuse numbers are common among small integers, they become more-and-more sparse for larger numbers. Yet, there are infinitely many nonhypotenuse numbers, and the number of nonhypotenuse numbers not exceeding a valuex scales asymptotically withx/logx.[1]

The nonhypotenuse numbers are those numbers that have noprime factors ofthe form 4k+1.[2] Equivalently, they are the number that cannot be expressed in the formK(m2+n2){\displaystyle K(m^{2}+n^{2})} whereK,m, andn are all positive integers. A number whose prime factors are notall of the form 4k+1 cannot be the hypotenuse of aprimitive integer right triangle (one for which the sides do not have a nontrivial common divisor), but may still be the hypotenuse of a non-primitive triangle.[3]

The nonhypotenuse numbers have been applied to prove the existence ofaddition chains that compute the firstn{\displaystyle n} square numbers using onlyn+o(n){\displaystyle n+o(n)} additions.[4]

See also

[edit]

References

[edit]
  1. ^D. S.; Beiler, Albert H. (1968), "Albert Beiler,Consecutive Hypotenuses of Pythagorean Triangles",Mathematics of Computation,22 (103):690–692,doi:10.2307/2004563,JSTOR 2004563. This review of a manuscript of Beiler's (which was later published inJ. Rec. Math.7 (1974) 120–133,MR 0422125) attributes this bound to Landau.
  2. ^Shanks, D. (1975), "Non-hypotenuse numbers",Fibonacci Quarterly,13 (4):319–321,doi:10.1080/00150517.1975.12430618,MR 0387219.
  3. ^Beiler, Albert (1966),Recreations in the Theory of Numbers: The Queen of Mathematics Entertains (2 ed.), New York: Dover Publications, p. 116-117,ISBN 978-0-486-21096-4
  4. ^Dobkin, David;Lipton, Richard J. (1980), "Addition chain methods for the evaluation of specific polynomials",SIAM Journal on Computing,9 (1):121–125,doi:10.1137/0209011,MR 0557832

External links

[edit]
Classes ofnatural numbers
Powers and related numbers
Of the forma × 2b ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Otherprime factor ordivisor related numbers
Numeral system-dependent numbers
Arithmetic functions
anddynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Generated via asieve
Sorting related
Graphemics related
Retrieved from "https://en.wikipedia.org/w/index.php?title=Nonhypotenuse_number&oldid=1317617355"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp