This is an old revision of this page, as edited by Rik Vantilborgh(talk | contribs) at 09:07, 3 March 2022(I changed k^2<=3n to 3k^2<=n - see Ernst Kani). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 09:07, 3 March 2022 by Rik Vantilborgh(talk | contribs)(I changed k^2<=3n to 3k^2<=n - see Ernst Kani)
In mathematics, Euler'sidoneal numbers (also called suitable numbers or convenient numbers) are the positive integers D such that any integer expressible in only one way as x2 ± Dy2 (where x2 is relatively prime to Dy2) is a prime power or twice a prime power. In particular, a number that has two distinct representations as a sum of two squares is composite. Every idoneal number generates a set containing infinitely many primes and missing infinitely many other primes.
Definition
A positive integer n is idoneal if and only if it cannot be written as ab + bc + ac for distinct positive integers a, b, and c.[1]
It is sufficient to consider the set { n + k2 | 3 . k2 ≤ n ∧ gcd (n, k) = 1 }; if all these numbers are of the form p, p2, 2 · p or 2s for some integer s, where p is a prime, then n is idoneal.[2]
Results of Peter J. Weinberger from 1973[3] imply that at most two other idoneal numbers exist, and that the list above is complete if the generalized Riemann hypothesis holds (some sources incorrectly claim that Weinberger's results imply that there's at most one other idoneal number).[4]
