Skip to content

Instantly share code, notes, and snippets.

@jakedobkin
Created December 24, 2011 21:06
Show Gist options
  • Select an option

  • Save jakedobkin/1518357 to your computer and use it in GitHub Desktop.

Select an option

Save jakedobkin/1518357 to your computer and use it in GitHub Desktop.
Project Euler 73
# http://projecteuler.net/problem=73
from fractions import Fraction, gcd
count=0
# start at 5, b/c that's the first number that has a fraction in this range
for d in range (5,12001):
for e in range (d/3,d/2):
if gcd(e,d) == 1:
count+=1
print count
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment