Math on Adam Hacks

A Brief Review of Set Theory

Mon, 11 Jan 2021 00:00:00 +0000

Set theory is the branch of mathematics that, unsurprisingly, deals with sets. It’s an area of great importance in a number of fields, including computer science.

In this post, I’ll go over a brief review of basic set theory as it pertains to those pursuing an interest in computer science. Let’s just jump right in!

Boolean Algebra Cheat Sheet

Mon, 20 Apr 2020 00:00:00 +0000

I previously posted a logic rules cheat sheet and figured it was about time that I do the same for boolean algebra.

Logic Rules Cheat Sheet

Sun, 02 Feb 2020 00:00:00 +0000

When working with logic in discrete math appliations there are a plethora of rules you can use for working with the well formed formulas. Remembering them all can be a daunting task, which is why I like to have a cheat sheet available. As such, here’s a simple one that I like to use when working with these problems.

CS Review - Binary Numbers

Tue, 19 Sep 2017 00:00:00 +0000

Welcome to what will be the first in an ongoing series aimed at reviewing computer science topics. Today we will be diving into binary number representation. Understanding binary is an important step in gaining a better understanding of how the computer works on a lower level.

Recall that a computer is made up a whole bunch of integrated circuits, which are in turn made up of a bunch of transistors. These transistors can have one of two states: on or off. We represent these states as a 1 or a 0, respectively. This means that a computer can only work with two different values, 1s and 0s. This is where binary comes in.

Quickly Generating Primes Below n with the Sieve of Eratosthenes

Wed, 17 May 2017 00:00:00 +0000

The uses for prime numbers in computer science are nearly endless. They are useful for everything from hashing, cryptology, factorization, and all sorts of applications in-between.

There exists a great number of algorithms that allow us to quickly generate primes, but today we are going to take a look at a popular method known as a prime sieve. There are a number of different implementations of prime sieves, but one of the simplest to implement is known as the Sieve of Eratosthenes. This algorithm is great for quickly generating smaller prime numbers (but it may not be the best choice for generating very large primes).