Number Theory · Guided Practice
Number Theory
16 questions with answers and video solutions. Try each one before revealing the answer.
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
No hints on this one — its full written solution is with the answer.
Answer
Hence find such that
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
No hints on this one — its full written solution is with the answer.
(a)Use the Euclidean algorithm to find , the greatest common divisor of 703 and 399.
(b)Find integers and such that
(c)Hence find integers and such that
Answer
(b)
(c)
Use the Euclidean algorithm to find integers and such that
Answer
Use the Euclidean algorithm to find integers and such that
Answer
Use the Euclidean algorithm to find integers and such that
Answer
Use the Euclidean algorithm to find integers and such that
Express in base 7.
Answer
(a)Use the Euclidean algorithm to find , the greatest common divisor of 1118 and 416.
(b)Hence find integers and such that
Answer
(b)
(a)Use the Euclidean algorithm to find , the greatest common divisor of 1428 and 567.
(b)Find integers and such that
Answer
(b) Working backwards, , so and
Express in base 9.
Answer
r 2, r 1, r 6, so the answer is
Keep practising
More number theory questions
New questions, modelled on past paper questions and checked against their marking instructions. Not reprints — you have not seen these before.
Practice questions courtesy of Maths.scot. Full written solutions are on his site — the links above go straight to them.