Recent content by koukou
-
K
What is the proof for n|φ(a^n-1)?
thank you i have done this one but still no idea to do this one Prove that n|φ(a^n-1) for every integer a≥2 and any positive integer n- koukou
- Post #5
- Forum: Set Theory, Logic, Probability, Statistics
-
K
What is the proof for n|φ(a^n-1)?
there exists a such that and xs1=y s2x=y..- koukou
- Post #3
- Forum: Set Theory, Logic, Probability, Statistics
-
K
What is the proof for n|φ(a^n-1)?
#1 a) If ex = x for some elements e,x belong to S, we say e is a left identity for x; similarly, if xe = x we say e is a right identity for x. Prove that an element is a left identity for one element of S if and only if it is a left identity for every element of S. Let S be a non-empty set with...- koukou
- Thread
- Proof
- Replies: 6
- Forum: Set Theory, Logic, Probability, Statistics
-
K
What is the Proof for (p-1)!≡±1 (mod p) in Number Theory?
Recall the definition of n! (read n factorial"): n! = (n)(n-1)(n-2) ….(2)(1) =∏(k) In both (a) and (b) below, suppose p≥3 is prime. (a) Prove that if x∈ Zpx is a solution to x square ≡1 (mod p), then x ≡±1 (mod p). (b) Prove that (p-1)!≡±1 (mod p) Zpx x shoud be above p a and b looks...- koukou
- Thread
- Number theory Proof Theory
- Replies: 2
- Forum: Linear and Abstract Algebra
-
K
What is the proof for Byron's Conjecture? Define Znx and prove its properties.
prove Byron's Conjecture. Define the set Znx={k∈Zn but not including zero :gcd(k; n) = 1} (a) Prove that Znx is a group under multiplication (mod n). (b) Prove that an element a∈Zn is invertible in Zn (with respect to multiplication (mod n)) if and only if a∈Znx Znx x should be above n . i...- koukou
- Thread
- Proof
- Replies: 3
- Forum: Linear and Abstract Algebra