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.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:5c0187de4ea245dade00ab0cedc0c4c31917dcf193d2ce9c61859ca78067711c
Metadata
sha256:206d89891e8f94e9424aef137581dcd61fd244e66cd3924cbcbedb0d40959f7b
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:74b94bde42b1c18ff7732dc7bbbff3de043dd84a988e92fc40d0581f0cbc10e2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb