In [ ]:

!pip install pytest
#!pip install numpy
!pip install git+https://github.com/laguer/primefinders#egg=primefinders

In [ ]:

!pip list

In [10]:

from primefinders import primefinders

In [11]:

primefinders.about()

'primefinders.check(n)' returns 'True' if 'n' is a prime number
'primefinders.factor(n)' returns the lowest prime factor of 'n'
'primefinders.factors(n)' returns all the prime factors of 'n' with multiplicity
'primefinders.first(n)' returns first 'n' many primes
'primefinders.upto(n)' returns all the primes less than or equal to 'n'
'primefinders.between(m,n)' returns all the primes between 'm' and 'n'
'primefinders.phi(n)' returns the Euler's phi(n)
'primefinders.lcg(n)' example of Linear Congruential  Generator
'primefinders.getResult(n)' returns 'True' if 'n' getResult
'primefinders.calculate(n)' returns 1 if 'n' is prime
'primefinders.fermat(n)' returns 1 if 'n' is prime using fermat a ** (n - 1)) % n)
'primefinders.check_complex(n)' returns 1 if 'n' might be prime it said to be complex

In [20]:

primefinders.check(137)

Out[20]:

True

In [21]:

primefinders.phi(137)

Out[21]:

In [22]:

primefinders.phi(136)

Out[22]:

In [23]:

primefinders.phi(64)

Out[23]:

In [24]:

primefinders.phi(32)

Out[24]:

In [25]:

primefinders.phi(16)

Out[25]:

In [47]:

import numpy
numpy.__version__
#print(primefinders.__version__)

Out[47]:

'1.16.3'

In [32]:

from primefinders import primefinders
primefinders.phi(137)
print(primefinders.phi(137))

In [37]:

from primefinders import primefinders
primefinders.phi(137)

Out[37]:

In [48]:

from primefinders import primefinders
#import numpy
import pytest

#assert(numpy.__version__ == '1.15.4')
#assert(primefinders.phi(137) == 136)
#assert(primefinders.phi(136) == 64)
assert(primefinders.check(137) == True)

In [36]:

# change this to false if you want to test exceptions
assert True

In [50]:

assert(primefinders.phi(137) == 136)

In [ ]: