5 n > 1 5^{n>1} = 25 25 ?

Does 5 5 to the power of a positive integer > 1 > 1 always end in 25 ? 25?

No Yes

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Ellen Sassani
Dec 1, 2017

Prove that 5 n 25 m o d 100 \color{#D61F06}{5^n\equiv25\mod 100} , n 2 \color{#D61F06}{\forall n\ge 2} , n N \color{#D61F06}{n\in \mathbb{N}}

Proof: Suppose that n N \color{#D61F06}{n\in \mathbb{N}} . For n = 2 \color{#D61F06}{n=2} , we have \color{#D61F06}{5^2\mod 100 = 25\tag*{}}

or,

\color{#D61F06}{5^2\equiv 25 \mod 100\tag*{}}

so the base case holds.

Now, suppose that the statement holds true for some n = k \color{#CEBB00}{ n=k} . This allows us to write

\color{#CEBB00}{5^k\equiv 25 \mod 100 \tag{1}}

We are required to prove that the statement holds true for n = k + 1 \color{#CEBB00}{n=k+1}

Multiplying both sides of equation ( 1 ) (1) by 5 5 gives…

\color{#3D99F6}{\begin{aligned}5^k&\equiv 25\mod100\\5\cdot5^k&\equiv125\mod100\\5^{k+1}&\equiv\boxed{25}\mod100\end{aligned}}\tag*{}

Thus the statement holds true for n = k + 1 \color{#3D99F6}{n=k+1} , and hence the proof via mathematical induction.

Have you applied this approach to the 3rd and fourth digits of a number. So let's say instead the number is like this ----25--

ab ab - 3 years, 5 months ago
Nicholas Walters
Dec 1, 2017

5 2 = 5 × 5 = 25 5^{2} = 5 \times 5 = 25

Given 5 n = 5 × 5 × 5 × . . . 5^{n} = 5 \times 5 \times 5 \times . . . , the final digit will always multiply 5 × 5 5 \times 5 , which equals 25 25 .

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...