a(mod p) ≤b(mod p) for all Primes p Implies a = b

DOI10.2307/2322420zbMath0616.10003OpenAlexW2325175224WikidataQ106072013 ScholiaQ106072013MaRDI QIDQ4724695

Mario Szegedy, Paul Erdős, Péter P. Pálfy

Publication date: 1987

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2322420

zbMATH Keywords

divisibility by primesSylvester-Schur theorem

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

This page was built for publication: a(mod p) ≤b(mod p) for all Primes p Implies a = b