Skip to content

Erdős problem 236

Start work

Let f(n)f(n) count the number of solutions to n=p+2kn=p+2^k for prime pp and k≥0k\geq 0. Show that f(n)=o(log⁡n)f(n)=o(\log n).

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:4fff5afee21d2afdb9d8312f5e99d3aea4a5eaf11f143d892a00df74c21fda0e
Metadata
sha256:862773437964fb9dc97af60d5243660fe3feb5a35ed1d73a39836d8e8e5fe05d
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:bc60300fffdca8a2dd0ec816ad22c36d56a4373df07b6f5cafe030485ca7f7eb
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON