0
$\begingroup$

Divisibility rule for 22: Under what conditions a natural number $N$ is divisible by $22$ ?

My thought is

The divisibility rule for $22$ is that the number is divisible by $2$ and by $11$. Divisibility by $2$ requires that the number ends in $0$, $2$, $4$, $6$ or $8$. Divisibility by $11$ requires that the difference between the sum of the the digits in odd positions and the sum of all the digits in even positions is $0$ or divisible by $11$.

how can i prove that ?

my attempt:

Indeed,

$2 \mid N$ then $N = 2.k$ , and $11\mid N\ $ i.e. $11 \mid 2.k$

or $\textrm{gcd}(2,11) = 1$ then by Lemma gauss $11\mid k$, i.e. $k=11p$ where $N = 2k = 2.11. p = 22p$

Thus

$22\mid N$

Is my reasonable right ?

$\endgroup$
  • 1
    $\begingroup$ is $b=1$? I asked that because you have $N=a_{n}a_{n-1}\cdots a_{2}a_{1}a_{0}$ and $N=a_{n}b^{n}+a_{n-1}ba^{n-1}+\cdots +a_{2}b^{2}+a_{1}b+a_{0}$ $\endgroup$ – Jlamprong Sep 3 '14 at 7:29
  • 1
    $\begingroup$ @labbhattacharjee Thanks but i'm not newbie in math.stackexchange.com i know how i search in it to find related subject $\endgroup$ – Educ Sep 3 '14 at 8:07
  • 1
    $\begingroup$ The rule for divisibility by 22 is, you divide by 22. If the remainder is zero, the number is divisible by 22; if not, then not. $\endgroup$ – Gerry Myerson Sep 3 '14 at 12:55
  • 1
    $\begingroup$ Simpler: $\,11k\,$ even $\,\Rightarrow\,k\,$ even, so $\,2,11\mid n\,\Rightarrow\,2\cdot 11\mid n.\ $ Generally $$\,a,b\mid c\iff {\rm lcm}(a,b)\mid c\,$$ the universal property/definition of $\,\rm lcm$. $\endgroup$ – Bill Dubuque Sep 3 '14 at 14:27
  • 1
    $\begingroup$ @Educ $\ $ Generally $\ \gcd(a,b) = 1\,\Rightarrow\,{\rm lcm}(a,b) = ab.\ $ In fact $\ \gcd(a,b)\,{\rm lcm}(a,b) = ab.\ \ $ $\endgroup$ – Bill Dubuque Sep 3 '14 at 15:01
1
$\begingroup$

Yes, that's correct. After applying the divisibility tests for $\,2,11\,$ we know that $\,2,11\mid n,\,$ so it follows that $\,2\cdot 11\mid n,\,$ by Euclid's lemma, or uniqueness of prime factorizations, etc. But one can deduce this much more simply by parity. Namely $\,11\mid n\,\Rightarrow\, n = 11k.\,$ Since further $\,n = 11k\,$ is even, we deduce by parity arithmetic that $\,k\,$ is even $\, k = 2j,\,$ so $\,n = 11k = 11(2j),\ $ thus $\,2\cdot 11\mid n.$

Generally: $\,\ a,b\mid n\iff {\rm lcm}(a,b)\mid n,\ $ the universal property/definition of $\,\rm lcm.$

And $\ \gcd(a,b) = 1\iff {\rm lcm}(a,b) = ab,\ $ which is a special case of $\ \gcd(a,b)\,{\rm lcm}(a,b) = ab.$

$\endgroup$
0
$\begingroup$

The divisibility rule for 22 is that the number is divisible by 2 and by 11. Divisibility by 2 requires that the number ends in 0, 2, 4, 6 or 8. Divisibility by 11 requires that the difference between the sum of the the digits in odd positions and the sum of all the digits in even positions is 0 or divisible by 11.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.