Today we’re going to take a very quick look at the extended Euclidean…

In the last lesson, we discussed the search for large prime numbers including primes 1 billion digits long! If currently the largest known prime number is 17,425,170 long, how do we know…

When it comes to number envy, primes definitely steal the show, and for good reason…

Number parity is the grown up term for talking about whether a number is even or odd. Today we’ll take this elementary concept, define it formally and use it as a launching point to prove some basic results.

This method utilizes the unique prime factorization of a number to generate its factors. And the best part is that it doesn’t require any division, just basic math facts…

The Euclidean Algorithm is one of the oldest numerical algorithms still in use today. Attributed to ancient Greek mathematician Euclid in his book “Elements” written approximately 300 BC, the algorithm serves as an effective method for finding the greatest common divisor of two whole…

Today you are going to learn how to convert 110101110010101101001001 to a decimal number. No seriously, we are.

Can you say hacker status? It’s going to be awesome. Just wait!