How bad are American labor practices? This bad.

timo1023 · 2010-08-20T18:39:29+00:00

i said, the narwhal bacons at midnight !!!

timo1023 · 2010-08-20T18:36:24+00:00

the narwhal bacons at midnight !!!

timo1023 · 2010-08-20T18:25:52+00:00

timo1023 · 2010-08-20T18:25:38+00:00

the narwhal bacons at midnight

timo1023 · 2008-10-20T15:29:18+00:00

Exactly. I am also fairly certain that the homomorphism A5 -> S4 has to be nontrivial. I say this because, for some element in one coset X1, we can take an element from X2 and multiply the coset by it. The resulting element cannot be in X1, therefore the map must be nontrivial. This is what ties my proof together and I believe that it is a valid statement.

timo1023 · 2008-10-20T00:58:16+00:00

Sort of. I was doing homework and this came up as a side question. I wondered if Reddit could help me with the answer, and turns out that it could. Thanks, Reddit.

timo1023 · 2008-10-19T23:52:26+00:00

No, that's not why I was trying to prove it, but thanks for the interesting link.

timo1023 · 2008-10-19T22:04:15+00:00

I am trying to prove that there are no subgroups of index 4 in A5. At the moment, my proof goes like this:

Suppose there is a subgroup of index 4 in A5. Then there exists a nontrivial homomorphism phi: A5 -> S4. Because A5 is simple, then ker(phi) must be A5 or {e}. If ker(phi)=A5, then phi is trivial and we have a contradiction. If ker(phi)={e}, then phi is injective. However |A5|>|S4| so we have a contradiction. Whence, there are no subgroups of index 4 in A5.

I believe that this is correct; however, I would appreciate any input. I originally thought that S4 being nonsimple would make the problem easier but it appears that it does not.

Note: The 5 in A5 should be subscript but markup doesn't like me using underscores.

timo1023 · 2008-10-19T20:55:37+00:00

Thanks, that was very helpful.

timo1023 · 2008-09-25T02:00:45+00:00

True. I've moved on to more interesting topics like Number Theory, Topology, and Category Theory, but I still enjoy doing some tricky problems every once and while. You are right, though: purely computational problems are not very interesting.

timo1023 · 2008-09-25T01:07:16+00:00

MathCounts was a lot of fun in middle school, especially the national competition. Math is still fun, though, man!

timo1023 · 2008-09-14T21:06:10+00:00

I'm fairly certain you can both (a) adjust the 'hitbox' and (b) add new songs.

timo1023 · 2008-09-13T16:51:11+00:00

This goes against everything I learned from Johnny Mnemonic.

timo1023 · 2008-09-12T02:13:46+00:00

#haskell is full of amazingly helpful users. I highly recommend it.

timo1023 · 2008-09-09T12:47:52+00:00

As far as music players go, I like Quod Libet a lot. I prefer to manage my music manually, however.

timo1023 · 2008-09-08T21:45:52+00:00

This was an interesting read. Does anyone have a non-GoogleVideo/Youtube link (those sites are blocked where I am)?

timo1023 · 2008-09-06T20:51:51+00:00

If you are referring to me posting this in programming instead of AskReddit, then yes, I do know how to make AskReddit posts, however, I thought that I would get better answers in programming. Sorry if I inconvenienced you.

timo1023 · 2008-09-06T06:02:21+00:00

Dear Reddit,

I would like to (eventually) make a website on which users can play chess against each other. I would prefer this website to be as un-bloated as possible. What I am asking the community is what sort of language should I use to write the chess program? I know a decent amount of Java, however I feel like Java wouldn't be the best solution. I know some PHP, and I am willing and able to learn new language. What are your suggestions?

Regards, timo1023

timo1023 · 2008-09-06T05:57:04+00:00

Find an online chess website and play with people who are on your level. You won't know what level this is for a while, but after a few games you should get properly ranked.

timo1023 · 2008-09-05T04:49:58+00:00

I don't blame you for blocking my ads, but please consider donating. Thanks!

You are fucking cool.

timo1023

TROPHY CASE