Skip to content

Instantly share code, notes, and snippets.

View miningape's full-sized avatar
👋
Hey there!

Kyle Johnson miningape

👋
Hey there!
View GitHub Profile
https://www.youtube.com/watch?v=HkuKHwetV6Q
@miningape
miningape / binarychain.py
Created September 12, 2016 14:41
WRITTEN BY MATT PARKER TO BE COMPARED WITH MY CODE (PYTHON 2)
"""
NOTE: This was all i could find on the DropBox link in the video
"""
def bc(cap): # binarychain finds the lonest chain tracking back to 13 or 18
# using the 'letter counting' function on readying out binary
# it also gives the ratio of chains which end 13 vs 18
recordlength = 0
recordvalue = 0
recordchain = []
@miningape
miningape / main.py
Last active September 12, 2016 14:39
"""
The basis of this project is in this video: https://www.youtube.com/watch?v=LYKn0yUTIU4
In it the speaker asks you to check his math; I wrote my own code and then compared it agains his: https://www.dropbox.com/s/j40jc15u0krvrb2/binarychain.py?dl=0
It is also in the other GIST i am adding to Reddit -> Credit for that code goes to MATT PARKER
TL;DR This code loops through all the numbers between 0 and the value in "maximum" it calculates how many letters are in the binary
form of the word "One" or "Zero" -> 13 (1101) and 18 (10010) are the only two values if spelled with the number of letters it equals its
value! In this all variables loop around until they reach either 13 or 18 (explained in video) I counted howmany of them go to either
18 (99.9909%) or 13 (the rest).