Skip to content

Elementary Mathematics 2020 (II)

Set A

Questions 1–20 of 100

1Arithmetic • Number System • Divisibility
EasyIdeal time: about 1 min

is exactly divisible by x, where x is a positive integer. The number of all such possible values of x is

Options
Show answer & solution

Option C

Approach

Split the expression into the part obviously divides and the part it must divide, then count the divisors of what is left.

Step-by-step solution

  1. 1

    Why: Pull out every term that already carries a factor of . What survives outside the bracket is the only thing that can obstruct the division.

  2. 2

    Why: Since divides exactly, the whole expression leaves the same remainder on division by as does. So the condition is simply that is a divisor of .

  3. 3
    , so its positive divisors are

    Why: A prime power has exactly the divisors - five of them.

  4. 4
    Number of possible values of is

    Why: Every positive divisor of works and nothing else does, so the count is exactly the number of divisors.

Shortcut

The whole question is ' divides ' in disguise: count the divisors of and stop.

Common mistakes

Option A

Listed only the proper divisors and dropped itself.

Option B

Counted the divisors of as , forgetting that divides everything.

Option D

No route reaches ; has five divisors, not six.

Skills used

2Arithmetic • Number System • Factors and Divisors
ModerateIdeal time: about 1.5 min

The number of , where a, b, c are positive integers such that , is

Options
Show answer & solution

Option B

Approach

Factorise into primes, note that no prime is repeated, and count how many ways the three primes can be handed out to , and .

Step-by-step solution

  1. 1

    Why: Three distinct primes, each to the first power. This is the fact that makes the count easy.

  2. 2
    Each of , , must go whole to exactly one of , ,

    Why: A prime appearing to the first power cannot be split between two factors, so for each prime there are exactly choices of where it lands.

  3. 3

    Why: The three choices are made independently, and two different assignments give two different triples , so no triple is counted twice and none is missed.

Common mistakes

Option A

Answered with itself rather than counting the triples.

Option C

Distributed only two of the three primes, giving .

Option D

Counted ordered pairs instead of triples: has divisors, so has solutions.

Skills used

3Algebra • Quadratic Equations • Roots
EasyIdeal time: about 1 min

If the roots of the quadratic equation are real, then what is the minimum value of N ?

Options
Show answer & solution

Option D

Approach

Impose the real-roots condition on the discriminant, then read the resulting inequality on back as an inequality on .

Step-by-step solution

  1. 1
    has

    Why: Identify the coefficients before touching the discriminant; the constant term carries a minus sign that is easy to lose.

  2. 2

    Why: Real roots means the discriminant is not negative. Here .

  3. 3

    Why: Divide by and transpose. The question has become: how small can be if its logarithm is at least ?

  4. 4

    Why: is increasing, so the inequality carries straight over to once each side is written as a power of . The least value is attained at equality.

Common mistakes

Option A

Took the condition as , forgetting that the discriminant allows to go negative.

Option B

Divided by to get instead of multiplying out the discriminant correctly.

Option C

Used the discriminant as with a sign slip, or halved to , giving .

Skills used

4Algebra • Equations • Linear Equations
ModerateIdeal time: about 1.5 min

The number of different solutions of the equation , where each of x, y and z is a positive integer, is

Options
Show answer & solution

Option C

Approach

Fix first; for each value of the remaining equation has an easily counted number of positive solutions, and those counts form a run of consecutive integers.

Step-by-step solution

  1. 1
    can be

    Why: All three are at least , so .

  2. 2
    For a fixed , with has

    Why: Once is chosen, is forced, so the number of solutions is the number of admissible . The largest is , which keeps .

  3. 3
    Total

    Why: Substituting gives the counts .

  4. 4

    Why: Sum of the first ten natural numbers.

Common mistakes

Option A

No clean route reaches .

Option B

Lost one case from the run, for instance stopping the sum at but starting the counts at .

Option D

Allowed as well, adding a phantom case where has no positive solution.

Skills used

5Algebra • Expressions • Algebraic Identities
ModerateIdeal time: about 1.5 min

If , where a and b are consecutive integers and , then I is

Options
Show answer & solution

Option D

square of an odd integer

Approach

Write the consecutive integers as and , set so that both and the sum of the two squares are expressions in , and recognise the result as a perfect square whose parity you can then settle.

Step-by-step solution

  1. 1

    Why: 'Consecutive integers' fixes in terms of ; naming puts everything in one variable.

  2. 2
    Put ; then and

    Why: Both pieces are built from the same quantity , so naming it turns a quartic in into a quadratic in .

  3. 3

    Why: is the square of a sum. So is always a perfect square - that settles two of the four options at once.

  4. 4
    is even, so is odd

    Why: Of two consecutive integers one is even, so their product is even and one more than it is odd. Hence is the square of an odd integer.

Shortcut

Test : , an odd square. Test : , an odd square. Only option D survives two cases.

Common mistakes

Option A

Added or similar and mis-read the parity, concluding is even without noticing it is a square.

Option B

Got the parity right but stopped before spotting that is a perfect square.

Option C

Saw the perfect square but took to be even, forgetting that is always even.

Skills used

6Arithmetic • Number System • Divisibility
ModerateIdeal time: about 1.5 min

If the number is divisible by the smallest odd composite number, then what is the value of P ?

Options
Show answer & solution

Option A

Approach

Identify the smallest odd composite number, then apply the divisibility test for it to the digit sum.

Step-by-step solution

  1. 1
    Odd numbers in order: (neither prime nor composite), (prime), (composite)

    Why: The smallest odd composite number is , not - is prime, and is neither prime nor composite.

  2. 2

    Why: Add every digit except . A number is divisible by exactly when its digit sum is, so the digit sum is all that matters.

  3. 3
    must be a multiple of

    Why: The full digit sum of is .

  4. 4
    is the only multiple of in range, so and

    Why: is a single digit, so lies between and ; the only multiple of there is . That also shows the answer is unique.

Common mistakes

Option B

Slipped one in the digit sum (got instead of ), which makes .

Option C

Slipped two in the digit sum (got ), which makes .

Option D

Took the smallest odd composite number to be ; then need only be a multiple of , and is one of the values that works.

Skills used

7Arithmetic • Number System • Divisibility
EasyIdeal time: about 1 min

What is the remainder when the sum is divided by ?

Options
Show answer & solution

Option B

Approach

Reduce each fifth power modulo rather than adding the five large numbers, then add the remainders.

Step-by-step solution

  1. 1
    ; ;

    Why: Any even number raised to a power at least is a multiple of , so the two even terms contribute nothing.

  2. 2

    Why: Powers of modulo cycle with period : , so an odd exponent leaves .

  3. 3

    Why: A base congruent to stays congruent to at every power.

  4. 4
    Sum

    Why: Remainders add, and the total is then reduced again to bring it below the divisor.

Shortcut

Only the odd terms matter modulo : .

Common mistakes

Option A

Assumed the sum is a multiple of ; it is odd, so it cannot be.

Option C

Mis-added the remainders, or left the total as and reduced it to instead of .

Option D

Replaced each by , giving ; that substitution is false modulo (for instance , not ).

Skills used

8Arithmetic • Number System • Unit Digit
EasyIdeal time: about 45 s

What is the digit in the unit place of ?

Options
Show answer & solution

Option C

Approach

List the cycle of unit digits of the powers of , then locate within that cycle.

Step-by-step solution

  1. 1
    : unit digits

    Why: The unit digit of a power depends only on the previous unit digit, so once a digit repeats the whole pattern repeats. Here the cycle length is .

  2. 2

    Why: Divide the exponent by the cycle length. The remainder says how far into a fresh cycle the exponent lands.

  3. 3
    Remainder the same unit digit as , which is

    Why: The remainder is counted from , so remainder means the third entry of the cycle, not the fourth. A remainder of would mean the last entry, .

Common mistakes

Option A

Read the remainder as and took the fourth entry of the cycle.

Option B

Counted the cycle from , shifting the position by one and landing on .

Option D

Took the remainder as and read off .

Skills used

9Arithmetic • Number System • LCM and HCF
EasyIdeal time: about 1.5 min

LCM of two numbers is times their HCF. The sum of the HCF and the LCM is . If one of these numbers is , then what is the other number ?

Options
Show answer & solution

Option A

Approach

Write the LCM as a multiple of the HCF so the stated sum gives the HCF, then recover the second number from HCF LCM product of the numbers.

Step-by-step solution

  1. 1
    Let be the HCF; then the LCM is

    Why: ' times their HCF' is the only relation between them, so one letter suffices.

  2. 2

    Why: The sum condition now reads as a single linear equation. .

  3. 3
    LCM

    Why: Both quantities are now known.

  4. 4

    Why: For two numbers, HCF LCM equals their product. The product is known and one factor is given.

  5. 5
    Other number

    Why: Divide. Cancelling a zero first keeps this in small numbers: .

Shortcut

, LCM , and then . A quick filter: the answer must be a multiple of the HCF , and only is.

Common mistakes

Option B

No route reaches ; it is not even a multiple of the HCF .

Option C

No route reaches ; it is not a multiple of the HCF .

Option D

No route reaches ; it is not a multiple of the HCF .

Skills used

10Algebra • Polynomial • Factor and Remainder Theorem
EasyIdeal time: about 45 s

is divisible by , where , for every

Options
Show answer & solution

Option A

natural number n

Approach

Factorise and read off the condition on , if any.

Step-by-step solution

  1. 1

    Why: The second bracket has terms, all with a plus sign, and is a polynomial for every positive integer . So is a factor whatever is.

  2. 2
    By the factor theorem: put in , giving

    Why: The same conclusion with no factorisation to write out: divides exactly when , and that holds for every natural .

  3. 3
    Hence for every natural number

    Why: No parity or primality condition appears anywhere in the argument.

Shortcut

Put : the expression vanishes, so by the factor theorem is a factor - with no condition on .

Common mistakes

Option B

Remembered only the difference of squares and assumed an even exponent is needed to factorise.

Option C

Confused this with the companion rule for sums, where divides only for odd .

Option D

No route reaches 'prime only'; already works.

Skills used

11Arithmetic • Number System • Divisibility
EasyIdeal time: about 45 s

If is divided by , then what is the remainder ?

Options
Show answer & solution

Option A

Approach

Replace by its remainder modulo , so the large power collapses to a sign.

Step-by-step solution

  1. 1
    , so

    Why: Working with instead of is the whole trick: a base of makes any power trivial.

  2. 2

    Why: is even, so the sign comes out positive.

  3. 3
    Remainder

    Why: lies between and , so it is a legitimate remainder and no further reduction is needed.

Common mistakes

Option B

No route reaches .

Option C

No route reaches ; it is the remainder of divided by , not by .

Option D

Treated the exponent as odd, so was taken as .

Skills used

12Algebra • Surds • Simplification
ModerateIdeal time: about 1.5 min

What is the value of ?

Options
Show answer & solution

Option C

Approach

Rationalise each term with its conjugate; every term becomes a difference of two consecutive square roots, and the sum telescopes.

Step-by-step solution

  1. 1

    Why: Multiplying above and below by the conjugate turns the denominator into a difference of squares, which clears the surds.

  2. 2

    Why: The denominator is exactly , so each term is simply the difference of the two roots in it.

  3. 3
    Sum

    Why: Writing the terms out shows every interior root appearing once with each sign.

  4. 4

    Why: Only the last root and the first survive the cancellation. The is the piece most often dropped.

Common mistakes

Option A

Took the surviving terms to be alone, keeping the first root instead of the last.

Option B

No route reaches .

Option D

Stopped at and forgot to subtract .

Skills used

13Algebra • Surds • Simplification
ModerateIdeal time: about 1.5 min

If , then what is the value of m ?

Options
Show answer & solution

Option A

Approach

Work the nested radical from the inside out, converting each root into a fractional index, then take the fourteenth root last.

Step-by-step solution

  1. 1
    , so

    Why: Start at the innermost radical. Adding indices is the only law needed when the bases match.

  2. 2

    Why: A square root is the index , and a power of a power multiplies the indices.

  3. 3

    Why: The outer inside the fourteenth root contributes an index of .

  4. 4

    Why: The fourteenth root is the index ; .

  5. 5

    Why: Equal powers of the same base force equal indices.

Common mistakes

Option B

Divided the index by instead of by .

Option C

Stopped at the inner radical and never applied the fourteenth root.

Option D

Found the index inside the fourteenth root, , and reported that.

Skills used

14Algebra • Expressions • Algebraic Identities
ModerateIdeal time: about 1.5 min

The sum of all possible products taken two at a time out of the numbers is

Options
Show answer & solution

Option C

Approach

Use the identity that links the square of a sum to the sum of squares and the sum of products two at a time; here the ten numbers add to zero, which makes the formula give the answer at once.

Step-by-step solution

  1. 1
    The ten numbers are , and their sum is

    Why: Each number pairs with its negative, so the total is zero. This is the fact the identity will exploit.

  2. 2

    Why: Squaring a sum produces every square once and every product two at a time twice - which is exactly the quantity asked for.

  3. 3

    Why: A number and its negative have the same square, so each square appears twice; .

  4. 4

    Why: Substitute the sum and the sum of squares , then solve for the pairwise sum.

Shortcut

Since the numbers add to zero, .

Common mistakes

Option A

Assumed the symmetric list makes the pairwise products cancel to zero; the sum cancels, but the sum of products does not.

Option B

No route reaches .

Option D

Dropped the sign, reporting instead of its negative.

Skills used

15Arithmetic • Time, Speed and Distance • Trains
EasyIdeal time: about 1 min

A train of length m is moving at a uniform speed of km/hr. The time required to cross a bridge of length m is

Options
Show answer & solution

Option C

seconds

Approach

The train must cover its own length plus the bridge; convert the speed to metres per second and divide.

Step-by-step solution

  1. 1
    Distance m

    Why: Crossing a bridge is complete when the rear of the train leaves it, so the train travels its own length in addition to the bridge's.

  2. 2
    km/hr m/s

    Why: The lengths are in metres, so the speed must be in metres per second; multiplying by does that.

  3. 3
    Time s

    Why: Time is distance over speed. Cancelling from and keeps the arithmetic small: .

Common mistakes

Option A

No route reaches s.

Option B

No route reaches s; rounding up to m/s would give , not .

Option D

No route reaches s.

Skills used

16Arithmetic • Interest • Simple Interest
EasyIdeal time: about 1 min

The simple interest on a certain sum is one-fourth of the sum. If the number of years and the rate of annual interest are numerically equal, then the number of years is

Options
Show answer & solution

Option D

Approach

Write the simple-interest formula with the rate and the time both equal to the same unknown, set the interest equal to a quarter of the principal, and the principal cancels.

Step-by-step solution

  1. 1
    Let the number of years be ; then the rate is also

    Why: 'Numerically equal' is the single condition that makes one unknown do for both.

  2. 2

    Why: Simple interest is , with .

  3. 3

    Why: The interest is given as one-fourth of the sum. The principal appears on both sides and cancels, so its value is never needed.

  4. 4

    Why: Multiply by and take the positive root; a number of years cannot be negative.

Common mistakes

Option A

Halved the correct root, or solved as .

Option B

No route reaches .

Option C

No route reaches .

Skills used

17Algebra • Equations • Linear Equations
EasyIdeal time: about 1 min

A 60-page book has n lines per page. If the number of lines were reduced by in each page, the number of pages would have to be increased by to give the same writing space. What is the value of n ?

Options
Show answer & solution

Option B

Approach

Writing space is pages times lines per page; equate that product before and after the change.

Step-by-step solution

  1. 1
    Original space lines

    Why: pages at lines each.

  2. 2
    New space

    Why: Three fewer lines per page, ten more pages. 'To give the same writing space' is what makes these two equal.

  3. 3

    Why: Set the two totals equal - this is the one stated relation.

  4. 4

    Why: Expand, collect the terms on one side, divide.

Common mistakes

Option A

Answered with the reduced line count instead of .

Option C

Added to the answer instead of subtracting, or solved .

Option D

No route reaches .

Skills used

18Arithmetic • Time and Work
ModerateIdeal time: about 1.5 min

If x men working x hours per day can do x units of work in x days, then y men working y hours per day in y days would be able to do k units of work. What is the value of k ?

Options
Show answer & solution

Option D

Approach

Work done is proportional to men hours per day days; find the constant from the first statement and apply it to the second.

Step-by-step solution

  1. 1
    Work

    Why: The three factors enter multiplicatively, which is the content of the work-equivalence rule written with a constant.

  2. 2

    Why: The first statement supplies all four quantities, so it determines .

  3. 3

    Why: Divide both sides by : .

  4. 4

    Why: The same constant governs the second workforce. A negative index is just a reciprocal, so .

Shortcut

Put in each option and keep only those that return : that alone leaves .

Common mistakes

Option A

Inverted both letters, giving .

Option B

Interchanged and throughout, giving - the answer to the mirror-image question.

Option C

Put the cube on and the square on , giving .

Skills used

19Arithmetic • Number System • Factors and Divisors
ModerateIdeal time: about 1.5 min

Let d(n) denote the number of positive divisors of a positive integer n. Which of the following are correct ?

1
2
3

Select the correct answer using the code given below :

Options
Show answer & solution

Option B

1 and 2 only

Approach

Count the divisors of each number from its prime factorisation, then test the three stated equalities one by one.

Step-by-step solution

  1. 1
    and are prime, so

    Why: A prime has exactly two divisors, and itself. Statement is therefore correct.

  2. 2

    Why: For the number of divisors is . Here the divisors are .

  3. 3

    Why: Statement is correct. This is the multiplicative property of for coprime arguments, and and share no prime.

  4. 4

    Why: The divisors are - five of them. The exponent is , so the count is , not .

  5. 5

    Why: Statement fails. So statements and hold and does not.

Common mistakes

Option A

Took , counting only the prime factors and as divisors, which kills statement ; also counted as and so kept statement .

Option C

Counted as by omitting the divisor , which makes statement look true, and rejected statement .

Option D

Counted by listing only and forgetting , so statement appeared to hold as well.

Skills used

20Arithmetic • Number System • Prime Numbers
ModerateIdeal time: about 1.5 min

If , where is the product of the first n prime numbers, then consider the following statements :

1
is always a composite number.
2
is always an odd number.
3
is always an even number.

Which of the above statements is/are correct ?

Options
Show answer & solution

Option D

2 and 3 only

Approach

Note that the product of the first primes always contains the factor , so is odd; that settles statements and at once, and a single small case disposes of statement .

Step-by-step solution

  1. 1
    always includes the prime , so is even

    Why: is the first prime, so it is a factor of for every . This one observation drives the whole question.

  2. 2
    is therefore odd

    Why: One more than an even number is odd.

  3. 3
    is odd even odd: statement is correct

    Why: Adding does not change parity.

  4. 4
    is odd odd even: statement is correct

    Why: One more than an odd number is even.

  5. 5
    : and , which is prime - statement fails

    Why: A single counterexample is enough to reject an 'always' claim. ( gives and gives , both prime as well; the first composite case is , where .)

Shortcut

is even because divides it, so is odd and statements and are immediate; is prime, so statement is out.

Common mistakes

Option A

Assumed Euclid's argument proves composite; it proves only that has a prime factor beyond the first , which may be itself.

Option B

Checked the parity of but not of , so statement was left out.

Option C

Checked the parity of but not of , so statement was left out.

Skills used