ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n∈Nn\in\mathbb{N} satisfy n≠0n\neq0 and suppose that n≠pkn\neq p^k for every prime pp and every k∈Nk\in\mathbb{N}. What is the largest integer not of the form ∑1≤i<nci(ni),\sum_{1\leq i<n}c_i\binom ni, where every ci∈Nc_i\in\mathbb{N}? The claimed largest integer is ∑p∣n(∑1≤d≤vp(n)(npd))(p−1)−n,\sum_{p\mid n}\left(\sum_{1\leq d\leq v_p(n)}\binom n{p^d}\right)(p-1)-n, where the outer sum is over the prime divisors pp of nn and vp(n)v_p(n) is the exponent of pp in nn.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.