Divisibility Rules - SSAT Middle Level Quantitative
- State the divisibility rule for .
- A number is divisible by if its last digit is even (). This rule works because 10 is divisible by 2, making the entire number's divisibility depend solely on the last digit's evenness.
- Identify whether is divisible by .
- No, is not divisible by . Sum of digits: 7+4+2=13, not divisible by 3, so 742 is not divisible by 3.
- State the divisibility rule for .
- Divisible by if the last three digits form a multiple of . Since , divisibility by 8 relies on the last three digits being a multiple of 8.
- Identify whether is divisible by .
- Yes, is divisible by . Last two digits 28 ÷ 4 = 7, an integer, so yes.
- Identify whether is divisible by .
- Yes, is divisible by . Alternating sum 4-1+8-0=11, divisible by 11, so yes.
- Identify whether is divisible by .
- Yes, is divisible by . Digit sum 9+1+8+7+2=27, 27 ÷ 3=9, so yes.
- State the divisibility rule for .
- Divisible by if the last digit is . Multiples of 10 end in 0 because 10 = 2 × 5, combining rules for 2 and 5.
- State the divisibility rule for .
- Divisible by if the sum of its digits is divisible by . This stems from , so the number is congruent to the sum of its digits modulo 3.
- Identify whether is divisible by .
- Yes, is divisible by . Ends with 0, meeting the rule for divisibility by 10.
- Identify whether is divisible by .
- Yes, is divisible by . Last three digits 736 ÷ 8 = 92, an integer, confirming yes.
- Identify whether is divisible by .
- Yes, is divisible by . The last digit of 742 is 2, which is even, confirming divisibility by 2.
- Identify whether is divisible by .
- Yes, is divisible by . Digit sum 9 divisible by 3, last two 32 ÷ 4 = 8, so yes for 12.
- Identify whether is divisible by .
- Yes, is divisible by . Last two digits 16 form 16 ÷ 4 = 4, an integer, so yes.
- Identify whether is divisible by .
- Yes, is divisible by . Ends with 5, satisfying the rule for divisibility by 5.
- State the divisibility rule for .
- Divisible by if it is divisible by both and . Since 12 = 3 × 4 and 3 and 4 are coprime, both divisibility conditions must be met.
- State the divisibility rule for .
- Divisible by if the sum of its digits is divisible by . This follows from , making the number congruent to its digit sum modulo 9.
- State the divisibility rule for .
- Divisible by if the alternating digit sum is a multiple of (including ). Based on , leading to the alternating sum being congruent to the number modulo 11.
- State the divisibility rule for .
- Divisible by if the last digit is or . This is because multiples of 5 in base 10 end in 0 or 5 to be divisible by 5.
- Identify whether is divisible by .
- No, is not divisible by . Even but digit sum 10 not divisible by 3, so not by 6.
- State the divisibility rule for .
- Divisible by if the last two digits form a multiple of . Since , divisibility by 4 depends only on the last two digits forming a multiple of 4.
- Identify whether is divisible by .
- Yes, is divisible by . Digit sum 27, 27 ÷ 9=3, so yes.
- Identify whether is divisible by .
- Yes, is divisible by . Last three digits 128 ÷ 8 = 16, an integer, so yes.
- State the divisibility rule for .
- Divisible by if it is divisible by both and . As 6 = 2 × 3 and 2 and 3 are coprime, the number must satisfy both divisibility rules.