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. /Prove that the fraction (21n + 4)/(14n + 3) cannot be cancelled for any whole number n…
AdvancedMathematicsHigh School (11–12)Number TheoryConceptualNumericalOlympiad

Prove that the fraction (21n + 4)/(14n + 3) cannot be cancelled for any whole number n…

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.

  1. Prove that the fraction 21n+414n+3\dfrac{21n + 4}{14n + 3}14n+321n+4​ cannot be cancelled for any whole number nnn. Find whole numbers uuu and vvv that make u(14n+3)−v(21n+4)u(14n + 3) - v(21n + 4)u(14n+3)−v(21n+4) a constant.
  1. The fraction 5n+68n+7\dfrac{5n + 6}{8n + 7}8n+75n+6​ can be cancelled for some nnn. Prove that its numerator and denominator can share only the factor 131313.
  1. How many whole numbers nnn from 111 to 100010001000 make 5n+68n+7\dfrac{5n + 6}{8n + 7}8n+75n+6​ a fraction that can be cancelled?

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). 3(14n+3)−2(21n+4)=42n+9−42n−8=13(14n + 3) - 2(21n + 4) = 42n + 9 - 42n - 8 = 13(14n+3)−2(21n+4)=42n+9−42n−8=1. Any common divisor divides 111, so the HCF is 111 and the fraction is in lowest terms.

Step 2. Part (b). 8(5n+6)−5(8n+7)=40n+48−40n−35=138(5n + 6) - 5(8n + 7) = 40n + 48 - 40n - 35 = 138(5n+6)−5(8n+7)=40n+48−40n−35=13. A common divisor divides 131313, a prime. So the only possible common factor above 111 is 131313.

Step 3. When it happens. Try n=0,1,…,12n = 0, 1, \dots, 12n=0,1,…,12: 5n+6=265n + 6 = 265n+6=26 is the multiple of 131313, at n=4n = 4n=4. Then 8n+7=39=3×138n + 7 = 39 = 3 \times 138n+7=39=3×13 too. Adding 131313 to nnn adds 656565 and 104104104, both multiples of 131313. So the fraction cancels exactly when n=13k+4n = 13k + 4n=13k+4.

Step 4. Part (c). The numbers 4,17,…,9914, 17, \dots, 9914,17,…,991 are 13k+413k + 413k+4 for k=0k = 0k=0 to 767676, so 777777 numbers.

Answer: the first fraction never cancels; the second cancels only by 131313, for 777777 values of nnn from 111 to 100010001000. Proof complete.

Source. Part (a) is the first problem of the first International Mathematical Olympiad (Romania, 1959).

Log in to save this for later
← All Problems
← A cook has a 7-litre jug, an 11-litre jug, a tap and a large pot…A designer wants to tile a rectangle of area 1800 square centimetres with a whole number of rows… →
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 →