Skip to content

Commit f8e97aa

Browse files
percy07cclauss
authored andcommitted
Update basic_maths.py (#1517)
* Update basic_maths.py Add Doctests. * Update basic_maths.py * Add a space to fix the doctest
1 parent 4880e54 commit f8e97aa

File tree

2 files changed

+26
-28
lines changed

2 files changed

+26
-28
lines changed

maths/basic_maths.py

+25-27
Original file line numberDiff line numberDiff line change
@@ -2,83 +2,81 @@
22
import math
33

44

5-
def prime_factors(n):
6-
"""Find Prime Factors."""
5+
def prime_factors(n: int) -> list:
6+
"""Find Prime Factors.
7+
>>> prime_factors(100)
8+
[2, 2, 5, 5]
9+
"""
710
pf = []
811
while n % 2 == 0:
912
pf.append(2)
1013
n = int(n / 2)
11-
1214
for i in range(3, int(math.sqrt(n)) + 1, 2):
1315
while n % i == 0:
1416
pf.append(i)
1517
n = int(n / i)
16-
1718
if n > 2:
1819
pf.append(n)
19-
2020
return pf
2121

2222

23-
def number_of_divisors(n):
24-
"""Calculate Number of Divisors of an Integer."""
23+
def number_of_divisors(n: int) -> int:
24+
"""Calculate Number of Divisors of an Integer.
25+
>>> number_of_divisors(100)
26+
9
27+
"""
2528
div = 1
26-
2729
temp = 1
2830
while n % 2 == 0:
2931
temp += 1
3032
n = int(n / 2)
31-
div = div * (temp)
32-
33+
div *= temp
3334
for i in range(3, int(math.sqrt(n)) + 1, 2):
3435
temp = 1
3536
while n % i == 0:
3637
temp += 1
3738
n = int(n / i)
38-
div = div * (temp)
39-
39+
div *= temp
4040
return div
4141

4242

43-
def sum_of_divisors(n):
44-
"""Calculate Sum of Divisors."""
43+
def sum_of_divisors(n: int) -> int:
44+
"""Calculate Sum of Divisors.
45+
>>> sum_of_divisors(100)
46+
217
47+
"""
4548
s = 1
46-
4749
temp = 1
4850
while n % 2 == 0:
4951
temp += 1
5052
n = int(n / 2)
5153
if temp > 1:
5254
s *= (2 ** temp - 1) / (2 - 1)
53-
5455
for i in range(3, int(math.sqrt(n)) + 1, 2):
5556
temp = 1
5657
while n % i == 0:
5758
temp += 1
5859
n = int(n / i)
5960
if temp > 1:
6061
s *= (i ** temp - 1) / (i - 1)
61-
62-
return s
62+
return int(s)
6363

6464

65-
def euler_phi(n):
66-
"""Calculte Euler's Phi Function."""
65+
def euler_phi(n: int) -> int:
66+
"""Calculte Euler's Phi Function.
67+
>>> euler_phi(100)
68+
40
69+
"""
6770
l = prime_factors(n)
6871
l = set(l)
6972
s = n
7073
for x in l:
7174
s *= (x - 1) / x
72-
return s
75+
return int(s)
7376

7477

75-
def main():
76-
"""Print the Results of Basic Math Operations."""
78+
if __name__ == "__main__":
7779
print(prime_factors(100))
7880
print(number_of_divisors(100))
7981
print(sum_of_divisors(100))
8082
print(euler_phi(100))
81-
82-
83-
if __name__ == "__main__":
84-
main()

neural_network/perceptron.py

+1-1
Original file line numberDiff line numberDiff line change
@@ -90,7 +90,7 @@ def sort(self, sample) -> None:
9090
>>> data = [[2.0149, 0.6192, 10.9263]]
9191
>>> targets = [-1]
9292
>>> perceptron = Perceptron(data,targets)
93-
>>> perceptron.training() # doctest:+ELLIPSIS
93+
>>> perceptron.training() # doctest: +ELLIPSIS
9494
('\\nEpoch:\\n', ...)
9595
...
9696
>>> perceptron.sort([-0.6508, 0.1097, 4.0009]) # doctest: +ELLIPSIS

0 commit comments

Comments
 (0)