Skip to content

Erdős problem 770

For odd n, the values of h n form an unbounded set. This is described as 'easy to see' in [Er74b].

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:957ee7bf0d713a3eea56b278d92551f2a5fe8185eda70b3232dba1932fcb3c9d
Metadata
sha256:d35d0f098c834e40aa789c5d4f1e822879c268aac64339df9dd73d91ca6c9e95
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:c671773b815b7431f3bace9b65d95682dd13511e78cfc0b26332fbb0a44cf47f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page