Erdős problem 1214

Let $x,y\geq 1$ be integers such that, for all $n\geq 1$ , the set of primes dividing $x^{n}-1$ is equal to the set of primes dividing $y^n-1$ . Must $x=y$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/1214.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1214.leanErdos1214.erdos_12142 linesExact file

1True ↔2  ∀ (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 = y

SolvedStatement only, no proof