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

  • Thread starter Thread starter Math100
  • Start date Start date
AI Thread Summary
The proof demonstrates that for all integers n ≥ 1, the equation (-13)^{n+1} ≡ (-13)^{n} + (-13)^{n-1} (mod 181) holds true using mathematical induction. It starts by verifying the base case for n=1, confirming that 169 ≡ -12 (mod 181) is valid. Assuming the statement is true for n=k, the proof then shows it must also hold for n=k+1 through algebraic manipulation. The proof concludes by establishing the inductive step, thereby confirming the statement for all n ≥ 1. This completes the induction proof successfully.
Math100
Messages
813
Reaction score
229
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 ##.
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top