Skip to content

Instantly share code, notes, and snippets.

@franknoh
Last active April 5, 2021 16:02
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save franknoh/7382d29e42eb7b4445f4210023456b38 to your computer and use it in GitHub Desktop.
Save franknoh/7382d29e42eb7b4445f4210023456b38 to your computer and use it in GitHub Desktop.
euler.ipynb
channels:
- defaults
dependencies:
- ipython
- ipywidgets
- matplotlib
- numpy
Display the source blob
Display the rendered blob
Raw
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
import math
def nPrime(n):
start = 2
count = 0
while True:
if all([start % i for i in range(2, int(math.sqrt(start)) + 1)]) != 0:
count += 1
if count == n:
return start
start += 1
def pList(n):
prime = []
p = 2
while True:
flag = 1
if p % 2 == 0 and p != 2:
flag = 0
if flag == 1:
for each in prime:
if p % each == 0:
flag = 0
if flag == 1:
prime.append(p)
if prime[len(prime)-1] >= n:
break
p+=1
return prime
def factors(n):
res=[]
while n % 2 == 0:
res.append(2),
n = n / 2
for i in range(3,int(math.sqrt(n))+1,2):
while n % i== 0:
res.append(i),
n = n / i
if n > 2:
res.append(n)
return res
def nFactorial(n):
return n * nFactorial(n-1) if n > 1 else 1
def fibo(n):
if n <= 2: return 1
else: return fibo(n-2) + fibo(n-1)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment