Not so much interesting problems there, and I'm not allowed to take exams back.
Denote (na) as Legendre symbol.
Def: Order of a modulo n denoted as ordn(a) is the smallest positive integer k such that
ak≡1(modn)
Def: Zn={0,1,2,…,n−1} be complete residue system modulo n.
Def: Zn∗={x∈Zn∣(x,n)=1} be reduced residue system modulo n.
1.) Find all positive integers n such that
- 2≤n≤30
- For all x∈Zn∗, ordn(x)<ϕ(n).
2.) Let a∈Zp∗ , p be prime numbers. Prove that for all p≥17,
2.1) If (pa)=1, then ordp(a)<p−1
2.2) There exists a such that (pa)=−1 and ordp(a)<p−1
3.) Let p be primes from 2 to 97 inclusively. Find the number of primes such that
3.1) ordp(2)=p−1
3.2) (p−1)=1
#NumberTheory
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.