Question 32
How about checking divisibility by 24? Will checking the divisibility by its factors, 4 and 6, work? Why or why not?
To check if a number is divisible by 24, we can sometimes check its factors.
Step 1 — Testing factors 4 and 6
We want to check if a number is divisible by 24. This means the number must be a multiple of 24. We are asked if checking divisibility by 4 and 6 will work. Let us test this idea with an example. Consider the number 12.
Is 12 divisible by 4? Yes, 12 is divisible by 4.
Is 12 divisible by 6? Yes, 12 is divisible by 6.
So, 12 is divisible by both 4 and 6. Now, let us check if 12 is divisible by 24. This is not a whole number. So, 12 is not divisible by 24.
Step 2 — Why 4 and 6 do not work
The reason this method does not work is because 4 and 6 share a common factor. Both 4 and 6 are divisible by 2. When factors share a common factor greater than 1, this method fails. We need to use factors that are coprime. Coprime numbers are numbers that share no common factors other than 1. For example, 4 and 6 are not coprime because they both have 2 as a factor. If a number is divisible by 4, it is already divisible by 2. If it is also divisible by 6, it is again divisible by 2. We are essentially checking for divisibility by 4, and by 6, but not by 24. Instead, we are checking for divisibility by the least common multiple of 4 and 6, which is 12. Since 12 is not 24, this method does not work.
Step 3 — Correct factors for 24
To check divisibility by 24, we must use two factors that are coprime. Let us find two coprime factors of 24. We can choose 3 and 8. The factors of 3 are 1 and 3. The factors of 8 are 1, 2, 4, and 8. The only common factor of 3 and 8 is 1. So, 3 and 8 are coprime numbers. If a number is divisible by both 3 and 8, it will be divisible by . Let us test this with the number 72.
Is 72 divisible by 3? The sum of digits is . Since 9 is divisible by 3, 72 is divisible by 3.
Is 72 divisible by 8? Yes, 72 is divisible by 8.
Since 72 is divisible by both 3 and 8, it must be divisible by 24. This works correctly.
Answer
(i) No, checking the divisibility by 4 and 6 will not work. (ii) This is because 4 and 6 are not coprime; they share a common factor of 2. (iii) To check divisibility by 24, we must use two coprime factors, such as 3 and 8.
More questions in IT
Evaluate each expression and write the result next to it. Do you notice anything interesting?
Now, take four other consecutive numbers. Place the '+' and '-' signs as you have done before. Find out the results of each expression. What do you observe?
Repeat this for one more set of 4 consecutive numbers. Share your findings.
Do these patterns occur no matter which 4 consecutive numbers are chosen? Is there a way to find out through reasoning?
Hint: Use algebra and describe the 8 expressions in a general form.
Now take any 4 numbers, place '+' and '-' signs in the eight different ways, and evaluate the resulting expression. What do you observe about their parities?
Repeat this with other sets of 4 numbers.
Is there a way to explain why this happens?
Hint: Think of the rules for parity of the sum or difference of two numbers.
Context: Now, let us see what happens when a negative sign is switched to a positive sign.
Q. Replace any negative sign in the expression with a positive sign and find the difference between the two numbers.
Context: Replace any negative sign in the expression with a positive sign and find the difference between the two numbers.
Q. What do you conclude from this observation?
Is the phenomenon of all the expressions having the same parity limited to taking 4 numbers? What do you think?
Breaking Even
We know how to identify even numbers. Without computing them, find out which of the following arithmetic expressions are even.
Using our understanding of how parity behaves under different operations, identify which of the following algebraic expressions give an even number for any integer values for the letter-numbers.
Context: The algebraic expressions from the previous page are:
Q. Similarly, determine and explain which of the other expressions always give even numbers. Write a couple of examples and non-examples, as appropriate, for each expression.
Write a few algebraic expressions which always give an even number.
Pairs to Make Fours
Take a pair of even numbers. Add them. Is the sum divisible by 4?
Try this with different pairs of even numbers. When is the sum a multiple of 4, and when is it not? Is there a general rule or a pattern?
When will two even numbers add up to give a multiple of 4?
This problem is similar to the question of identifying when adding two numbers will result in an even number. Can you see this?
There are three cases to examine:
Look at the following expressions and the visualisation. Write the corresponding explanation and examples.
Always, Sometimes, or Never
We examine different statements about factors and multiples and determine whether a statement is 'Always True', 'Sometimes True', or 'Never True'.
We know that the sum of any two multiples of 2 is also a multiple of 2.
- If 8 exactly divides two numbers separately, it must exactly divide their sum.
Statement 1 is always true. Determine if it is true with subtraction.
Examine each of the following statements, and determine whether it is 'Always true', 'Sometimes true', 'Never true'.
-
If a number is divisible by both 9 and 4, it must be divisible by 36.
-
If a number is divisible by both 6 and 4, it must be divisible by 24.
Context: Let us consider another expression, , and see the values it takes for different values of .
Numbers that leave a remainder of when divided by can also be seen as less than multiples of ; , where .
Q. Are there other expressions that generate numbers that are more than a multiple of ?
Similarly, explain using algebra why the divisibility shortcuts for 5, 2, 4, and 8 work.
Look at each of the following statements. Which are correct and why?
(i) If a number is divisible by 9, then the sum of its digits is divisible by 9.
(ii) If the sum of the digits of a number is divisible by 9, then the number is divisible by 9.
(iii) If a number is not divisible by 9, then the sum of its digits is not divisible by 9.
(iv) If the sum of the digits of a number is not divisible by 9, then the number is not divisible by 9.
The shortcut to find the divisibility by 3 is similar to the method for 9. A number is divisible by 3 if the sum of its digits is divisible by 3. Explore the remainders when powers of 10 are divided by 3. Explain why this method works.
Using these observations, can you tell whether the number 462 is divisible by 11?
Context: This alternating pattern of one more than 11 and one less than 11 continues for higher place values. Since 400 contains 4 hundreds, 400 is 4 more than a multiple of 11 (). Since 60 contains 6 tens, 60 is 6 less than a multiple of 11 (). Since 2 contains 2 units, 2 is 2 more than a multiple of 11, i.e., . Using these observations, can you tell whether the number 462 is divisible by 11?
Q. What could be a general method or shortcut to check divisibility by 11?
If this difference is 11 or a multiple of 11, what does that say about the remainder obtained when the number is divisible by 11?
Using this shortcut, find out whether the following numbers are divisible by 11. Further, find the remainder if the number is not divisible by 11.
(i) 158 (ii) 841 (iii) 481 (iv) 5529 (v) 90904 (vi) 857076
Is this method similar to or different from the method we saw just before?
Fill in the following table. Find a quick way to do this?
More on Divisibility Shortcuts
Divisibility Shortcuts for Other Numbers
How can we find out if a number is divisible by 6?
Will checking its divisibility by its factors 2 and 3 work? Use the shortcuts for 2 and 3 on these numbers and divide each number by 6 to verify— 38, 225, 186, 64.
How about checking divisibility by 24? Will checking the divisibility by its factors, 4 and 6, work? Why or why not?
What property do you think this digital root will have? Recall that we did this while finding the divisibility shortcut for 9.
Between the numbers 600 and 700, which numbers have the digital root: (i) 5, (ii) 7, (iii) 3?
Write the digital roots of any 12 consecutive numbers. What do you observe?
Now, find the digital roots of some consecutive multiples of (i) 3, (ii) 4, and (iii) 6.
What are the digital roots of numbers that are 1 more than a multiple of 6? What do you notice?
Try to explain the patterns noticed.
I’m made of digits, each tiniest and odd, No shared ground with root #1—how odd!
My digits count, their sum, my root— All point to one bold number’s pursuit— The largest odd single-digit I proudly claim.
What’s my number? What’s my name?
Solve the cryptarithms given below:
Try this now: GH × H = 9K.
This means a 2-digit number multiplied by a 1-digit number gives another 2-digit number in the 90s. Observe the letters corresponding to the units digits in this cryptarithm. Pick the solution to this question from the options given below: 11 × 9 = 99, 12 × 8 = 96, 46 × 2 = 92, 24 × 4 = 96, 47 × 2 = 94, 31 × 3 = 93, 16 × 6 = 96.
Solve the following:
(i) UT × 3 = PUT
(ii) AB × 5 = BC
(iii) L2N × 2 = 2NP
(iv) XY × 4 = ZX
(v) PP × QQ = PRP
(vi) JK × 6 = KKK