Permalink
Commits on Apr 1, 2010
  1. solve #41, and stick an is_pandigital function into euler.utils in th…

    …e process
    Daniel Folkinshteyn committed Apr 1, 2010
  2. generate some more primes (up to 14.5 mil or so

    Daniel Folkinshteyn committed Apr 1, 2010
Commits on Mar 29, 2010
  1. solve #45

    Daniel Folkinshteyn committed Mar 29, 2010
  2. solve #40

    Daniel Folkinshteyn committed Mar 29, 2010
  3. add limit args to euler.primes.PrimenessChecker, to avoid reading the…

    … whole file if we know we only need a
    
    subset. update 27, 35, 37 to use the limits.
    Daniel Folkinshteyn committed Mar 29, 2010
  4. update 35 and 37 to use the euler primes module

    Daniel Folkinshteyn committed Mar 29, 2010
  5. ignore *.pyc files for the git repo

    Daniel Folkinshteyn committed Mar 29, 2010
  6. shuffle off the prime checker into a module, since it's used a lot. m…

    …od 027.py to use the module
    Daniel Folkinshteyn committed Mar 29, 2010
  7. some more primes, now 851413 of them, up to 13mill

    Daniel Folkinshteyn committed Mar 29, 2010
  8. the prime generator, i use it to pregenerate a primes list which is u…

    …seful for a number of problems.
    Daniel Folkinshteyn committed Mar 29, 2010
  9. solve #27

    Daniel Folkinshteyn committed Mar 29, 2010
Commits on Mar 28, 2010
  1. solve #38

    Daniel Folkinshteyn committed Mar 28, 2010
  2. solve #37

    Daniel Folkinshteyn committed Mar 28, 2010
  3. solve #36

    Daniel Folkinshteyn committed Mar 28, 2010
  4. trivial-solve #97

    Daniel Folkinshteyn committed Mar 28, 2010
  5. solve #35

    Daniel Folkinshteyn committed Mar 28, 2010
  6. initial add of solutions i've done thus far

    Daniel Folkinshteyn committed Mar 28, 2010