SSAT Upper Level Quantitative Flashcards: Divisibility Rules

Study Divisibility Rules in SSAT Upper Level Quantitative with focused flashcards that help you recognize the idea, recall the key rule, and apply it in practice-style prompts.

SSAT Upper Level Quantitative

Divisibility Rules

0 mastered0 still learning

0% Complete

QUESTION
1/ 20

Identify whether 13,53013,530 is divisible by 1010.

Tap card or press Space to flip

ANSWER

Yes, because the last digit is 00. The rule for 10 is met as the number ends in 0, confirming divisibility.

How well did you know it?

Card 1 / 20

What this deck covers

This deck focuses on Divisibility Rules, giving you a quick way to review the definitions, rules, and examples that matter most for SSAT Upper Level Quantitative.

How to use these flashcards

Work through these flashcards in short sessions. Try to answer each prompt before flipping the card, then revisit any cards you miss until the explanation feels automatic.

All flashcards

Flashcard 1: Identify whether 13,53013,530 is divisible by 1010.

Answer: Yes, because the last digit is 00. The rule for 10 is met as the number ends in 0, confirming divisibility.

Flashcard 2: State the divisibility rule for 55.

Answer: Divisible by 55 iff the last digit is 00 or 55. Since 100(mod5)10 \equiv 0 \pmod{5}, the number is divisible by 5 precisely when its units digit is 0 or 5.

Flashcard 3: Identify whether 106110^6-1 is divisible by 99.

Answer: Yes, 1061=99999910^6-1=999999 and 9+9+9+9+9+9=549+9+9+9+9+9=54 is divisible by 99. The sum of digits 54 is divisible by 9 (54÷9=654 \div 9 = 6), confirming divisibility.

Flashcard 4: Identify whether 4,5724,572 is divisible by 33.

Answer: Yes, because 4+5+7+2=184+5+7+2=18 and 1818 is divisible by 33. The sum 18 is divisible by 3 since 18÷3=618 \div 3 = 6, applying the rule for 3.

Flashcard 5: Identify whether 5,3765,376 is divisible by 88.

Answer: Yes, because the last three digits 376376 are divisible by 88. Applying the rule for 8, 376 divided by 8 equals 47, an integer, confirming divisibility.

Flashcard 6: Identify whether 93,61593,615 is divisible by 55.

Answer: Yes, because the last digit is 55. The rule for 5 is satisfied as the number ends in 5, making it divisible by 5.

Flashcard 7: Identify whether 73,20573,205 is divisible by 22.

Answer: No, because the last digit 55 is odd. The units digit 5 is odd, so the number is not even and thus not divisible by 2.

Flashcard 8: State the divisibility rule for 88.

Answer: Divisible by 88 iff the last three digits form a multiple of 88. Since 10000(mod8)1000 \equiv 0 \pmod{8}, divisibility by 8 is determined by the last three digits being a multiple of 8.

Flashcard 9: What is the remainder when 10710^7 is divided by 99?

Answer: 11. Since 101(mod9)10 \equiv 1 \pmod{9}, 1071(mod9)10^7 \equiv 1 \pmod{9}, yielding remainder 1.

Flashcard 10: State the divisibility rule for 44.

Answer: Divisible by 44 iff the last two digits form a multiple of 44. Since 1000(mod4)100 \equiv 0 \pmod{4}, divisibility by 4 depends only on the last two digits forming a multiple of 4.

Flashcard 11: State the divisibility rule for 1111 using alternating digit sums.

Answer: Divisible by 1111 iff the alternating sum of digits is a multiple of 1111. Since 101(mod11)10 \equiv -1 \pmod{11}, the alternating sum of digits determines congruence modulo 11.

Flashcard 12: Identify whether 104+102+110^4+10^2+1 is divisible by 33.

Answer: Yes, 104+102+1=1010110^4+10^2+1=10101 and 1+0+1+0+1=31+0+1+0+1=3. The sum of digits is 3, which is divisible by 3 (3÷3=13 \div 3 = 1), confirming divisibility.

Flashcard 13: State the divisibility rule for 22.

Answer: Divisible by 22 iff the last digit is even (0,2,4,6,80,2,4,6,8). A number is divisible by 2 if it is even, which is determined solely by the parity of its units digit.

Flashcard 14: State the divisibility rule for 99.

Answer: Divisible by 99 iff the sum of digits is divisible by 99. Since 101(mod9)10 \equiv 1 \pmod{9}, a number is congruent to the sum of its digits modulo 9.

Flashcard 15: Identify whether 105+10310^5+10^3 is divisible by 1010.

Answer: Yes, 105+103=10100010^5+10^3=101000 ends in 00. The expression simplifies to 101000, which ends in 0, satisfying the rule for 10.

Flashcard 16: Identify whether 2,4182,418 is divisible by 66.

Answer: Yes, it is divisible by 22 and 33. It satisfies the rules for both 2 (even) and 3 (sum 15 divisible by 3), hence divisible by 6.

Flashcard 17: State the divisibility rule for 33.

Answer: Divisible by 33 iff the sum of digits is divisible by 33. Since 101(mod3)10 \equiv 1 \pmod{3}, a number is congruent to the sum of its digits modulo 3.

Flashcard 18: Identify whether 47,19047,190 is divisible by 99.

Answer: No, because 4+7+1+9+0=214+7+1+9+0=21 and 2121 is not divisible by 99. The sum 21 is not divisible by 9 (between 18 and 27), so the number is not divisible by 9.

Flashcard 19: Identify whether 7,1287,128 is divisible by 44.

Answer: Yes, because the last two digits 2828 are divisible by 44. Applying the rule for 4, 28 divided by 4 equals 7, an integer, confirming divisibility.

Flashcard 20: What is the remainder when 105+710^5+7 is divided by 33?

Answer: 22. Since 101(mod3)10 \equiv 1 \pmod{3}, 105+71+7=82(mod3)10^5 +7 \equiv 1+7=8 \equiv 2 \pmod{3}.