+0

# Let $n$ be a positive integer and $a$ be an integer such that $a$ is its own inverse modulo $n$. What is the remainder when $a^2$ is divided

0
239
1
+376

Let $n$ be a positive integer and $a$ be an integer such that $a$ is its own inverse modulo $n$. What is the remainder when $a^2$ is divided by $n$?

RektTheNoob  Aug 10, 2017

#1
+19207
+1

Let n be a positive integer and a be an integer such that a is its own inverse modulo n.
What is the remainder when a^2 is divided by n?

A modular inverse of an integer a (modulo n) is the integer $$a^{(-1)}$$ such that
$$aa^{(-1)}=1 \pmod n$$

So let $$a^{(-1)} = a$$, we have:

$$\begin{array}{|rcll|} \hline a\cdot a &=& 1 \pmod n \\ a^2 &=& 1 \pmod n \\ \hline \end{array}$$

The remainder when a2 is divided by n ist 1

heureka  Aug 11, 2017
Sort:

#1
+19207
+1

Let n be a positive integer and a be an integer such that a is its own inverse modulo n.
What is the remainder when a^2 is divided by n?

A modular inverse of an integer a (modulo n) is the integer $$a^{(-1)}$$ such that
$$aa^{(-1)}=1 \pmod n$$

So let $$a^{(-1)} = a$$, we have:

$$\begin{array}{|rcll|} \hline a\cdot a &=& 1 \pmod n \\ a^2 &=& 1 \pmod n \\ \hline \end{array}$$

The remainder when a2 is divided by n ist 1

heureka  Aug 11, 2017

### 29 Online Users

We use cookies to personalise content and ads, to provide social media features and to analyse our traffic. We also share information about your use of our site with our social media, advertising and analytics partners.  See details