Skip to content

Erdős problem 435

Let nNn\in\mathbb{N} with npkn\neq p^k for any prime pp and k0k\geq 0. What is the largest integer not of the form 1i<nci(ni)\sum_{1\leq i<n}c_i\binom{n}{i} where the ci0c_i\geq 0 are integers?

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:8147c86e76baaf880ae52ce0defc50a30bad1680df795a90aca471785b72d909
Metadata
sha256:416a914f74465d38b973234dd4ab142828ff1daaf4951ce95e19b197f530458f
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:223fd408265b468ed611d5f613bfa5dd235a4930209ded48f10a00c4708911cd
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page