You are not logged in.
Pages: 1
I have no idea truly, my professor doesn't teach us anything. He just does proofs and give tons of homework. Please give me more info. Thanks
Let H be a subgroup of order 2 in G. Show that NG(H) = CG(H). Deduce that if NG(H) = G then H < Z(G).
Let σ be the m-cycle (1 2 m). Show that σi is also an m-cycle if and only if i is relatively prime to m.
I need some directions please.
1. Find the order of (1 12 8 10 4)(2 13)(5 11 7)(6 9).
I am not sure what it means by order. I am not sure if I am suppose to find the length, lcm or what. Please help.
2. If n is odd and n ≥ 3, show that the identity is the only element of D2n which commutes with all elements of D2n.
3. If τ = (1 2)(3 4)(5 6)(7 8)(9 10) determine whether there is a n-cycle σ (n ≥ 10) with τ = σ^k for some integer k.
Please help...thanks
1. Prove that if a = an10n + an-110n-1 +
+ a110 + a0 is any positive integer then
a ≡ an + an-1 +
+ a1 + a0 (mod 9). [Note: 10 ≡ 1 (mod 9)]
2. Prove that the equation a2 + b2 = 3c2 has no solutions in nonzero integers a, b, and c.
[Consider the equation mod 4 and show that a, b and c would all have to be divisible by 2. Then each of a2, b2, c2 has a factor of
4 and by dividing through by 4 show that there would be a smaller set of solutions to the original equation. Iterate to reach a
contradiction]
3. Let n є Z, n > 1, and let a є Z with 1 ≤ a ≤ n. Prove if a and n are not relatively prime, there exists an integer b with 1 ≤ b < n such that ab ≡ 0 (mod n) and deduce that there cannot be an integer c such that ac ≡ 1(mod n).
Prove for any give positive integer N there exists only finite many integers n with
φ(n) = N where φ denotes Eulers function. Conclude in particular that φ(n) tends to infinity as n tends to infinity.
Can someone give me at least start on this? I am not sure where to begin.
I want to find the largest power of p (p is prime) which will divide n!
Thanks for your help
Thank you so much...I was able to get to the second to last line but wasn't sure about the very end.
I need help solving the following problem.
For the following pair of integers a and n, show that a is relatively prime to n and determine the multiplicative inverse of ā in Z/nZ.
a = 69, n = 89
Thanks for you help Jane. I still don't quite understand how I find the last 2 digits in #2.
^ exponent
I am looking for someone to help talk me through some Abstract homework.
-integers and modulo n problems. Euler's function...
1. compute the remainder when 37^100 is divide by 29.
2. compute the last 2 digits of 9^1500
Pages: 1