December 10, 2002

List Properties

Well, I just got done with a few proofs for my Discrete Structures class, so I figured I’d share one theorem I had to prove with everyone. The theorem:

That looks really fancy and all, but when you break it down, it’s pretty simple. All those weird characters and greek letters say is that when you apply any function to lists M and N appended, you get the same result as if you applied the function to each list seperately and then combined the results. Hope that makes sense, it’s not too tough, it just looks fancy. I’d show the proof, but it takes way too long to type all those fancy letters.

1. good lord. it makes my math with just betas and thetas look like child’s play. that is why i will never ever take discrete anything. :P

   Posted by: kim on December 10, 2002 05:55 PM

2. God, you are such a bitch. That shit is easier than your mom. Did I mention you are a bitch?

   Posted by: Spenser on December 10, 2002 07:37 PM

3. God, you are such a bitch. That shit is easier than your mom. Did I mention you are a bitch?

   Posted by: Spenser on December 10, 2002 07:37 PM

4. Spenser shutup, we’ll drink some 40’s and then I’ll explain it all to ya.

   Posted by: Andy on December 10, 2002 07:52 PM

5. It’s not as hard as it looks.

   Posted by: Ryan on December 10, 2002 07:57 PM

6. because y’all are used to seeing that sorta thing.…?

   Posted by: kim on December 10, 2002 08:13 PM

7. Yeah. I suck at math. Really bad.

   Posted by: Spencer on December 10, 2002 09:12 PM

Sorry, commenting on this post is now clossed.