From Surf Wiki (app.surf) — the open knowledge base
Nonhypotenuse number
Number whose square is not the sum of 2 non-zero squares
Number whose square is not the sum of 2 non-zero squares
In mathematics, a nonhypotenuse number is a natural number whose square cannot be written as the sum of two nonzero squares. The name stems from the fact that an edge of length equal to a nonhypotenuse number cannot form the hypotenuse of a right angle triangle with integer sides.
The numbers 1, 2, 3, and 4 are all nonhypotenuse numbers. The number 5, however, is not a nonhypotenuse number as 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
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 value x scales asymptotically with x/.
The nonhypotenuse numbers are those numbers that have no prime factors of the form 4k+1. Equivalently, they are the number that cannot be expressed in the form K(m^2+n^2) where K, m, and n are all positive integers. A number whose prime factors are not all of the form 4k+1 cannot be the hypotenuse of a primitive 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.
The nonhypotenuse numbers have been applied to prove the existence of addition chains that compute the first n square numbers using only n+o(n) additions.
References
References
- D. S.. (1968). "Albert Beiler, ''Consecutive Hypotenuses of Pythagorean Triangles''". [[Mathematics of Computation]].
- Shanks, D.. (1975). "Non-hypotenuse numbers". [[Fibonacci Quarterly]].
- (1966). "Recreations in the Theory of Numbers: The Queen of Mathematics Entertains". Dover Publications.
- (1980). "Addition chain methods for the evaluation of specific polynomials". [[SIAM Journal on Computing]].
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Nonhypotenuse number — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report