Skip to content

Erdős problem 849

Start work

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?

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:115873f1392796944cef8fe57104c910a59884b6e85fe6a1ed908480ee43babc
Metadata
sha256:0e36ca986d646e343505596da84cf416dd4096473414cbba6ffc48024334faf9
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:79a3da13b44e0df251be88c84eb002d28e4c25bf258daca50d5defda8bfa54b5
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON