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 positive whole numbers a < b have the sum a + b = 96 and the least common multiple lcm(a, b) =…
AdvancedMathematicsHigh School (11–12)Number TheoryConceptualNumericalOlympiad

Two positive whole numbers a < b have the sum a + b = 96 and the least common multiple lcm(a, b) =…

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 positive whole numbers a<ba < ba<b have the sum a+b=96a + b = 96a+b=96 and the least common multiple lcm⁡(a,b)=330\operatorname{lcm}(a, b) = 330lcm(a,b)=330. You are asked to find them without trying every pair.

  1. Prove that gcd⁡(a+b,lcm⁡(a,b))=gcd⁡(a,b)\gcd(a + b, \operatorname{lcm}(a, b)) = \gcd(a, b)gcd(a+b,lcm(a,b))=gcd(a,b) for all positive whole numbers aaa and bbb. Write a=dxa = dxa=dx and b=dyb = dyb=dy with gcd⁡(x,y)=1\gcd(x, y) = 1gcd(x,y)=1.
  1. Use part (a) to find gcd⁡(a,b)\gcd(a, b)gcd(a,b) for the two numbers.
  1. Find aaa and bbb.

Check your answer

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

Need a reminder? The key ideaShowHide

gcd⁡\gcdgcd takes the smaller exponent of each prime and lcm⁡\operatorname{lcm}lcm the larger, so gcd⁡(a,b)⋅lcm⁡(a,b)=ab\gcd(a, b) \cdot \operatorname{lcm}(a, b) = abgcd(a,b)⋅lcm(a,b)=ab. Also gcd⁡(a,b)=gcd⁡(a−kb,b)\gcd(a, b) = \gcd(a - kb, b)gcd(a,b)=gcd(a−kb,b), and a=dxa = dxa=dx, b=dyb = dyb=dy with gcd⁡(x,y)=1\gcd(x, y) = 1gcd(x,y)=1.

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.

Plan. Reduce to coprime xxx and yyy, where the sum and the product share no factor.

Step 1. Set up. Let d=gcd⁡(a,b)d = \gcd(a, b)d=gcd(a,b), a=dxa = dxa=dx, b=dyb = dyb=dy, with gcd⁡(x,y)=1\gcd(x, y) = 1gcd(x,y)=1. Then a+b=d(x+y)a + b = d(x + y)a+b=d(x+y) and lcm⁡(a,b)=dxy\operatorname{lcm}(a, b) = dxylcm(a,b)=dxy.

Step 2. x+yx + yx+y and xyxyxy are coprime. Suppose a prime ppp divides both. Then p∣xyp \mid xyp∣xy, so p∣xp \mid xp∣x or p∣yp \mid yp∣y, say p∣xp \mid xp∣x. Since p∣x+yp \mid x + yp∣x+y, also p∣yp \mid yp∣y. That contradicts gcd⁡(x,y)=1\gcd(x, y) = 1gcd(x,y)=1.

Step 3. Part (a). So gcd⁡(d(x+y),dxy)=dgcd⁡(x+y,xy)=d\gcd(d(x + y), dxy) = d\gcd(x + y, xy) = dgcd(d(x+y),dxy)=dgcd(x+y,xy)=d.

Step 4. Part (b). gcd⁡(a,b)=gcd⁡(96,330)\gcd(a, b) = \gcd(96, 330)gcd(a,b)=gcd(96,330). Since 96=25⋅396 = 2^5 \cdot 396=25⋅3 and 330=2⋅3⋅5⋅11330 = 2 \cdot 3 \cdot 5 \cdot 11330=2⋅3⋅5⋅11, this is 666.

Step 5. Part (c). Now x+y=96÷6=16x + y = 96 \div 6 = 16x+y=96÷6=16 and xy=330÷6=55xy = 330 \div 6 = 55xy=330÷6=55. So xxx and yyy are the roots of t2−16t+55=0t^2 - 16t + 55 = 0t2−16t+55=0, which are 555 and 111111. Hence a=30a = 30a=30 and b=66b = 66b=66.

Check. 30+66=9630 + 66 = 9630+66=96 and lcm⁡(30,66)=330\operatorname{lcm}(30, 66) = 330lcm(30,66)=330.

Answer: gcd⁡(a,b)=6\gcd(a, b) = 6gcd(a,b)=6, a=30a = 30a=30 and b=66b = 66b=66. Proof complete.

Log in to save this for later
← All Problems
← Numbers of the form 2ⁿ - 1 are called Mersenne numbers…Let dn = gcd(n² + 3, n + 2) for positive whole numbers 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 →