Start learning →

SNAP Modern Mathematics — practice questions

Explore 90 free Modern Mathematics questions in SNAP Quantitative Aptitude. Open each question or exercise to read its content, reference answers and available explanation.

Practise Modern Mathematics with Quill →

Modern Mathematics questions and exercises with answers

Showing questions 1–30 of 90.

Euclid's division lemma: for positive integers a and b there exist unique integers q and r with a = bq + r and:Read the answer and worked solution →In a = bq + r, the integers q and r are called the:Read the answer and worked solution →Euclid's division lemma was first recorded in which book of Euclid's Elements?Read the answer and worked solution →The word algorithm comes from the name of a 9th century mathematician from:Read the answer and worked solution →The HCF of 455 and 42, found by Euclid's algorithm, is:Read the answer and worked solution →Euclid's algorithm works because HCF(c, d) equals:Read the answer and worked solution →The HCF of 12576 and 4052 is:Read the answer and worked solution →A sweetseller has 420 kaju and 130 badam barfis and wants equal stacks using the least tray area. Each stack holds:Read the answer and worked solution →The Fundamental Theorem of Arithmetic says every composite number is a product of primes in a way that is:Read the answer and worked solution →The first correct proof of the Fundamental Theorem of Arithmetic was given by:Read the answer and worked solution →How many prime numbers are there?Read the answer and worked solution →Can 4 to the power n end in the digit zero for any natural number n?Read the answer and worked solution →HCF(6, 20) is 2 and LCM(6, 20) is:Read the answer and worked solution →HCF is the product of the smallest power of each common prime; LCM is the product of the:Read the answer and worked solution →For two positive integers a and b, HCF(a, b) x LCM(a, b) equals:Read the answer and worked solution →LCM(6, 72, 120) is:Read the answer and worked solution →A number that cannot be written as p/q with integers p and q (q not zero) is:Read the answer and worked solution →The proof that root 2 is irrational uses the technique of:Read the answer and worked solution →If p is a prime and p divides a squared, then p divides:Read the answer and worked solution →The sum of a rational and an irrational number is:Read the answer and worked solution →A rational number has a terminating decimal expansion only when its denominator's prime factors are:Read the answer and worked solution →Counting eggs that leave remainders 1, 2, 3, 4, 5 in pairs, threes, fours, fives, sixes and none in sevens, under 150, gives:Read the answer and worked solution →Catch the irrationalsRead the answer and worked solution →Pop the number wordsRead the answer and worked solution →Run the HCF and LCM numbersRead the answer and worked solution →Slice the number theory wordsRead the answer and worked solution →Rational or irrationalRead the answer and worked solution →Sort Euclid, factorisation and decimalsRead the answer and worked solution →Type the numberRead the answer and worked solution →Number system bingoRead the answer and worked solution →

Worked practice questions

Euclid's division lemma: for positive integers a and b there exist unique integers q and r with a = bq + r and:

  1. 0 <= r < b
  2. 0 < r <= b
  3. b <= r < a
  4. r >= a > b
Show answer and solution

Correct answer: A. 0 <= r < b

1. The remainder is smaller than the divisor. 2. It can be zero. 3. So 0 is at most r, and r is less than b. _Source: syllabus Mathematics, Chapter 1, Real Numbers._

Open this question →

In a = bq + r, the integers q and r are called the:

  1. Base and exponent
  2. Quotient and remainder
  3. Divisor and dividend
  4. Factor and multiple
Show answer and solution

Correct answer: B. Quotient and remainder

1. This is long division restated. 2. q is the quotient, r the remainder. 3. Both are unique. _Source: syllabus Mathematics, Chapter 1, Real Numbers._

Open this question →

Euclid's division lemma was first recorded in which book of Euclid's Elements?

  1. Book VII
  2. Book I
  3. Book IX
  4. Book XIII
Show answer and solution

Correct answer: A. Book VII

1. The result was known long before. 2. It appears in Book VII. 3. Euclid's algorithm is based on it. _Source: syllabus Mathematics, Chapter 1, Real Numbers._

Open this question →

How to practise

  1. Choose a Modern Mathematics question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Quantitative Aptitude topics

Quantitative AptitudeAlgebraNumber SystemTime Speed and DistanceTime and WorkRatio and ProportionSpeed DistanceSimple Interest