Frobenius numbers of Pythagorean triples
From MaRDI portal
Publication:5248148
Abstract: Given relatively prime integers , the Frobenius number is defined as the largest integer which cannot be expressed as with nonnegative integers. In this article, we give the Frobenius number of primitive Pythagorean triples. That is, [ g(m^2-n^2, 2mn, m^2+n^2) = (m-1)(m^2-n^2) + (m-1)(2mn) - (m^2 + n^2). ]
Recommendations
- Formulae for the Frobenius number in three variables
- Some properties of Frobenius numbers and a fraction of symmetric semigroups in the weak limit for \(n=3\)
- scientific article; zbMATH DE number 3983264
- On formulas for the Frobenius number of a numerical semigroup.
- scientific article; zbMATH DE number 5041220
Cites work
Cited in
(7)- scientific article; zbMATH DE number 7233012 (Why is no real title available?)
- The Frobenius problem for extended Thabit numerical semigroups
- On numerical semigroups generated by primitive Pythagorean triplets
- Pythagorean triples containing generalized Lucas numbers
- A note on defining ideals of monomial curves associated to primitive Pythagorean triples
- Frobenius numbers associated with Diophantine triples of x^2+y^2=z^3
- Frobenius numbers associated with Diophantine triples of x^2 + 3y^2 = z^3
This page was built for publication: Frobenius numbers of Pythagorean triples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248148)