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
A number is divisible by 2 if its last digit is 0, 2, 4, 6, or 8
The last digit of 84 is 4
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
84 ÷ 2 = 42 with no remainder
Yes, 84 is divisible by 2 because its last digit (4) is even.
• Divisibility rule for 2: Check the last digit
• Even numbers: End in 0, 2, 4, 6, or 8
• Verification: Perform the division to confirm
Divisible by 5: A number is divisible by 5 if it can be divided by 5 with no remainder
The last digit of 135 is 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
135 ÷ 5 = 27 with no remainder
Yes, 135 is divisible by 5 because its last digit (5) is 5.
• Divisibility rule for 5: Check the last digit
• Divisible by 5: Ends in 0 or 5
• Verification: Perform the division to confirm
Divisible by 10: A number is divisible by 10 if it can be divided by 10 with no remainder
The last digit of 240 is 0
A number is divisible by 10 if its last digit is 0
Since 240 ends in 0, it is divisible by 10
240 ÷ 10 = 24 with no remainder
Yes, 240 is divisible by 10 because its last digit is 0.
• Divisibility rule for 10: Check the last digit
• Divisible by 10: Must end in 0
• Verification: Perform the division to confirm
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
- Identify the divisor: Determine which divisibility rule to apply
- Examine the dividend: Look at the digits of the number
- Apply the rule: Use the specific test for that divisor
- Verify: Perform the division to confirm your result
• 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 3: A number is divisible by 3 if the sum of its digits is divisible by 3
1 + 4 + 7 = 12
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
147 ÷ 3 = 49 with no remainder
Yes, 147 is divisible by 3 because the sum of its digits (1 + 4 + 7 = 12) is divisible by 3.
• 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
Multiple divisibility: Checking divisibility by several numbers
Last digit of 120 is 0 (even)
So 120 is divisible by 2
Sum of digits: 1 + 2 + 0 = 3
3 is divisible by 3, so 120 is divisible by 3
Last two digits: 20
20 ÷ 4 = 5 (no remainder), so 120 is divisible by 4
Last digit is 0
So 120 is divisible by 5
120 is divisible by 2 AND 3
So 120 is divisible by 6
Sum of digits: 1 + 2 + 0 = 3
3 is not divisible by 9, so 120 is not divisible by 9
Last digit is 0
So 120 is divisible by 10
120 is NOT divisible by: 9
120 is divisible by: 2, 3, 4, 5, 6, and 10
120 is NOT divisible by: 9
• Systematic approach: Apply each divisibility rule separately
• Compound rules: Divisibility by 6 requires divisibility by both 2 and 3
• Verification: Check each rule methodically
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
- Prime factorization: Break down numbers into prime factors
- Modular arithmetic: Work with remainders
- Factor trees: Visual decomposition of numbers
- Euclidean algorithm: Find GCD efficiently
• 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
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
Modular arithmetic: Work with remainders
Factor trees: Visualize prime factorization
Congruence relations: Mathematical foundation for divisibility