How many primes are there? INFINITELY MANY! How many different ways can you prove that? INFINITELY MANY! Unfortunately, Spark isn’t infinitely long, so we’ll only have time to cover $$\infty - 1$$ ways.

Mathematical induction is one of three key methods of proof, and is a powerful tool for every mathematician. Its most basic use is in the proofs of identities such as $$0+1+2+3+\cdots+n=\frac{n(n+1)}{2}$$, but its full power extends far beyond that, into all realms of mathematics. Induction can even be used to prove that all pigs are yellow*. *Note: It is not actually true that all pigs are yellow. The proof has a hidden flaw in it. Can you figure it out? Take our class and give it a try!

So you may have heard about this thing called a Markov Process. You may have heard it's pretty shweet. Maybe you've even heard that you can represent the state-space of your Markov Process in this thing called a Markov Chain. All of your friends are talking about them. In fact, Joey from down the block said that HIS dad bought him a Markov Chain bike for his birthday. Let's see if we can get a hold on exactly what a Markov Process is, and why it might be useful. Please note: this class will be taught with a dash of humor. If you prefer your mathematics cold and humorless, signing up for this course may not be an optimal choice. The level of rigor will scale proportionally to the background knowledge of the participants, so if you're afraid of a bunch of nasty linear algebra, that's fine! Most people are.

How many primes are there? INFINITELY MANY! How many different ways can you prove that? INFINITELY MANY! Unfortunately, Spark isn’t ...