9 citations · 18 across the 11 of their papers we have counts for
Showing math.GMShow all
3 papers · 1 filter
math.GM2024
Generalization of Cantor Pairing Polynomials (Bijective Mapping Among Natural Numbers) from N02 to N0 to Z2 to N0 and N03 to N
Sandor Kristyan
The Cantor pairing polynomials are extended to larger 2D sub-domains and more complex mapping, of which the most important property is the bijectivity. If corners are involved insi…
math.GM2024
On the Simple Divisibility Restrictions by Polynomial Equation a n+bn=cn Itself in Fermat Last Theorem for Integer/Complex/Quaternion Triples
Sandor Kristyan
The divisibility restrictions in the famous equation a n+bn=cn in Fermat Last Theorem (FLT, 1637) is analyzed how it selects out many triples to be Fermat triple (i.e. solutions) i…
math.GM2017★ 9 cited
On the statistical distribution of prime numbers, a view from where the distribution of prime numbers is not erratic
Sandor Kristyan
Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and the…