Urgend Assistance needed: Abstract Algebra

Click For Summary
SUMMARY

The discussion centers on proving that a number \( b \) written in base 10 is divisible by 2 if and only if its last digit \( b_0 \) is divisible by 2. The user, Hummingbird25, presents a detailed proof using the representation of \( b \) as \( b = b_0 \cdot 10^0 + b_1 \cdot 10^1 + \ldots + b_n \cdot 10^n \). The proof demonstrates that if \( 2 | b \), then \( 2 | b_0 \) and vice versa, establishing a clear relationship between the divisibility of \( b \) and its last digit.

PREREQUISITES
  • Understanding of base 10 number representation
  • Knowledge of divisibility rules, particularly for the number 2
  • Familiarity with basic algebraic manipulation
  • Concept of modular arithmetic
NEXT STEPS
  • Study the properties of divisibility in number theory
  • Explore modular arithmetic and its applications in proofs
  • Learn about base conversions and their implications in algebra
  • Investigate more complex proofs in abstract algebra
USEFUL FOR

This discussion is beneficial for students of abstract algebra, particularly those new to the subject, as well as educators looking for examples of proofs involving divisibility and base number systems.

Hummingbird25
Messages
84
Reaction score
0
Hi I'm fairly new at abstract algebra and have therefore got stuck with this assignment.

Hope there is somebody here who can help me complete it, because I have been ill these last couple of weeks.

Its goes something like this

b is a number written in base 10

[tex]b\;= \;b_010^0 + b_110^1 + b_210^2 + \hdots + b_n10^n[/tex]

where [tex]0 \leq b_j \leq 10[/tex]

(a) prove that 2 divides b if a only if 2 divides b_0.

My Solution:

Let [tex]b[/tex] be a number written in base 10 as:

[tex]b\;= \;b_010^0 + b_110^1 + b_210^2 + \hdots + b_n10^n[/tex] where [tex]0 \leq b_i < 10[/tex]

Prove that: .[/color][tex]2|b \;\Longleftrightarrow \;2|b_0[/tex][/size][/quote]
Given: .[/color][tex]2|b[/tex], we have:

. . [/color][tex]b \;=\;10^nb_n + 10^{n-1}b_{n-1} + 10^{n-2}b_{n-2} + \hdots + 10^2b_2 + 10b_1 + b_o \;=\;2k[/tex] for some integer [tex]k.[/tex]

. . [/color][tex]b_o \;=\;2k - \left(10^nb_n + 10^{n-1}b_{n-1} + 10^{n-2}b_{n-2} + \hdots + 10^2b_2 + 10b_1\right)[/tex]

. . [/color][tex]b_o \;= \;2k\:-\:\left(2\!\cdot\!5\1\cdot\!10^{n-1}a_n + 2\!\cdot5\1\cdot\!10^{n-1}b_{n-1} + \hdots + 2\!\cdot\!5\!\cdot\!10b_2 + 2\!\cdot\!5b_1\right)[/tex]

. . [/color][tex]b_o \;= \;2k\:-\:2\left(5\!\cdot\!10^{n-1}b_n + 5\!\cdot\!10^{n-1}b_{n-1} + \hdots + 5\!\cdot\!10b_2 + 5b_1\right)[/tex]

. . [/color][tex]b_o \;= \;2\left(k - 5\!\cdot\!10^{n-1}b_n - 5\!\cdot\!10^{n-1}b_{n-1} - \hdots - 5\!\cdot\!10b_2 - 5b_1\right)[/tex]

The right side is a multiple of 2, hence the left side is a multiple of 2.

Therefore: .[/color][tex]2|b_o[/tex]



Given: .[/color][tex]2|b_o[/tex], then [tex]b_o = 2k[/tex] for some integer [tex]k.[/tex]

Then: .[/color][tex]b \;=\;10^nb_n + 10^{n-1}b_{n-1} + 10^{n-2}b_{n-2} + \hdots + 10^2b_2 + 10b_1 + 2k[/tex]

. . . . . [/color][tex]b\;=\;2\!\cdot\!5\!\cdot\!10^{n-1}b_n + 2\!\cdot\!5\!\cdot\!10^{n-2}b_{n-1} + \hdots + 2\!\cdot\!5\!\cdot\!10b_2 + 2\!\cdot\!5\!\cdot\! b_1 + 2k[/tex]

. . . . . [/color][tex]b\;=\;2\left(5\!\cdot\!10^{n-1}b_n + 5\!\cdot\!10^{n-2}b_{n-1} + \hdots + 5\!\cdot\!10b_2 + 5\!\cdot\!b_1 + k\right)[/tex]

The right side is a multiple of 2, hence the left side is a multiple of 2.

Therefore: .[/color][tex]2|b[/tex]

[/size]

Does this look okay ?

Sincerely Yours
Hummingbird25.
 
Last edited:
Physics news on Phys.org
This is abstract algebra? I hope it is an introductory problem!
(by the way, it should be [itex]0\le b_j < 10[/itex].)

Hint: 2 divides 10.
 
Would You say it enough to show that 2 divides 10 ?

Sincerley

Hummingbird

p.s. I'm going into treatment for a heart condition tomorrow, and have to have these calculations finished by the end of today.

So therefore I hope that somebody in there can assist.

Sincerley

Brenda(Hummingbird25)
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K