In 1990, Aldous, Bayer and Diaconis argue that it takes ~3/2 log2n or about 7 shuffles to completely randomize a pack of cards. In 2000, Nick Trefethen, an Oxford mathematician, and his father, Lloyd Trefethen, professor emeritus of mechanical engineering at Tufts University, argued that it only takes 5 shuffles. They define randomness using information theory. Complete information about the deck requires 225 bits, and complete randomness is 0 bits.