Skip to content

Erdős problem 1085

Erdős and Pach showed that, for d≥5d \ge 5 odd, there exist constants c1(d),c2(d)>0c_1(d), c_2(d) > 0 such that p−12pn2−c1n4/3≤fd(n)≤p−12pn2+c2n4/3\frac{p - 1}{2p} n^2 - c_1 n^{4/3} ≤ f_d(n) \le \frac{p - 1}{2p} n^2 + c_2 n^{4/3} where p=⌊d2⌋p = \lfloor\frac d2\rfloor.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:7d2a24b8d4388f4f6012d594c6bbf9b1be218eba88fa5fcca7b09354e5ebca9a
Metadata
sha256:94a3997fe75c33f2aa135efac9052186f4742441fb60af400fc398df34ea7366
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:17b36662bef975f64dde1d1f240069b003e5efc4676edbdcd174230bae9f3446
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb