Quick Divisibility Tests for 2, 3, 4, 5, 8, 9, 11

Instant tests to check if a number is divisible without actual division

સંબંધિત સૂત્રો

અન્ત્યયોરેવ

ફક્ત છેલ્લા પદો

ઝડપી તપાસ અને અમુક ગણતરીઓ માટે છેલ્લા અંકો પર ધ્યાન કેન્દ્રિત કરો

વિલોકનમ્

ફક્ત નિરીક્ષણ દ્વારા

પેટર્ન ઓળખ અને દૃશ્ય ગણતરી

સિદ્ધાંત

Instant Divisibility Checks

You can tell if a number is divisible by 2, 3, 4, 5, 8, 9, or 11 just by looking at its digits!

Divisible by 2

Rule: Last digit is even (0, 2, 4, 6, 8)

  • 348 → last digit 8 (even) → YES
  • 567 → last digit 7 (odd) → NO

Divisible by 3

Rule: Sum of digits is divisible by 3

  • 246 → 2+4+6 = 12 → 12÷3 = 4 → YES
  • 457 → 4+5+7 = 16 → 16÷3 has remainder → NO

Divisible by 4

Rule: Last TWO digits form a number divisible by 4

  • 1236 → last two: 36 → 36÷4 = 9 → YES
  • 3418 → last two: 18 → 18÷4 has remainder → NO
  • Quick check: if tens digit is even, ones must be 0, 4, or 8
  • If tens digit is odd, ones must be 2 or 6

Divisible by 5

Rule: Last digit is 0 or 5

  • 385 → last digit 5 → YES
  • 2470 → last digit 0 → YES
  • 892 → last digit 2 → NO

Divisible by 8

Rule: Last THREE digits form a number divisible by 8

  • 12416 → last three: 416 → 416÷8 = 52 → YES
  • 5123 → last three: 123 → not divisible by 8 → NO

Divisible by 9

Rule: Sum of digits is divisible by 9

  • 4563 → 4+5+6+3 = 18 → 18÷9 = 2 → YES
  • 1234 → 1+2+3+4 = 10 → not divisible by 9 → NO

Divisible by 11

Rule: Alternating sum of digits is 0 or divisible by 11

Start from right, alternately add and subtract:

  • 1331 → 1 - 3 + 3 - 1 = 0 → YES
  • 2728 → 8 - 2 + 7 - 2 = 11 → YES
  • 1234 → 4 - 3 + 2 - 1 = 2 → NO

Why These Work

Powers of 10 Pattern:

  • 10 ≡ 0 (mod 2, 5)
  • 100 ≡ 0 (mod 4)
  • 1000 ≡ 0 (mod 8)
  • 10 ≡ 1 (mod 3, 9) → digit sum works
  • 10 ≡ -1 (mod 11) → alternating sum works

Quick Reference Table

DivisorTest
2Last digit even
3Sum of digits ÷ 3
4Last 2 digits ÷ 4
5Last digit 0 or 5
6Divisible by both 2 AND 3
8Last 3 digits ÷ 8
9Sum of digits ÷ 9
10Last digit is 0
11Alternating digit sum

પગલાં

1

Identify which divisor you're testing

Testing divisibility by 3

2

Apply the appropriate rule for that divisor

For 3: add all the digits

3

Check if the result meets the criterion

Is the sum divisible by 3?

4

Conclude YES or NO

If yes → number is divisible by 3

ઉદાહરણો

Is 5,268 divisible by 4?

સરળ
1

For 4, check last 2 digits

Last 2 digits: 68

2

Is 68 divisible by 4?

68 ÷ 4 = 17

3

Conclusion

YES, 5,268 is divisible by 4

જવાબ: Yes

Is 8,372 divisible by 3?

સરળ
1

For 3, sum the digits

8 + 3 + 7 + 2 = 20

2

Is 20 divisible by 3?

20 ÷ 3 = 6 remainder 2

3

Conclusion

NO, 8,372 is not divisible by 3

જવાબ: No

Is 7,326 divisible by 9?

મધ્યમ
1

For 9, sum the digits

7 + 3 + 2 + 6 = 18

2

Is 18 divisible by 9?

18 ÷ 9 = 2 ✓

3

Conclusion

YES, 7,326 is divisible by 9

4

Verify

7,326 ÷ 9 = 814

જવાબ: Yes

Is 2,937 divisible by 11?

મુશ્કેલ
1

For 11, use alternating sum (right to left)

7 - 3 + 9 - 2 = 11

2

Is result 0 or multiple of 11?

11 is a multiple of 11 ✓

3

Conclusion

YES, 2,937 is divisible by 11

4

Verify

2,937 ÷ 11 = 267

જવાબ: Yes

પ્રેક્ટિસ માટે તૈયાર છો?

ઇન્ટરેક્ટિવ પ્રેક્ટિસ સમસ્યાઓ સાથે તમે જે શીખ્યા છો તે લાગુ કરો

પ્રેક્ટિસ શરૂ કરો