benchmarks.wiki / Public workspace

Omni-MATH / Shuxin begins with 10 red candies, 7 yellow candies, and 3 blue candies. After…

Problem

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

problem

Shuxin begins with 10 red candies, 7 yellow candies, and 3 blue candies. After eating some of the candies, there are equal numbers of red, yellow, and blue candies remaining. What is the smallest possible number of candies that Shuxin ate?

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