Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 Re: Help Me ! » abstract algebra - please help » 2008-09-07 12:25:43

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

#2 Help Me ! » abstract algebra - please help » 2008-09-07 09:22:23

parthenos
Replies: 6

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).

#3 Help Me ! » Help with Abstract » 2008-09-02 11:49:11

parthenos
Replies: 1

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. smile

#4 Help Me ! » Abstract Algebra - groups » 2008-08-31 11:20:38

parthenos
Replies: 5

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

#5 Help Me ! » Abstract Algebra - integers modulo n (3 problems) » 2008-08-27 00:07:58

parthenos
Replies: 1

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).

#6 Help Me ! » Euler's function problem » 2008-08-26 13:44:33

parthenos
Replies: 4

Prove for any give positive integer N there exists only finite many integers n with
φ(n) = N where φ denotes Euler’s function.  Conclude in particular that φ(n) tends to infinity as n tends to infinity.

#7 Help Me ! » greatest integer function » 2008-08-26 05:53:09

parthenos
Replies: 3

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 smile

#8 Re: Help Me ! » Abstract Algebra / multiplicative inverse » 2008-08-26 02:48:41

Thank you so much...I was able to get to the second to last line but wasn't sure about the very end. smile

#9 Help Me ! » Abstract Algebra / multiplicative inverse » 2008-08-26 00:33:11

parthenos
Replies: 3

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

#10 Re: Help Me ! » Need Help with Abstract Algebra (graduate level) » 2008-08-26 00:19:35

Thanks for you help Jane.  I still don't quite understand how I find the last 2 digits in #2.

#12 Help Me ! » Need Help with Abstract Algebra (graduate level) » 2008-08-25 11:53:48

parthenos
Replies: 9

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

Board footer

Powered by FluxBB