What is the last digit of (1997)^(1997) - (1994)^(1994)?

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

The last digit of (1997)^(1997) - (1994)^(1994) is conclusively 1. This result is derived using modular arithmetic, specifically modulo 10. The last digit of 1997^(1997) is determined to be 7, while the last digit of 1994^(1994) is 6. The subtraction of these last digits (7 - 6) yields the final answer of 1.

PREREQUISITES
  • Understanding of modular arithmetic, specifically modulo 10
  • Familiarity with exponentiation and its properties
  • Knowledge of periodic sequences in number theory
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study modular exponentiation techniques in number theory
  • Explore the properties of periodic sequences in modular arithmetic
  • Learn about Euler's theorem and its applications in modular calculations
  • Investigate advanced techniques for calculating last digits of large powers
USEFUL FOR

Mathematicians, students studying number theory, educators teaching modular arithmetic, and anyone interested in computational mathematics.

maverick280857
Messages
1,774
Reaction score
5
The problem:

Find the last digit of

<br /> (1997)^{1997} - (1994)^{1994}<br />

The Answer: 1 (one)

Will post a solution soon...I would like to know if there is a different way to do it.

Cheers
Vivek
 
Last edited:
Physics news on Phys.org
Solution 1: Find the last digit of m^{n}

Divide the exponent n by 4. Let n = 4p + q. Let the last digit of m be t. Then the last digit of m^{n} is simply the last digit of t^{p}.

Do this twice to get 7 and 6 for (1997)^{1997} and (1994)^{1994} respectively. Subtract to get 1.

Solution 2: Find the last digit of m^{n}

Let a denote the last digit of m. Enumerate the last digits of a, a^{2}, a^{3}... and denote this series by \lambda. The series clearly repeats after T terms where T is the period of the sequence. Note that

Let r be the remainder when n is divided by T. The remainder has the values (1, 2, 3, ..., (T-1), 0) [note that zero has been placed after the (T-1)th term so that \lambda_{T} = 0]. The answer then is the r-th term of the \lambda sequence, that is \lambda_{r}.

------------------
What I want to know is: is there any other way to do this apart from the two ways mentioned above?

Cheers
Vivek
 
Last edited:
4 to an even power will always have a last digit of 6.
if 7 is raised to a power of some number n where (n-1)%4=0 then the resulting last digit will be a 7.

1994 is even thus 6
(1997-1)%4=0 thus 7
7-6=1

basically the last digit will follow some pattern in this case, the powers of 4 flip flop between 4 and 6 while the powers of 7 rotate through 7,9,3,1.
 
Yes, instead of evolving general rules I found it quite enlightening to figure out the last digit without using the methods outlined in my second post :-D

Cheers
Vivek
 
Why didn't you just multiply out by hand and subtract?:confused:
 
Arildno, do you really think that would be possible?! Thats 1997^{1997} and 1994^{1994} we're talking about! It would take me days (if at all I managed to do it).

Cheers
Vivek
 
Oh, I hadn't thought of that! (Or, possibly I had..:wink:)
 
Wer're only interested in the last digit of 1997^{1997} and 1994^{1994}, so consider these numbers modulo 10.
1997^{1997} \equiv 7^{1997} \mod 10
1994^{1994} \equiv 4^{1994} \mod 10
Since \left(\mathbb{Z}\slash_{10}\mathbb{Z}\right)^* forms a group under multiplication, raising an element of the group to the power equal to the order of the group equals 1. The order of \left(\mathbb{Z}\slash_{10}\mathbb{Z}\right)^*
is \varphi(10)=\varphi(2)\varphi(5)=4.
Since
1997 \equiv 1 \mod 4 and
1994 \equiv 2 \mod 4, we have
7^{1997} \equiv 7^1 \mod 10 and
4^{1994} \equiv 4^2 \mod 10

7-4^2 \equiv 1 \mod 10
So the last digit is 1.

This is the method I learned from my algebra class, but it's principally the same as Fausts' solution.
 
Last edited:
Yes it is, except that it is more formal.

Thanks and cheers,
Vivek
 
  • #10
It's not that hard to exponentiate out, especially if you realize that you only care about the last digit:

1994=1024+512+256+128+8+2
and
1997=1024+512+256+128+8+4+1

Recognizing that we can throw away everything except the last digit:
7^1 \equiv 7
square to get
7^2 \equiv 9
square to get
7^4 \equiv 1
So 7^{4n} \equiv 1
so we have
1997^{1997} \equiv
7 ^{1024+512+256+128+8+4+1} \equiv
7^{1024} \times 7^{512} \times 7^{256} \times 7^{128} \times 7^{8} \times 7^4 \times 7^1\equiv
1 \times 1 \times 1 \times 1 \times 1 \times 1 \times 7 \equiv
7

Similarly:
4^1 \equiv 4
4^2 \equiv 6
4^4 \equiv 6
So 4^{2^n} \equiv 6 for n&gt;1
now
1994^{1994} \equiv
4^{1024+512+256+128+8+2} \equiv
4^{1024} \times 4^{512} \times 4^{256} \times 4^{128} \times 4^{8} \times 4^2 \equiv
6 \times 6 \times 6 \times 6 \times 6 \times 6 \equiv
6^6 \equiv
6

Even without that x^y(mod z) is O(\log_2(y) {\log_2(z)}^2) or so. Certainly within paper and pencil calculation range for the numbers you gave
 
  • #11
Thanks faust9, Galileo, arildno and NateTG

I learned a lot from the approaches you folks suggested...thanks.


Cheers
Vivek
 

Similar threads

  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 15 ·
Replies
15
Views
1K
  • · Replies 11 ·
Replies
11
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 104 ·
4
Replies
104
Views
11K
  • · Replies 105 ·
4
Replies
105
Views
8K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
971