benchmarks.wiki / Public workspace

Omni-MATH / Seven little children sit in a circle. The teacher distributes pieces of candy…

Problem

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

problem

Seven little children sit in a circle. The teacher distributes pieces of candy to the children in such a way that the following conditions hold. - Every little child gets at least one piece of candy. - No two little children have the same number of pieces of candy. - The numbers of candy pieces given to any two adjacent little children have a common factor other than 1. - There is no prime dividing every little child's number of candy pieces. What is the smallest number of pieces of candy that the teacher must have ready for the little children?

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