Frobenius numbers of Pythagorean triples
Abstract
Given relatively prime integers a1, …c, an, the Frobenius number g(a1, …c, an) is defined as the largest integer which cannot be expressed as x1 a1 + …b + xn an with xi nonnegative integers. In this article, we give the Frobenius number of primitive Pythagorean triples. That is, \[ g(m2-n2, 2mn, m2+n2) = (m-1)(m2-n2) + (m-1)(2mn) - (m2 + n2). \]
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.