Simple Algebra question about division/prime factorizations

  • Thread starter Thread starter missavvy
  • Start date Start date
  • Tags Tags
    Algebra
Click For Summary

Homework Help Overview

The problem involves finding the remainder of the division of \( 7^{211} \) by 11, which falls under the subject area of modular arithmetic and number theory.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster attempts to understand the division process and expresses confusion about how to proceed after establishing the equation \( 7^{211} = 11q + r \). They consider whether to use prime factorizations of the numbers involved. Some participants suggest using Fermat's Little Theorem and working modulo 11, while others introduce the concept of modular arithmetic and discuss breaking down the exponent to simplify the problem.

Discussion Status

Participants are exploring different methods to approach the problem, including the application of Fermat's Little Theorem and modular arithmetic. Some guidance has been offered regarding breaking down the exponent and focusing on remainders, but there is no explicit consensus on a single method or solution yet.

Contextual Notes

The original poster mentions a lack of understanding of modular arithmetic, which may be a constraint in their ability to solve the problem. Additionally, there is an indication that certain topics, such as Fermat's Little Theorem, may not have been covered in their coursework.

missavvy
Messages
73
Reaction score
0

Homework Statement


Find the remainder of the division of 7^211 by 11

The Attempt at a Solution


I know this is an extremely trivial question, but I just don't understand what to do.
I've searched my textbook for an example, and I could of sworn I had one in my notes, but I really don't know how to do this! :S
7^211 = 11q + r, right?

but then what? or do i write the prime factorizations of 211... of 7? of 11?

if anyone can just help me with the method, or redirect me to a website with great notes.. :)
 
Physics news on Phys.org
Use Fermat's Little Theorem, work modulo 11, and write 211 as 11x+y, for some integers x, y.
 
Have you learned modular arithmetic? If you haven't, its basically something that allows you to throw away the parts of a number with a factor and leave you with a remainder. But since you don't know about it I'll explain it this way:

I can split up the exponent in [itex]7^{211}[/itex] for eg like this [itex]7^2 X 7^{209}= 49 X 7^{209}[/itex]. Now 49 is an easy number to deal with, and we see that 11 goes into it 4 times, and that 49 = 4(11) + 5. So now we can expland the original thing;

[tex]7^{211} = 7^2 x 7^{209} = (44 + 5) 7^{209} = 44X 7^{209} + 5X7^{209}[/tex]

Now, since we are only interested in the remainder when divided by 11, rather than how many times exactly, we any drop off any multiplies of 11 we see, and we just created one, namely the 44* 7^(209) term.

So the remainder of 7^(211) is the same as the remainder of 5 x 7^(209). In effect, you can just broken it down, and the answer can be achieved by continuing until you reach a number less than 11, but it will be long if you just keep taking off the small amount like I did.

So see if you can find some clever way to do a lot of those breaking ups in one go, perhaps by trying a few small break ups yourself if you can't see it straight away.

EDIT: Sorry I didn't see your post VeeEight! I'll leave mine up here in case the OP doesn't know mod arithmetic.
 
ah, thanks VeeEight!
i guess my prof skipped fermat's in our notes.
Thank you Gib Z! :)
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K