Erdős problem 1214
Let be integers such that, for all , the set of primes dividing is equal to the set of primes dividing . Must ?
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/1214.leanTrue ↔ ∀ (x y : ℕ), x ≥ 1 → y ≥ 1 → (∀ n ≥ 1, {p | Nat.Prime p ∧ p ∣ x ^ n - 1} = {p | Nat.Prime p ∧ p ∣ y ^ n - 1}) → x = ySolvedStatement only, no proof