HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A cook has a 7-litre jug, an 11-litre jug, a tap and a large pot…
HardMathematicsHigh School (11–12)Number TheoryConceptualNumericalOlympiad

A cook has a 7-litre jug, an 11-litre jug, a tap and a large pot…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

A cook has a 777-litre jug, an 111111-litre jug, a tap and a large pot. She fills the small jug at the tap and empties it into the pot. She also fills the large jug from the pot and pours it away. She wants exactly 111 litre to end up in the pot.

  1. Explain why the pot then holds 7x−11y7x - 11y7x−11y litres, where xxx is the number of small jugs poured in and yyy the number of large jugs taken out.
  1. Find the smallest x≥1x \ge 1x≥1 and the matching y≥0y \ge 0y≥0 with 7x−11y=17x - 11y = 17x−11y=1.
  1. A second cook has jugs of 666 litres and 151515 litres. Prove that she can never get exactly 111 litre in the pot.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Euclidean algorithm: gcd⁡(a,b)=gcd⁡(b,r)\gcd(a, b) = \gcd(b, r)gcd(a,b)=gcd(b,r) where a=bq+ra = bq + ra=bq+r. Bezout: ax+by=gcd⁡(a,b)ax + by = \gcd(a, b)ax+by=gcd(a,b) for some integers xxx, yyy, and ax+by=cax + by = cax+by=c is solvable exactly when gcd⁡(a,b)∣c\gcd(a, b) \mid cgcd(a,b)∣c.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Part (a). Each pour into the pot adds 777 litres. Each removal takes out 111111 litres. After xxx pours and yyy removals the pot holds 7x−11y7x - 11y7x−11y litres.

Step 2. Part (b). We need 7x7x7x to be 111 more than a multiple of 111111. The values 7x7x7x for x=1,…,8x = 1, \dots, 8x=1,…,8 are 7,14,21,28,35,42,49,567, 14, 21, 28, 35, 42, 49, 567,14,21,28,35,42,49,56. Their remainders on division by 111111 are 7,3,10,6,2,9,5,17, 3, 10, 6, 2, 9, 5, 17,3,10,6,2,9,5,1. So x=8x = 8x=8, and 56=11×5+156 = 11 \times 5 + 156=11×5+1 gives y=5y = 5y=5.

Step 3. Part (c). Every amount is 6x−15y=3(2x−5y)6x - 15y = 3(2x - 5y)6x−15y=3(2x−5y), a multiple of 333. So 111 litre is impossible. This is Bezout's condition: 111 is not a multiple of gcd⁡(6,15)=3\gcd(6, 15) = 3gcd(6,15)=3.

Answer: 888 fills of the 777-litre jug in, 555 fills of the 111111-litre jug out; with jugs of 666 and 151515 litres only multiples of 333 litres are possible. Proof complete.

Watch out. The pot needs room for the 565656 litres before the removals start, or the steps must be mixed. Only the totals matter for the count.

Log in to save this for later
← All Problems
← Numbers of the form 2ᵏ - 1 share factors in a neat way…Prove that the fraction (21n + 4)/(14n + 3) cannot be cancelled for any whole number n… →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. The triangular numbers are 1, 3, 6, 10, …, where the nth one is (n(n + 1))/2…Advanced
  2. Prove that the equation x³ + y³ + z³ = n has no solution in integers when n leaves remainder 4 or 5…Advanced
  3. Find every triple of positive integers a ≤ b ≤ c with 1/a + 1/b + 1/c = 1, and prove that there are…Advanced
  4. Find all pairs of positive integers (x, y) with x² - y² = 945…Hard
  5. A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 100…Advanced
All problems on this topic →