olymmath

HMMT November 2018 H4

  • Theme
  • Answer

I have two cents and Bill has nn cents. Bill wants to buy some pencils, which come in two different packages. One package of pencils costs 6 cents for 7 pencils, and the other package of pencils costs a dime for a dozen pencils (i.e. 10 cents for 12 pencils). Bill notes that he can spend all nn of his cents on some combination of pencil packages to get PP pencils. However, if I give my two cents to Bill, he then notes that he can instead spend all n+2n+2 of his cents on some combination of pencil packages to get fewer than PP pencils. What is the smallest value of nn for which this is possible? Note: Both times Bill must spend all of his cents on pencil packages, i.e. have zero cents after either purchase.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

100

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2018/h4 · Tag W1C5M2KA7Z · Edit this page on GitHub · Keys: j next, k previous