Waec Model Questions Vol1 2019 Mathematics Question 1

Practice essay / theory question 1 from the 2019 Waec Model Questions Vol1 Mathematics examination. This question covers Number and Numeration, Number Theory, Chinese Remainder Theorem .

Waec Model Questions Vol1 2019 Mathematics Essay / Theory

Topics: Number and Numeration Number Theory Chinese Remainder Theorem

Question 1 WAEC_MODEL_QUESTIONS_VOL1 • 2019 • MATHEMATICS • essay

A positive integer N satisfies the following conditions: when divided by 7 it leaves a remainder of 3; when divided by 9 it leaves a remainder of 5; and when divided by 11 it leaves a remainder of 7.

Question Parts

( a )

Find the smallest such N that is less than 2000.

( b )

Using the value of N obtained in part (a), determine the greatest common divisor (GCD) of N and 693.

( c )

If N is expressed in the form 1000a + b where 0 ≤ b < 1000, find the value of a + b.

Detailed Solution & Marking Scheme

Get the step-by-step solution, key points required by examiners and detailed marking guidance through the Edcrib AI Tutor.

Reveal Answer

About This Question

This is Waec Model Questions Vol1 2019 Mathematics Question 1. It is one of the essay questions from the 2019 Waec Model Questions Vol1 Mathematics examination.

The question covers Number and Numeration, Number Theory, Chinese Remainder Theorem .

View More Waec Model Questions Vol1 2019 Mathematics Questions More Waec Model Questions Vol1 Practice Questions Back to Questions

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows

Chat with Support