{"push_id":3167184306,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"a2324af42b3ffae684f9156e6243c39329d9a53a","before":"3b70bbe98851f2577b1b3979d6772dfb8715dd97","commits":[{"sha":"f1620028f8d6bc2ea956ec21514f5fa1bfec958e","author":{"name":"SMTullis","email":"5a11b8e53df4424e420557faa428877b16795af5@vivaldi.net"},"message":"Correct factor_number()\n\nfactor_number() was not identifying 2 as a prime number. Increasing root by 1 ensures that the range() call returns at least 1 item in the iterable.","distinct":true,"url":"https://api.github.com/repos/SMTullis/euler_problems/commits/f1620028f8d6bc2ea956ec21514f5fa1bfec958e"},{"sha":"d820aac3edfd456cdf9f0ed72600ea2682cc2db6","author":{"name":"SMTullis","email":"5a11b8e53df4424e420557faa428877b16795af5@vivaldi.net"},"message":"Refactor check_prime_factorization_tuple()\n\nThe function body has been reduced to a single line utilizing all() to determine if the factors are prime.","distinct":true,"url":"https://api.github.com/repos/SMTullis/euler_problems/commits/d820aac3edfd456cdf9f0ed72600ea2682cc2db6"},{"sha":"a2324af42b3ffae684f9156e6243c39329d9a53a","author":{"name":"SMTullis","email":"5a11b8e53df4424e420557faa428877b16795af5@vivaldi.net"},"message":"Refactor main()\n\nmain() is still incomplete.","distinct":true,"url":"https://api.github.com/repos/SMTullis/euler_problems/commits/a2324af42b3ffae684f9156e6243c39329d9a53a"}]}
{"actor":{"display_login":"SMTullis"}}