Recent content by yaganon

I'm taking gen. physics 2, which consists of electric fields, magnetism, stuff like that. Big difference from classical mechanics in physics 1. I remember in calc III, I learned nothing from my professor because he didn't know how to teach. I basically learned the entire course from Paul's...

I'm also confused about the X! notation. I think X^x means the set of all selfmap functions on X. What is X! suppose to be?

So it says here "Let S be a set of sets. Show that isomorphism is an equivalence relation on S." So in order to approach this proof, can I just use the Reflexive, Symmetrical, and Transitive properties that is basically the definition of equivalence relations? eg. suppose x, y, z are sets...

That's the thing. I want to go to a prestigious grad school. For that, I need legit experiences on my resume that no average joes can obtain.

I go to Iowa State University, which is a decent college for engineering, not great. My GPA is not good right now (3.3, about to be 3.6ish after finals next week). I will try to ace every single college class for my next 2.5-3 years in college. I will tackle heavy courseloads, and still work in...

I'm an undergrad chemical engineer. I may switch to chemistry or materials science/engineering. I've taken abstract algebra, which sucked a lot. I should have taken the other professor's section. Anyways, I hate proofs. I'm wondering if I should continue math with real analysis. I heard that...

OK, I kind of get it. So you always start with 0, and the last element ends with 2 because two maps to 0 through the series of functions, completing the cycle. What if there isn't a zero? Also, when you're done with a cycle, how do you start the next one, do you choose the next smallest element...

1: Is a group of permutations basically the same as a group of functions? As far as I know, they have the same properties: associativity, identity function, and inverses. 2: I don't understand how you convert cyclic groups into product of disjoint cycles. A cyclic group (a b c d ... z) := a->b...

([SIZE="2"]Moderator's note: thread moved from "Linear & Abstract Algebra") problem # 12). Suppose X is a finite set with n elements. Show that the semigroup X^x has n^n elements. I'm confused. Isn't semigroup a set of functions? So when it says n elements, it actually means n functions? Also...

**theoretical linear algebra final in 14 hours*** I have some fundamental questions to ask.1. a linear transformation is invertible iff A is invertible. IS THIS TRUE? (dumb question but my brain hurts and I just need confirmation) 2. if a linear transformation is invertible, then it's an...

mmm not really I was thinking that if you're operating under standard conditions, water would be liquid since it would be something like 2H2(g) + O2(g) --> 2H2O(l) + ...KJ, in which case the heat would evaporate the liquid water.

First of all, how do you know if a combustion process produce h2o(g) or h2o(l)? It depends on the temperature, but how do you figure that out? I found the heat released during the combustion processes, which should equate the work done by the system (theoretically). But according to w =...

right now, my concept for their difference is that linear transformations are 1 to 1, where as nonlinear transformations are not. However, P^n to P^(-1) is a linear transformation, but it's not 1 to 1. the textbook def of linear transformation is that it must be closed under addition and...

hallsofivy why does A have to be singular?

If AB = AC, it's possible that B /= C conversely: if BA = CA, is it possible that C /= B? /= means doesn't equal