## The Bullard Binary Algorithm

I created a simple algorithm that allows you to quickly approximate the decimal value of 2 to the power of any whole number with just pencil and paper. Example: 2^Jenny. Jenny as we all know is at 8675309. Take the last digit (9) and move it off somewhere, you'll need it later to use with the table below. Multiply the rest by 3. That's 2602590. The answer will be 2^9 (look at the table) or 512*10^2602590. I can do about 20 digits in a minute. So if one day during an interview you get a question "What's 2^5?" Just say "That's too easy! Give me 40 digits and 2 minutes!" Just be sure to give me credit!

Don't forget the sequence for the last digit:

2^0 | 1 |

2^1 | 2 |

2^2 | 4 |

2^3 | 8 |

2^4 | 16 |

2^5 | 32 |

2^6 | 64 |

2^7 | 128 |

2^8 | 256 |

2^9 | 512 |

Example: The full human genome contains 3,156,105,057 base pairs. And since DNA is a binary code we can use my algorithm to calculate how special you are. Take the exponent 3,156,105,057, toss the 7 aside for now. Mulitply 315,610,505 by 3 and you get 946,831,515. Now find 2^7 (the rightmost digit in the exponent) in the table which is 128. So 2^3,156,105,057 is 128*10^946,831,515. That is almost 128 times 10 to the power of one billion, so the chances that someone else has the same DNA as you is one part in 128 followed by almost a billion zeros. Equality? Not very likely!