FilesExpand file tree

master

/

BasicMaths.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

74 lines (57 loc) · 1.38 KB

master

/

BasicMaths.py

Copy path

Top

File metadata and controls

• Code
• Blame

74 lines (57 loc) · 1.38 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

import math

def primeFactors(n):

pf = []

while n % 2 == 0:

pf.append(2)

n = int(n / 2)

for i in range(3, int(math.sqrt(n))+1, 2):

while n % i == 0:

pf.append(i)

n = int(n / i)

if n > 2:

pf.append(n)

return pf

def numberOfDivisors(n):

div = 1

temp = 1

while n % 2 == 0:

temp += 1

n = int(n / 2)

div = div * (temp)

for i in range(3, int(math.sqrt(n))+1, 2):

temp = 1

while n % i == 0:

temp += 1

n = int(n / i)

div = div * (temp)

return div

def sumOfDivisors(n):

s = 1

temp = 1

while n % 2 == 0:

temp += 1

n = int(n / 2)

if temp > 1:

s *= (2**temp - 1) / (2 - 1)

for i in range(3, int(math.sqrt(n))+1, 2):

temp = 1

while n % i == 0:

temp += 1

n = int(n / i)

if temp > 1:

s *= (i**temp - 1) / (i - 1)

return s

def eulerPhi(n):

l = primeFactors(n)

l = set(l)

s = n

for x in l:

s *= (x - 1)/x

return s

def main():

print(primeFactors(100))

print(numberOfDivisors(100))

print(sumOfDivisors(100))

print(eulerPhi(100))

if __name__ == '__main__':

main()