Solved Exercises on Divisibility Rules Introduction in Grade 4

Master divisibility rules introduction: understanding divisibility, applying basic divisibility rules, and using them to identify factors through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Divisibility by 2
Exercise 1
Is 84 divisible by 2? Explain your reasoning using the divisibility rule for 2.
Definition:

Divisible by 2: A number is divisible by 2 if it can be divided by 2 with no remainder

Even number: A number that is divisible by 2

Divisibility rule for 2:

A number is divisible by 2 if its last digit is 0, 2, 4, 6, or 8

Number to check
84
Last digit
4
Conclusion
Yes
Step 1: Identify the last digit

The last digit of 84 is 4

Step 2: Apply the divisibility rule for 2

A number is divisible by 2 if its last digit is 0, 2, 4, 6, or 8

Since 4 is one of these digits, 84 is divisible by 2

Step 3: Verify with division

84 ÷ 2 = 42 with no remainder

84
Last digit is 4
✓ Divisible by 2
84
÷
2
=
42
84 is divisible by 2
Final answer:

Yes, 84 is divisible by 2 because its last digit (4) is even.

Applied rules:

• Divisibility rule for 2: Check the last digit

• Even numbers: End in 0, 2, 4, 6, or 8

• Verification: Perform the division to confirm

2 Divisibility by 5
Exercise 2
Is 135 divisible by 5? Explain your reasoning using the divisibility rule for 5.
Definition:

Divisible by 5: A number is divisible by 5 if it can be divided by 5 with no remainder

Number to check
135
Last digit
5
Conclusion
Yes
Step 1: Identify the last digit

The last digit of 135 is 5

Step 2: Apply the divisibility rule for 5

A number is divisible by 5 if its last digit is 0 or 5

Since 5 is one of these digits, 135 is divisible by 5

Step 3: Verify with division

135 ÷ 5 = 27 with no remainder

135
Last digit is 5
✓ Divisible by 5
135
÷
5
=
27
135 is divisible by 5
Final answer:

Yes, 135 is divisible by 5 because its last digit (5) is 5.

Applied rules:

• Divisibility rule for 5: Check the last digit

• Divisible by 5: Ends in 0 or 5

• Verification: Perform the division to confirm

3 Divisibility by 10
Exercise 3
Is 240 divisible by 10? Explain your reasoning using the divisibility rule for 10.
Definition:

Divisible by 10: A number is divisible by 10 if it can be divided by 10 with no remainder

Number to check
240
Last digit
0
Conclusion
Yes
Step 1: Identify the last digit

The last digit of 240 is 0

Step 2: Apply the divisibility rule for 10

A number is divisible by 10 if its last digit is 0

Since 240 ends in 0, it is divisible by 10

Step 3: Verify with division

240 ÷ 10 = 24 with no remainder

240
Last digit is 0
✓ Divisible by 10
240
÷
10
=
24
240 is divisible by 10
Final answer:

Yes, 240 is divisible by 10 because its last digit is 0.

Applied rules:

• Divisibility rule for 10: Check the last digit

• Divisible by 10: Must end in 0

• Verification: Perform the division to confirm

Divisibility Rules Fundamentals
\(\text{If } a \div b = c \text{ with remainder 0, then } a \text{ is divisible by } b\)
Divisibility Definition
Key definitions:

Divisibility: When one number can be divided by another with no remainder

Divisor: The number that divides another number

Dividend: The number being divided

Quotient: The result of division

Remainder: What's left over after division

Factor: A number that divides another number evenly

Multiple: The result of multiplying a number by an integer

Divisibility rule: A shortcut to determine if a number is divisible by another

Divisibility rule application:
  1. Identify the divisor: Determine which divisibility rule to apply
  2. Examine the dividend: Look at the digits of the number
  3. Apply the rule: Use the specific test for that divisor
  4. Verify: Perform the division to confirm your result
Tip 1: Always check the last digit first for divisibility by 2, 5, or 10.
Tip 2: For divisibility by 3, add up all the digits and check if the sum is divisible by 3.
Tip 3: For divisibility by 9, add all digits and check if the sum is divisible by 9.
Tip 4: For divisibility by 6, check if it's divisible by both 2 and 3.
Common errors: Confusing divisibility rules, not checking all conditions for compound rules.
Key insight: Divisibility rules are shortcuts that save time compared to long division.
Basic divisibility rules:

• Divisible by 2: Last digit is 0, 2, 4, 6, or 8

• Divisible by 3: Sum of digits is divisible by 3

• Divisible by 4: Last two digits form a number divisible by 4

• Divisible by 5: Last digit is 0 or 5

• Divisible by 6: Divisible by both 2 and 3

• Divisible by 9: Sum of digits is divisible by 9

• Divisible by 10: Last digit is 0

Basic Divisibility Rules

Divisible by 2
Last digit: 0, 2, 4, 6, 8
Example: 24 (ends in 4)
Divisible by 5
Last digit: 0 or 5
Example: 35 (ends in 5)
Divisible by 10
Last digit: 0
Example: 70 (ends in 0)
Solution: Exercises 4 to 5
4 Divisibility by 3
Exercise 4
Is 147 divisible by 3? Explain your reasoning using the divisibility rule for 3.
Definition:

Divisible by 3: A number is divisible by 3 if the sum of its digits is divisible by 3

Number to check
147
Sum of digits
1 + 4 + 7 = 12
Is 12 divisible by 3?
Yes (12 ÷ 3 = 4)
Step 1: Add all the digits

1 + 4 + 7 = 12

Step 2: Apply the divisibility rule for 3

A number is divisible by 3 if the sum of its digits is divisible by 3

Since 12 is divisible by 3, 147 is divisible by 3

Step 3: Verify with division

147 ÷ 3 = 49 with no remainder

147
Sum of digits: 1+4+7=12
✓ 12÷3=4, so yes
147
÷
3
=
49
147 is divisible by 3
Final answer:

Yes, 147 is divisible by 3 because the sum of its digits (1 + 4 + 7 = 12) is divisible by 3.

Applied rules:

• Divisibility rule for 3: Sum the digits

• Check divisibility: If sum is divisible by 3, so is the number

• Verification: Perform the division to confirm

5 Multiple divisibility checks
Exercise 5
For the number 120, determine which of these numbers it is divisible by: 2, 3, 4, 5, 6, 9, 10. Explain your reasoning for each.
Definition:

Multiple divisibility: Checking divisibility by several numbers

Number to check
120
Divisible by
2, 3, 4, 5, 6, 10 (not 9)
Step 1: Check divisibility by 2

Last digit of 120 is 0 (even)

So 120 is divisible by 2

Step 2: Check divisibility by 3

Sum of digits: 1 + 2 + 0 = 3

3 is divisible by 3, so 120 is divisible by 3

Step 3: Check divisibility by 4

Last two digits: 20

20 ÷ 4 = 5 (no remainder), so 120 is divisible by 4

Step 4: Check divisibility by 5

Last digit is 0

So 120 is divisible by 5

Step 5: Check divisibility by 6

120 is divisible by 2 AND 3

So 120 is divisible by 6

Step 6: Check divisibility by 9

Sum of digits: 1 + 2 + 0 = 3

3 is not divisible by 9, so 120 is not divisible by 9

Step 7: Check divisibility by 10

Last digit is 0

So 120 is divisible by 10

Divisible by 2: ✓
Ends in 0
Divisible by 3: ✓
Sum: 1+2+0=3
Divisible by 4: ✓
Last two: 20
Divisible by 5: ✓
Ends in 0
Divisible by 6: ✓
By 2 and 3
Not by 9: ✗
Sum 3≠divisible by 9
Divisible by 10: ✓
Ends in 0
120 is divisible by: 2, 3, 4, 5, 6, 10
120 is NOT divisible by: 9
Final answer:

120 is divisible by: 2, 3, 4, 5, 6, and 10

120 is NOT divisible by: 9

Applied rules:

• Systematic approach: Apply each divisibility rule separately

• Compound rules: Divisibility by 6 requires divisibility by both 2 and 3

• Verification: Check each rule methodically

Advanced Divisibility Concepts
\(\text{If } a \mid b \text{, then } b = a \times q \text{ for some integer } q\)
Divisibility Notation
Key definitions:

Divisibility notation: a | b means "a divides b" or "a is a divisor of b"

Proper divisor: A divisor other than the number itself

Prime number: A number with exactly two divisors: 1 and itself

Composite number: A number with more than two divisors

Factor tree: A visual representation of prime factorization

Greatest Common Divisor (GCD): The largest number that divides two or more numbers

Least Common Multiple (LCM): The smallest number divisible by two or more numbers

Congruence: Two numbers are congruent modulo n if they have the same remainder when divided by n

Advanced divisibility methods:
  1. Prime factorization: Break down numbers into prime factors
  2. Modular arithmetic: Work with remainders
  3. Factor trees: Visual decomposition of numbers
  4. Euclidean algorithm: Find GCD efficiently
Tip 1: For divisibility by 12, check divisibility by both 3 and 4.
Tip 2: For divisibility by 15, check divisibility by both 3 and 5.
Tip 3: The sum of digits technique works for divisibility by 9.
Tip 4: For divisibility by 8, check if the last three digits form a number divisible by 8.
Interesting fact: The sum of digits rule works because 10 ≡ 1 (mod 3 and 9).
Mathematical connection: Divisibility rules are based on modular arithmetic.
Advanced divisibility rules:

• Divisible by 7: Double the last digit, subtract from the rest of the number; repeat if necessary

• Divisible by 8: Last three digits form a number divisible by 8

• Divisible by 11: Alternating sum of digits is divisible by 11

• Divisible by 12: Divisible by both 3 and 4

• Divisible by 15: Divisible by both 3 and 5

• General rule: A number is divisible by n if it's divisible by all prime factors of n

Divisibility Rule Connections

Compound Rules

Divisible by 6: Must be divisible by 2 AND 3

Divisible by 12: Must be divisible by 3 AND 4

Divisible by 15: Must be divisible by 3 AND 5

Divisible by 18: Must be divisible by 2 AND 9

Advanced Techniques

Modular arithmetic: Work with remainders

Factor trees: Visualize prime factorization

Congruence relations: Mathematical foundation for divisibility

Questions & Answers

Question: Why do divisibility rules work? Why does checking the last digit work for 2, 5, and 10?

Answer: Divisibility rules work because of how our number system is structured (base 10).

For 2, 5, and 10: These numbers are all factors of 10 (our base). When we write a number like 247, we're really writing:

247 = 2×100 + 4×10 + 7×1 = 2×(10×10) + 4×10 + 7

Since 100 and 10 are both divisible by 2, 5, and 10, only the last digit matters for divisibility by these numbers:

  • For 2: Since 10 is divisible by 2, only the ones digit determines divisibility
  • For 5: Since 10 is divisible by 5, only the ones digit determines divisibility
  • For 10: Since 10 is divisible by 10, only the ones digit determines divisibility

For 3 and 9, it works because 10 ≡ 1 (mod 3) and 10 ≡ 1 (mod 9), so each place value contributes its digit value to the total remainder.

Question: My child is having trouble remembering all the divisibility rules. What's the best way to practice them?

Answer: Here are effective practice strategies:

  • Start with the basics: Master rules for 2, 5, and 10 first since they're the easiest
  • Create a reference sheet: Write down all rules with examples for easy review
  • Use games: Play divisibility games or use apps that make practice fun
  • Practice with real numbers: Use prices, ages, or house numbers for practice
  • Connect to multiplication: Link divisibility to multiplication facts

Focus on understanding why the rules work, not just memorizing them. For example, for divisibility by 3, practice adding digits repeatedly until it becomes automatic.

Short, frequent practice sessions (5-10 minutes daily) are more effective than long sessions.

Question: How do divisibility rules connect to other mathematical concepts students will encounter?

Answer: Divisibility rules are foundational to many advanced concepts:

  • Prime factorization: Understanding divisibility helps break numbers into prime factors
  • Greatest Common Factor (GCF) and Least Common Multiple (LCM): Essential for fraction operations
  • Fractions: Simplifying fractions requires finding common factors
  • Algebra: Factoring polynomials uses similar principles
  • Number theory: Modular arithmetic and congruences
  • Cryptography: Large prime numbers and divisibility are crucial for encryption

Divisibility also connects to concepts like even/odd numbers, multiples, and factors. Understanding these rules helps students develop number sense and mathematical reasoning skills that will benefit them throughout their mathematical education.

In higher mathematics, divisibility concepts extend to abstract algebra, where similar ideas apply to polynomials and other mathematical structures.