MHB Show Equivalence: $a^d \equiv 1 \pmod n$

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Equivalence
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

Suppose that $p,q$ are two distinct primes , $n=pq$ and $d=gcd(p-1,q-1)$.
I want to show that if $a^{n-1} \equiv 1 \pmod{n}$ for some $a$ then $a^d \equiv 1 \pmod{n}$.

That's what I have tried:

$
a^{pq-1}\equiv 1 \pmod n \Rightarrow a^{pq-p+p-1}\equiv 1 \pmod n \Rightarrow a^{p(q-1)+(p-1)}\equiv 1 \pmod n \Rightarrow a^{Ad+Bd}\equiv 1 \pmod n$ for some $A,B \in \mathbb{Z}$.
Then we have $ a^{d(A+B)}\equiv 1 \pmod n \Rightarrow \left (a^{d}\right )^{A+B}\equiv 1 \pmod n$.

But from this, we cannot deduce that $a^d \equiv 1 \pmod{n}$, can we? (Thinking)
 
Mathematics news on Phys.org
evinda said:
Hello! (Wave)

Suppose that $p,q$ are two distinct primes , $n=pq$ and $d=gcd(p-1,q-1)$.
I want to show that if $a^{n-1} \equiv 1 \pmod{n}$ for some $a$ then $a^d \equiv 1 \pmod{n}$.

That's what I have tried:

$
a^{pq-1}\equiv 1 \pmod n \Rightarrow a^{pq-p+p-1}\equiv 1 \pmod n \Rightarrow a^{p(q-1)+(p-1)}\equiv 1 \pmod n \Rightarrow a^{Ad+Bd}\equiv 1 \pmod n$ for some $A,B \in \mathbb{Z}$.
Then we have $ a^{d(A+B)}\equiv 1 \pmod n \Rightarrow \left (a^{d}\right )^{A+B}\equiv 1 \pmod n$.

But from this, we cannot deduce that $a^d \equiv 1 \pmod{n}$, can we? (Thinking)

Hey evinda! (Smile)

I haven't figured it out yet. :(

However, I can see a couple of approaches...
According to Euler we have:
$$a^{\phi(pq)} \equiv a^{(p-1)(q-1)} \equiv 1 \pmod{pq}$$
And according to the Chinese Remainder Theorem we have:
$$(a^{pq-1}, a^{pq-1}) \equiv (1 \bmod p,1 \bmod q)\quad\Rightarrow\quad a^{q-1}\equiv 1 \pmod p \quad\land\quad a^{p-1}\equiv 1 \pmod q$$
(Thinking)
 
We also have that $d=x(p-1)+y(q-1)$ for some $x,y \in \mathbb{Z}$ and from this and what you said above it follows that $a^d \equiv 1 \pmod{n}$. (Thinking)
 
Last edited:
evinda said:
We also have that $d=x(p-1)+y(q-1)$ for some $x,y \in \mathbb{Z}$ and from this and what you said above it follows that $a^d \equiv 1 \pmod{n}$. (Thinking)

Ah yes. Nice! (Smile)
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top