Mods and LCM

-

 Find the smallest number that gives a remainder of 1 when divided by 5, 6 or 7.

Comments

  1. Anonymous8 December 2020 at 11:50

    Well, if it has remainder of 1 when divided by 5, it will either end in 1 or 6 but multiples of 6 are always even so a remainder of 1 would make it odd. Now, we can check each number ending in a 1.

    1 ⨉
    11 ⨉
    21 ⨉
    31 ⨉
    41 ⨉
    51 ⨉
    61 ⨉
    71 CORRECT

    Now we have an answer, 71.

    ReplyDelete

Post a Comment

Popular posts from this blog

A box of biscuits

-
A box of biscuits contains 36 biscuits. 20 biscuits have foil wrappers. 15 are chocolate biscuits with foil wrappers. If 9 are not chocolate and do not have a foil wrapper, then how many chocolate biscuits are there?
Read More »

The Secret of the Locked Chest

-
A chest is locked with a 5-digit code. The clues to the code are as follows: The first digit is a prime number. The second digit is twice the first. The third digit is the smallest odd number. The fourth digit is the difference between the third and first digit. The last digit is the sum of the first and fourth digit. What is the code to unlock the chest?
Read More »

Word Problem

-
A bridge is built across a river. One quarter of the bridge is over the left bank of the river and one third of the bridge is over the right bank. The river is 120 m wide. How long is the bridge?
Read More »