Skip to content

Erdős problem 295

Let k(N)k(N) denote the smallest kk such that there exists Nn1<<nkN ≤ n_1 < ⋯ < n_k with 1n1+...+1nk=1\frac 1 {n_1} + ... + \frac 1 {n_k} = 1

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#295
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page