Erdős problem 1212 · problems.science

Let $G$ be the graph with vertex set those pairs $(x,y)\in \mathbb{N}^2$ with $\mathrm{gcd}(x,y)=1$ , in which we join two vertices if the differ in only one coordinate, and there by $\pm 1$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

8 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1212.lean

Retained formal statement3 of 8

Core of the composite-anchor reduction: horizontal-leg vertices $(s, c)$ for $a \le s \le b$ are valid, given the anchor $c$ is composite and coprime to the whole leg.

FormalConjectures/ErdosProblems/1212.leanErdos1212.horizontal_leg_valid2 linesExact file

1∀ {a b c : ℕ},2  c.Composite → 2 ≤ a → (∀ (s : ℕ), a ≤ s → s ≤ b → s.gcd c = 1) → ∀ (s : ℕ), a ≤ s → s ≤ b → Erdos1212.Valid (s, c)

APIStatement only, no proof

Sources

Search problems.science