Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2000 PMWC Problems/Problem T1

Revision as of 12:05, 23 December 2019 by Skyguy88 (talk | contribs) (→‎See Also)

Problem

A box contains $4000$ to $6000$ candies. When the candies are evenly distributed to $5$, $6$, $7$, $8$, or $9$ children, there is always one candy left. If the candies are packaged into small bags each having the same number of candies, what is the largest number of candies below $4000$ in each bag so that no candies are left?

Solution

See Also

Back to test: https://artofproblemsolving.com/wiki/index.php/2000_PMWC_Problems

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2000_PMWC_Problems/Problem_T1&oldid=113230"