I am trying to prove this statement which is equivalent to show $n^{91} = n^7 \pmod{ 364}$. By splitting modulus theorem $n^{91} = n^7 \bmod 91$ and $\bmod 4$. Then I don’t know what to do next... Can anyone help me?
-
note: $91=7\times 13$ – J. W. Tanner Nov 11 '19 at 03:54
2 Answers
Apply below Euler-Fermat generalization with $\,e = 7,\, f = 84,\ m=\prod p_i^{e_i} = 2^2\cdot 7\cdot 13 $
Theorem $ $ Suppose that $\ m\in \mathbb N\ $ has the prime factorization $\:m = p_1^{e_{1}}\cdots\:p_k^{e_k}\ $ and suppose also that for all $\,i\!:\,$ $\ \color{#0a0}{e_i\le e}\ $ and $\ \color{#c00}{\phi(p_i^{e_{i}})\mid f}.\ $ Then $\ m\mid \color{darkorange}{a^e}(\color{#0af}{a^f\!-1})=:N,\, $ for all $\: a\in \mathbb Z.$
Proof $\ $ For $\,q := p_i^{e_{i}}$ it suffices to prove $\,q\mid \color{darkorange}{a^e}\,$ or $\,q\mid \color{#0af}{a^f\!-1}\,$ since then all $\,p_i^{e_i}\mid N\,$ hence their lcm = product = $\,m\,$ must also divide $N.\,$ If $\ p_{\:\!i}\mid a\ $ then $\,q=p_i^{\color{#0a0}{e_i}}\mid {\color{darkorange}a^{\color{#0a0}e}}\,$ by $\ \color{#0a0}{e_i \le e}.\: $ Else $\,p_i\nmid a\,$ so by $ $ Euler's phi theorem: $\bmod q\!: \ a^{\large \color{#c00}{\phi(q)}}\equiv 1,\:$ hence $\:\color{#0af}{a^{\large \color{#c00}f}\equiv 1},\,$ by $\,\color{#c00}{\phi(q)\mid f}$.
Examples $\ $ There are many instructive examples in prior questions, e.g. below
$\qquad\qquad\quad$ $24\mid a^3(a^2-1)$
$\qquad\qquad\quad$ $40\mid a^3(a^4-1)$
$\qquad\qquad\quad$ $88\mid a^5(a^{20}\!-1)$
$\qquad\qquad\quad$ $6p\mid a\,b^p - b\,a^p$
- 282,220
-
So, we actually need any multiple of $$(n^2(n^2-1),n^7-n,n^{13}-n)=n^2(n^{12}-1)$$ – lab bhattacharjee Nov 11 '19 at 04:06
-
1@lab Yes, by the Theorem we can take $, e = \max { e_i} = 2,\ f = {\rm lcm} {\phi(p_i^{e_i})} = {\rm lcm}{2,6,12} = 12\ \ \ $ – Bill Dubuque Nov 11 '19 at 04:13
Use Euler's theorem:
Mod $4$: either $n\equiv0 $ or $2$, so $n^{91}\equiv n^7\equiv0$, or $\color{blue}{n^2\equiv 1}$ so $n^{91}\equiv n^{84}n^7\equiv (n^2)^{42}n^7\equiv n^7$
Mod $7$: either $n\equiv0$, so $n^{91}\equiv n^7\equiv 0$, or $\color{blue}{n^6\equiv 1}$ so $n^{91}\equiv n^{84}n^7\equiv(n^6)^{14}n^7\equiv n^7$
Mod $13$: either $n\equiv0$, so $n^{91}\equiv n^7\equiv 0$, or $\color{blue}{n^{12}\equiv 1}$ so $n^{91}\equiv n^{84}n^7\equiv(n^{12})^{7}n^7\equiv n^7$
- 63,683
- 4
- 43
- 88
-
-
The argument is either incorrect or incomplete since it assumes $n$ is coprime to $,4,7,13,,$ but that is not assumed in the OP. – Bill Dubuque Nov 11 '19 at 04:03
-
You are right; I thought of that at one point but then forgot; I will try to correct my answer – J. W. Tanner Nov 11 '19 at 04:09
-
I edited my answer to include cases where $n$ is not coprime to $4, 7, 13$ – J. W. Tanner Nov 11 '19 at 04:15
-
With the fix, now it's a duplicate of the first proof in this older answer, which further shows how it generalizes (leading to my answer here). – Bill Dubuque Apr 18 '23 at 18:57