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

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

The discussion provides a proof by induction for the statement ## (-13)^{n+1}\equiv (-13)^{n}+(-13)^{n-1}\pmod {181} ## for integers ## n \geq 1 ##. The base case is verified for ## n=1 ##, confirming that ## 169\equiv -12\pmod {181} ## holds true. The inductive step assumes the statement is valid for ## n=k ## and demonstrates its validity for ## n=k+1 ## through algebraic manipulation. The proof concludes that the statement is true for all integers ## n \geq 1 ##.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with modular arithmetic
  • Basic algebraic manipulation skills
  • Knowledge of exponentiation rules
NEXT STEPS
  • Study mathematical induction techniques in depth
  • Explore modular arithmetic applications in number theory
  • Learn about properties of exponents in modular contexts
  • Investigate other induction proofs in modular arithmetic
USEFUL FOR

Mathematicians, students studying number theory, educators teaching modular arithmetic, and anyone interested in proofs involving mathematical induction.

Math100
Messages
817
Reaction score
230
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
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   Reactions: Math100

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
9
Views
2K
Replies
6
Views
1K
Replies
6
Views
3K