Prime on prime, gives base prime

Let \[n=p_{1} × p_{2}\] where \(n\) belongs to the set of natural numbers and \(p_{1}\), \(p_{2}\) are prime factors of \(n\) , such that \(p_{1}<p_{2}\) .

Then \[p_{1}^{p_{2}} \equiv p_{1} \mod n\] holds true .

Note by Chinmay Sangawadekar
1 year, 6 months ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

This is trivial. We have the obvious congruence \(p_1^{p_2}\equiv 0\equiv p_1\pmod{p_1}\) since \(p_1\mid p_1^{p_2}\).

Since \(p_1,p_2\) are distinct primes, we have \(\gcd(p_1,p_2)=1\) and hence, by Fermat's Little Theorem, we have \(p_1^{p_2}\equiv p_1\pmod{p_2}\).

From the above results, we see that \(p_1^{p_2}\equiv p_1\pmod{p_1,p_2}\). Since \(\gcd(p_1,p_2)=1\), we have \(p_1^{p_2}\equiv p_1\pmod{p_1p_2}\), i.e., \(p_1^{p_2}\equiv p_1\pmod{n}\).


From the above, notice that since we just use the fact that \(p_1,p_2\) are distinct and not that \(p_1\lt p_2\), we also have \(p_2^{p_1}\equiv p_2\pmod{n}\).

Prasun Biswas - 1 year, 6 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...