A residue a is called a generator modulo prime p if every non-zero residue modulo p equals some power of a modulo p.

please dont give the answer just give me some examples to understand generator modulo prime

Note by Superman Son
5 years, 3 months ago

No vote yet
4 votes

  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

Here's an example: 3 is a generator mod 7 since

\(3^0 \equiv 1 \pmod 7,\ 3^1 \equiv 3\pmod 7,\ 3^2 \equiv 2\pmod 7,\) \(3^3 \equiv 6 \pmod 7,\ 3^4 \equiv 4\pmod 7,\ 3^5 \equiv 5\pmod 7.\)

So all the non-zero elements mod 7 (namely 1-6) can be expressed as a power of 3.

On the other hand, 2 is not a generator mod 7 since its powers are 1, 2 and 4 mod 7.

C Lim - 5 years, 3 months ago

Log in to reply

thank you very much i got it(got the problem).couldnt do without your help

Superman Son - 5 years, 3 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...