Show that ## (-13)^{n+1}\equiv (-13)^{n}+(-13)^{n-1}\pmod {181} ##?

  • Thread starter Math100
  • Start date
In summary, the proof by induction shows that for n≥1, the statement (-13)^{n+1}≡(-13)^{n}+(-13)^{n-1} (mod 181) is true. The proof involves showing that the statement is true for n=1, and then assuming it is true for some integer n=k≥1 and proving it for n=k+1. This is done by using algebra and the induction hypothesis. Thus, the statement holds for all n≥1.
  • #1
Math100
802
222
Homework Statement
For ## n\geq 1 ##, show that ## (-13)^{n+1}\equiv (-13)^{n}+(-13)^{n-1}\pmod {181} ##.
[Hint: Notice that ## (-13)^{2}\equiv -13+1\pmod {181} ##; use induction on ## n ##.]
Relevant Equations
None.
Proof:

The proof is by induction.
(1) When ## n=1 ##, the statement is ## (-13)^{1+1}\equiv (-13)^{1}+(-13)^{1-1}\pmod {181}\implies 169\equiv -12\pmod {181} ##, which is true.
(2) Now assume the statement is true for some integer ## n=k\geq 1 ##, that is assume ## (-13)^{k+1}\equiv (-13)^{k}+(-13)^{k-1}\pmod {181} ##. Next, we will show that the statement for ## n=k+1 ## is true. Observe that
\begin{align*}
(-13)^{(k+1)+1} &\equiv [(-13)^{k+1}+(-13)^{(k+1)-1}]\pmod{181}\\
&\implies (-13)^{k+2}\equiv [(-13)^{k+1}+(-13)^{k}] \pmod{181}.
\end{align*}
Thus
\begin{align*}
(-13)^{k+2}&\equiv (-13)(-13)^{k+1}\\
&\equiv (-13)[(-13)^{k}+(-13)^{k-1}]\pmod {181}\\
&\equiv [(-13)^{k+1}+(-13)^{k}]\pmod {181}.
\end{align*}
This establishes ## (-13)^{k+2}\equiv [(-13)^{k+1}+(-13)^{k}]\pmod {181} ##, which implies that the statement is true for ## n=k+1 ##.
The proof by induction is complete.
Therefore, ## (-13)^{n+1}\equiv (-13)^{n}+(-13)^{n-1}\pmod {181} ## for ## n\geq 1 ##.
 
Last edited:
Physics news on Phys.org
  • #2
Math100 said:
Homework Statement:: For ## n\geq 1 ##, show that ## (-13)^{n+1}\equiv (-13)^{n}+(-13)^{n-1}\pmod {181} ##.
[Hint: Notice that ## (-13)^{2}\equiv -13+1\pmod {181} ##; use induction on ## n ##.]
Relevant Equations:: None.

Proof:
Almost.

There were back slashes missing at begin and end commands. I inserted them.

Math100 said:
The proof is by induction.
(1) When ## n=1 ##, the statement is ## (-13)^{1+1}\equiv (-13)^{1}+(-13)^{1-1}\pmod {181}\implies 169\equiv -12\pmod {181} ##, which is true.
(2) Now assume the statement is true for some integer ## n=k\geq 1 ##, that is assume ## (-13)^{k+1}\equiv (-13)^{k}+(-13)^{k-1}\pmod {181} ##. Next, we will show that the statement for ## n=k+1 ## is true.
Simply erase the next paragraph. This looks as if you used the statement which has to be shown. So either you say "We must show that ..." instead of "observe" or better: drop it.
Math100 said:
Observe that
\begin{align*}
(-13)^{(k+1)+1} &\equiv [(-13)^{k+1}+(-13)^{(k+1)-1}]\pmod{181}\\
&\implies (-13)^{k+2}\equiv [(-13)^{k+1}+(-13)^{k}] \pmod{181}.
\end{align*}

This now is the actual proof: (##(-13)^{k+2}## + definition LHS + induction hypothesis + algebra = RHS)

Math100 said:
Thus

\begin{align*}
(-13)^{k+2}&\equiv (-13)(-13)^{k+1}\\
&\equiv (-13)[(-13)^{k}+(-13)^{k-1}]\pmod {181}\\
&\equiv [(-13)^{k+1}+(-13)^{k}]\pmod {181}.
\end{align*}
This establishes ## (-13)^{k+2}\equiv [(-13)^{k+1}+(-13)^{k}]\pmod {181} ##, which implies that the statement is true for ## n=k+1 ##.
The proof by induction is complete.
Therefore, ## (-13)^{n+1}\equiv (-13)^{n}+(-13)^{n-1}\pmod {181} ## for ## n\geq 1 ##.
 
  • Like
Likes Math100

FAQ: Show that ## (-13)^{n+1}\equiv (-13)^{n}+(-13)^{n-1}\pmod {181} ##?

What does the notation "##\equiv##" mean in this equation?

The notation "##\equiv##" means congruence in modular arithmetic. In this equation, it indicates that the two expressions are equivalent in modulo 181.

What does "##(-13)^{n+1}##" represent in this equation?

"##(-13)^{n+1}##" represents the term on the left side of the equation, which is raised to the power of n+1. In this case, it is the first term in a geometric sequence with a common ratio of -13.

How can you prove that this equation holds for all values of n?

This equation can be proven using mathematical induction, which involves showing that the equation holds for the base case (n=0) and then showing that if it holds for any arbitrary value of n, it also holds for n+1. This process can be repeated for all values of n, proving that the equation holds for all values of n.

Why is the modulus 181 used in this equation?

The modulus 181 is used because it is a prime number, which means that it has no factors other than 1 and itself. This makes it useful in modular arithmetic as it allows for unique solutions to equations and simplifies calculations.

Can this equation be applied to other values of the base and modulus?

Yes, this equation can be applied to other values of the base and modulus. However, the values must meet certain conditions for the equation to hold. For example, the base and modulus must be coprime (have no common factors) for the equation to hold.

Back
Top