Skip to content

Erdős problem 849

Is it true that, for every integer t≥1t\geq1, there is some integer aa such that (nk)=a{n \choose k} = a with 1≤k≤n21\leq k \le \frac{n}{2} has exactly tt solutions?

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:115873f1392796944cef8fe57104c910a59884b6e85fe6a1ed908480ee43babc
Metadata
sha256:0e36ca986d646e343505596da84cf416dd4096473414cbba6ffc48024334faf9
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:79a3da13b44e0df251be88c84eb002d28e4c25bf258daca50d5defda8bfa54b5
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page