Blogs – Resources – Math Learning – Fun Math Facts

Quantum Computing Democracy

Consider the binary computer.  All bits have one of two states either 0 or 1, symbolic for 'off' and 'on' with reference to a circuit as symbolic of a 'fact of the world' propositionally, A is true or false.  In a quantum computer, the states may be occupied in...

read more

Navier-Stokes is hard?

Navier-Stokes is hard? Author: James Lowman I was recently asked the question; "How can the Navier-Stokes equations both describe our observable world and not be known to always have solutions in 3D?" For those that don't know, the Navier-Stokes (NS) equations...

read more

The Quadratic Equation

The Quadratic Equation Author: James Lowman   The quadratic equation is always the answer. Time and time again,  while tutoring students,  I encounter a resistance to using  an  unfailing  tool  called  the  quadratic  equation.   This  simple  algebraic...

read more

Cardinality and Countably Infinite Sets

Cardinality is a term used to describe the size of sets. Set A has the same cardinality as set B if a bijection exists between the two sets. We write this as |A| = |B|. One important type of cardinality is called “countably infinite.”

read more