Project Euler #15: algorithm for checking the number of valid traversals through a 20x20 grid
basic fibonacci functions (not mine)
re-solve Problem 1, more instrumentation on problem 15 (solution was wrong though)
stop tracking .pyc
trying out PyCharms, solve Problem 2
add prime factors code for Problem 3
add digit summing, exponent code for Problem 16
Merge branch 'master' of https://github.com/paradigm72/paradigm-euler