Skip to content

Erdős problem 1000

Let A={n1<n2<⋯ }A=\{n_1<n_2<\cdots\} be an infinite sequence of integers, and let ϕA(k)\phi_A(k) count the number of 1≤m≤nk1\leq m\leq n_k such that the fraction mnk\frac{m}{n_k} does not have denominator njn_j for j<kj<k when written in lowest form; equivalently, nk(m,nk)≠nj \frac{n_k}{(m,n_k)}\neq n_j for all 1≤j<k1\leq j<k.

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal5 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it577 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.