Pinned Loading

1. Proj_euler solutions, problem 1 Proj_euler solutions, problem 1

   1

   #Import numpy

   2

   import numpy as np

   3

   #

   4

   # Build the list (note that the problem states "below" 1000,

   5

   # so we can safely use 1000 rather than 1001 in range)

2. proj_euler3 proj_euler3

   1

   # Our number to factor

   2

   number = 600851475143

   3

   4

   # Our pretty cool trick limiting the number of things we need to test:

   5

   # (int(number**(0.5)) is the closest truncated integer to square root of

3. ProjEuler2 ProjEuler2

   1

   # Initialize dummy variable at zero for our sum

   2

   even_sum = 0

   3

   4

   # We'll only keep track of the last two fibonacci numbers, from the problem, the first two are:

   5

   current_fibonacci = 2

4. capital_bikeshare capital_bikeshare Public

   Jupyter Notebook

5. Pivot-Tables-With-NYC-Bikes Pivot-Tables-With-NYC-Bikes Public

   Code for Pivot Table post using NYC bike data

   Jupyter Notebook

6. scratch_regression.py scratch_regression.py

   1

   import numpy as np

   2

   3

   class LinRegScratch():

   4

       def __init__(self):

   5

           pass