benchmarks.wiki / Public workspace

Omni-MATH / Let n be a positive integer and p a fixed prime. We have a deck of n cards, numbered 1, 2,…, n and p boxes for put the cards on them. Determine all posible integers n for which is …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let nn be a positive integer and pp a fixed prime. We have a deck of nn cards, numbered 1,2,…,n1,\ 2,\ldots,\ n and pp boxes for put the cards on them. Determine all posible integers nn for which is possible to distribute the cards in the boxes in such a way the sum of the numbers of the cards in each box is the same.
Plain-text mathematical notation (without MathML)
Let n be a positive integer and p a fixed prime. We have a deck of n cards, numbered 1, 2,…, n and p boxes for put the cards on them. Determine all posible integers n for which is possible to distribute the cards in the boxes in such a way the sum of the numbers of the cards in each box is the same.
Original LaTeX notation
Let $n$ be a positive integer and $p$ a fixed prime. We have a deck of $n$ cards, numbered $1,\ 2,\ldots,\ n$ and $p$ boxes for put the cards on them. Determine all posible integers $n$ for which is possible to distribute the cards in the boxes in such a way the sum of the numbers of the cards in each box is the same.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import