Let n=am10m++am−110m−1+⋯+a2102+a110+a0 where ak are integers and 0≤ak≤9,k=0,1,…,m be the decimal representation of a positive integer n.
Let S=a0+a1+⋯+am,T=a0−a1+⋯+(−1)mam. Then
1.n is divisible by 2 iff a_0 is divisible by 2.
2. n is divisible by 11 iff T is divisible by 11.
3. n is divisible by 3 iff S is divisible by 3.
I know the proof of these results. I shall prove first one and the proof of rest two are similar.
Now my question : Is there any similar rule which will tell us whether an integer
n is divisible by the primes 17,19,23,37,41 etc or not?
Wednesday, 1 August 2018
divisibility - When an integer is disible by 17,19,23, or 41?
Subscribe to:
Post Comments (Atom)
real analysis - How to find limhrightarrow0fracsin(ha)h
How to find limh→0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Ok, according to some notes I have, the following is true for a random variable X that can only take on positive values, i.e P(X\int_0^...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
The question said: Use the Euclidean Algorithm to find gcd (1207,569) and write (1207,569) as an integer linear combination of 1207 ...
No comments:
Post a Comment