Python/maths/basic_maths.py at master · FrogBattle/Python · GitHub

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
75
76
77
78
79
80
81
82
83
84
"""Implementation of Basic Math in Python."""
importmath


defprime_factors(n):
"""Find Prime Factors."""
pf= []
whilen%2==0:
pf.append(2)
n=int(n/2)

foriinrange(3, int(math.sqrt(n)) +1, 2):
whilen%i==0:
pf.append(i)
n=int(n/i)

ifn>2:
pf.append(n)

returnpf


defnumber_of_divisors(n):
"""Calculate Number of Divisors of an Integer."""
div=1

temp=1
whilen%2==0:
temp+=1
n=int(n/2)
div=div* (temp)

foriinrange(3, int(math.sqrt(n)) +1, 2):
temp=1
whilen%i==0:
temp+=1
n=int(n/i)
div=div* (temp)

returndiv


defsum_of_divisors(n):
"""Calculate Sum of Divisors."""
s=1

temp=1
whilen%2==0:
temp+=1
n=int(n/2)
iftemp>1:
s*= (2**temp-1) / (2-1)

foriinrange(3, int(math.sqrt(n)) +1, 2):
temp=1
whilen%i==0:
temp+=1
n=int(n/i)
iftemp>1:
s*= (i**temp-1) / (i-1)

returns


defeuler_phi(n):
"""Calculte Euler's Phi Function."""
l=prime_factors(n)
l=set(l)
s=n
forxinl:
s*= (x-1) /x
returns


defmain():
"""Print the Results of Basic Math Operations."""
print(prime_factors(100))
print(number_of_divisors(100))
print(sum_of_divisors(100))
print(euler_phi(100))


if__name__=='__main__':
main()