MikeASchneider

# Takes user's input
num = int(raw_input("What number do you want to crunch? "))

# Stores the number so we can print it at the end.
original_num = num
count = 0
n = 0

# Takes our number and checks for a remainder given 2^n+1. If there
# is, increments count. Increment n either way, since that's how we go. 

MikeASchneider

Keybase proof

I hereby claim:

• I am MikeASchneider on github.
• I am schneider (https://keybase.io/schneider) on keybase.
• I have a public key whose fingerprint is D7AE 3C15 9C8E 7803 07C0 21B7 4A9D F9D2 95D5 9C55

To claim this, I am signing this object:

MikeASchneider

1. Rob
2. Tal
3. Footprints
4. Grant Bond
5. Dickerson
6. That one case in the tech center that I lost a screw in that one time