Difference between revisions of "2000 PMWC Problems/Problem T1"
(Created page with "==Problem== A box contains <math>4000</math> to <math>6000</math> candies. When the candies are evenly distributed to <math>5</math>, <math>6</math>, <math>7</math>, <math>8</mat...") |
m (→See Also) |
||
| Line 5: | Line 5: | ||
==See Also== | ==See Also== | ||
| + | Back to test: https://artofproblemsolving.com/wiki/index.php/2000_PMWC_Problems | ||
Revision as of 11:05, 23 December 2019
Problem
A box contains 
to 
candies. When the candies are evenly distributed to 
, 
, 
, 
, or 
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 in each bag so that no candies are left?
Solution
See Also
Back to test: https://artofproblemsolving.com/wiki/index.php/2000_PMWC_Problems
