Erdős problem 342 · problems.science

$a(3) = 4$ : among sums $> 3$ with a unique representation from $\{1,2,3\}$ , the smallest is $4 = 1 + 3$ . The candidate $5 = 2 + 3$ is ruled out by minimality since $4$ has a unique representation.

Sources

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

7 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

342.lean

Retained formal statement6 of 7

$a(2) = 3$ : the only pair $(i,j)$ with $i < j < 2$ is $(0,1)$ , giving $1 + 2 = 3$ .

FormalConjectures/ErdosProblems/342.leanErdos342.erdos_342.test.a21 lineExact file

1∀ (a : ℕ → ℕ), Erdos342.IsUlamSequence a → a 2 = 3

TestStatement only, no proof

Sources

Search problems.science