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. /Two bells ring on their own schedules. A number x of minutes is wanted with x ≡ 5 pmod12 and x ≡ 11…
AdvancedMathematicsHigh School (11–12)Number TheoryNumericalOlympiad

Two bells ring on their own schedules. A number x of minutes is wanted with x ≡ 5 pmod12 and x ≡ 11…

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.

Two bells ring on their own schedules. A number xxx of minutes is wanted with x≡5(mod12)x \equiv 5 \pmod{12}x≡5(mod12) and x≡11(mod18)x \equiv 11 \pmod{18}x≡11(mod18). The moduli share the factor 666, so first check that the system can be solved. Then find the least positive solution and the modulus of the answer. Finally show that the system x≡5(mod12)x \equiv 5 \pmod{12}x≡5(mod12), x≡8(mod18)x \equiv 8 \pmod{18}x≡8(mod18) has no solution, and give the number of its solutions.

Check your answer

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

Need a reminder? The key ideaShowHide

With pairwise coprime moduli, a system x≡ai(modmi)x \equiv a_i \pmod{m_i}x≡ai​(modmi​) has one solution modulo M=m1m2⋯mkM = m_1 m_2 \cdots m_kM=m1​m2​⋯mk​. Lift one congruence at a time:

x=a1+m1t,then reduce modulo m2.\displaystyle x = a_1 + m_1 t, \quad \text{then reduce modulo } m_2.x=a1​+m1​t,then reduce modulo m2​.

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.

Given. x≡5(mod12)x \equiv 5 \pmod{12}x≡5(mod12) and x≡11(mod18)x \equiv 11 \pmod{18}x≡11(mod18), with gcd⁡(12,18)=6\gcd(12, 18) = 6gcd(12,18)=6.

Step 1. Compatible? 11−5=611 - 5 = 611−5=6, which is a multiple of 666. So there is a solution.

Step 2. Lift. x=5+12tx = 5 + 12tx=5+12t. Then 5+12t≡11(mod18)5 + 12t \equiv 11 \pmod{18}5+12t≡11(mod18), so 12t≡6(mod18)12t \equiv 6 \pmod{18}12t≡6(mod18). Divide by 666: 2t≡1(mod3)2t \equiv 1 \pmod 32t≡1(mod3), so t≡2(mod3)t \equiv 2 \pmod 3t≡2(mod3).

Step 3. The solution. t=2t = 2t=2 gives x=29x = 29x=29, and the answer is unique modulo lcm⁡(12,18)=36\operatorname{lcm}(12, 18) = 36lcm(12,18)=36.

Step 4. The second system. 8−5=38 - 5 = 38−5=3 is not a multiple of 666. Look at it modulo 222: the first congruence says xxx is odd, and 8(mod18)8 \pmod{18}8(mod18) says xxx is even. So there are 000 solutions.

Check. 29=2×12+529 = 2 \times 12 + 529=2×12+5 and 29=18+1129 = 18 + 1129=18+11.

Answer: the least solution is 292929, unique modulo 363636; the second system has 000 solutions.

Log in to save this for later
← All Problems
← The square of 376 is 141 376, which ends in 376 again…A coding club sets two remainders as a warm-up… →
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 →