Recent content by taylor81792

so I would try doing f(x)=X^n. and then get 0^0 and 0^1? so the answers would be 1 and 0. I'm still a little bit confused

Thank you so much

Homework Statement Let F be the set of all functions f mapping ℝ into ℝ that have derivatives of all orders. Determine whether the given map ∅ is an isomorphism of the first binary structure with the second. {F,+} with {ℝ,+} where ∅(f)=f'(0) Homework Equations None The Attempt at...

Okay, i redid it a final time and I believe the answer is 6

I just tried doing σ^3 and I got the inverse because 1 maps to 4, 4 to 6 and 6 to 1 2 to 3, 3 to 5, and 5 to 2. 3 to 5, 5 to 2, and 2 to 3. Does this look correct now?

okay i did that and then I got (1 2 3 4 5 6; 6 5 2 1 3 4), then ( 1 2 3 4 5 6; 4 3 5 6 2 1). does this look right?

Or would you have to keep going back to the original σ for each new cycle?

So i understood that and I continued doing that. I then got (1 2 3 4 5 6; 1 4 5 6 2 3). After doing it a couple more times, I ended up getting (1 2 3 4 5 6; 1 3 4 5 6 2) again. I don't know if I did something wrong.

I don't think my professor ever taught me that

Homework Statement The problem says to compute the expression shown for the permutations σ, τ, and μ. My problem in particular says to compute |{σ}| for σ= (1 2 3 4 5 6; 3 1 4 5 6 2) The Attempt at a Solution My attempt to solve this problem was by first trying to change σ into σ^2...

That helps a lot! Thank you!

Homework Statement The problem says: Suppose that * is an associative binary operation on a set S. Let H= {a ε S l a * x = x * a for all x ε s}. Show that H is closed under *. ( We think of H as consisting of all elements of S that commute with every element in S) My teacher is horrible so...

The problem says: Suppose that * is an associative binary operation on a set S. Let H= {a ε S l a * x = x * a for all x ε s}. Show that H is closed under *. ( We think of H as consisting of all elements of S that commute with every element in S) My teacher is horrible so I am pretty lost in...

My professor said we can also try to prove or find a counterexample to this statement. Let A, B and C be sets. Then (A-B) U C = (A U B U C) - (A n B). I'm not really sure what she means by counterexample.

Homework Statement The problem I have been given is to prove (A - B) U C is than less or equal to (A U B U C) - (A n B) The Attempt at a Solution I've tried starting off with just (A-B) U C. Then I would say how x ε c or x ε (A - B). Also if x ε a, then x ε c and x is not in b. If x ε c...