Skip to content

Erdős problem 236

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

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:bc60300fffdca8a2dd0ec816ad22c36d56a4373df07b6f5cafe030485ca7f7eb
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page