What is the remainder when 7^348+25^605 is divided by 8?

The regular calculater errors-out

Printable View

- September 27th 2006, 06:48 PMceasar_19134exponetial remainder problem
What is the remainder when 7^348+25^605 is divided by 8?

The regular calculater errors-out - September 27th 2006, 07:11 PMtopsquark
- September 27th 2006, 07:13 PMdan
- September 27th 2006, 07:20 PMdan
using win XP system calc i got ((7^348) + (25^605)) mod 8 = 2

but i cant prove that to your teacher ^_^

dan - September 27th 2006, 07:27 PMceasar_19134
dan

yeah

how do you solve it - September 27th 2006, 07:36 PMdan
- September 28th 2006, 05:25 PMceasar_19134
- September 28th 2006, 05:40 PMdan
- September 28th 2006, 06:32 PMtopsquark
My apologies. I had figured if you had been given this problem that you would have been taught this. Honestly I really don't know any other (good) way to do your problem.

Let me start with 25 = 1 (mod 8) first, it's easier.

This is shorthand for saying that the remainder when we divide 25 by 8 is 1. Another example would be 5 = 2 (mod 3). When you divide 5 by 3 you get a remainder of 2.

Now, when you divide 7 by 8 you get a remainder of, well, 7. So 7 = 7 (mod 8). Where do I get the -1 from? Well, we're playing around with something called an "equivalence relation." In actuality I shouldn't be using the "=" symbol, it should have 3 bars across, not 2. But since LaTeX is still down I'm using it for shorthand.

Anyway, this -1 business. We can show that a remainder of 7 (mod 8) is equivalent to a remainder -1 (mod 8). Really it isn't that hard. Let's look at 25 = 1 (mod 8) again. When we do 25/8 we pick the largest integer "k" such that 8k < 25, then we get the remainder by r = 25 - 8k. In this case k = 3. BUT what if we took k = 4 and found r = 25 - 8k? Now r = -7. So 25 = 1 (mod 8) = -7 (mod 8).

This is all a way of leading you into the more general definition of this "modular" number system. When we say 25 = r (mod 8) what we are saying is that r = 25 - 8k, where k is some integer. This defines a set that r can be equal to. Any member of this set is said to be "equivalent a modulo 8."

Typically we choose positive numbers for r, but to make things easier we occasionally also pick negative numbers, as I did to solve the problem in this thread.

This really isn't the best introduction to the subject. (I'm not a bad writer, but neither am I a good one! :) ) But it isn't really that hard, it just takes a little getting used to. You might find this link to be helpful. The first section is probably all that you need, though if you know the algebra the rest of it is decently informative.

Hope it helps!

-Dan - November 16th 2006, 08:36 AMTriKri
Is it 25 = 1 (mod 8) and not ? Or what's the difference?

- November 16th 2006, 08:57 AMCaptainBlack
- November 16th 2006, 09:28 AMTriKri
I'm a noob... -_-;;

But is there some other difference? (I don't want to start a new thread for this though) - November 16th 2006, 12:32 PMCaptainBlack
- November 16th 2006, 07:34 PMSoroban
Hello, ceasar_19134!

Exactly what course does this question come from?

If you aren't familiar with modular arithmetic, it's not a fair question.

Quote:

What is the remainder when is divided by 8?

For reference, let

Any multiple of 1000 is divisible by 8.

Hence, we are concerned with only the*last three digits*of

We will indicate " ends in " with: .

[1] We find that for

[2] We find that:

. . . . . .

Hence: .

Then: .

And: .