Proving Divisibility of 'abba' & 'abbbba' by 11

  • Thread starter Thread starter um0123
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on proving the divisibility of the numbers represented by 'abba' and 'abbbba' by 11. It is established that 'abba', expressed as N=1001*a + 110*b, is divisible by 11 since both coefficients are divisible by 11. Similarly, 'abbbba' can be shown to be divisible by 11 through the same method. The participants also discuss a general rule for divisibility by 11, which states that a number is divisible by 11 if the alternating sum of its digits equals zero.

PREREQUISITES
  • Understanding of basic algebraic expressions
  • Familiarity with the rules of divisibility, specifically for 11
  • Knowledge of modular arithmetic concepts
  • Ability to manipulate polynomial expressions
NEXT STEPS
  • Study the rules of divisibility for numbers beyond 11
  • Learn about modular arithmetic and its applications
  • Explore polynomial expressions and their properties
  • Investigate alternative methods for proving divisibility
USEFUL FOR

Students studying number theory, educators teaching divisibility rules, and anyone interested in mathematical proofs and modular arithmetic.

um0123
Messages
151
Reaction score
0

Homework Statement



A four digit number can be represented by 'abba'. (where a and b are digits)

1) show that abba is always divisible by 11.
2) show that abbbba is always divisible by 11.
3) is abbba divisble by 11?

Homework Equations



non

The Attempt at a Solution



i honestly have no idea how to begin solving this, i understand what its asking but have no idea how to prove it.
 
Physics news on Phys.org
What are the rules of divisibility for 11?
 
You can write the number abba with its digits as N=1000*a+100*b+10b+a.

Collect the terms containing a and b:

N=1001*a +110 *b.

See if the factors 1001 and 110 are divisible by 11.

ehild
 
I have a easier way.

you can express N as :
10³a+10²b+10b+a
==(-1)³a+(-1)²b+(-1)b+a mod(11)
==-a+a+b-b mod(11)
==0 mod(11)

I believe the others can be proved analogously.
 
What icystrike said, can be generalized for any integer N.

Let

N=a_n10^n+...+a_110+a_0

Then, since 10=(-1)(mod11) it follows that 10^n=(-1)^n(mod11), and similarly for others, so:

a_n10^n+...+a_110+a_0=a_n(-1)^n+a_{n-1}(-1)^{n-1}+...+a_1(-1)+a_0(mod 11)

Which basically tells you that a number N is divisible by 11 iff when adding and subtracting its digits alternatively gives you zero.

now 2) -a+b-b+b-b+a=0. so yes!
 
Last edited:
we haven't learned modulo yet so I am not sure how to use them. I understand what you guys mean when you say it can be represented by 1000a + 100b + 10b + a but i don't understand how to use 11 to solve it.
 
um0123 said:
we haven't learned modulo yet so I am not sure how to use them. I understand what you guys mean when you say it can be represented by 1000a + 100b + 10b + a but i don't understand how to use 11 to solve it.

ehild explained it without modulo.

Have a look at his/her post! (post #3)
 
thanks to everyone, i figured it out and gave an explanation stating that if both nomials are divisible by a common factor then the sum of the two must also be.
 
It can easily be proved that if d|a and d|b then d|(ah+bk), where h,k are integers.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
Replies
9
Views
7K
Replies
4
Views
2K
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 11 ·
Replies
11
Views
5K
Replies
14
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K