-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtutoring4.py
More file actions
73 lines (60 loc) · 1.28 KB
/
tutoring4.py
File metadata and controls
73 lines (60 loc) · 1.28 KB
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
def convert_knuts(knuts):
sickles = 0
galleons = 0
while knuts >= 29:
sickles += 1
knuts -= 29
if sickles >= 17:
galleons += 1
sickles -= 17
return galleons, "galleons,", sickles, "sickles, and", knuts, "knuts."
convert_knuts(232)
def prime(n):
for x in range(2,n):
if float(n) % x == 0:
return False
else:
return True
def mod(m, n):
num = float(m)/n
print num
near = m/n
print near
fraction = num - near
print fraction
remainder = fraction * n
print remainder
a = round(remainder)
print a
return int(a)
def div(m, n):
answer = 0
for x in range(n, m+1, n):
print x
answer += 1
print answer
def multwhile(m, n):
count = 1
answer = 0
while count <= n:
answer += m
count += 1
return answer
print multwhile(5.01,5)
def multIA(m, n):
ans = 0
for x in range(n):
ans += n
return ans
def multIAgen(m, n):
ans = 0
for x in range(abs(n)):
if abs(n) == n and abs(m) == m:
ans += abs(m)
elif abs(n) != n and abs(m) != m:
ans += abs(m)
elif abs(n) != n and abs(m) == m:
ans += -m
else:
ans += m
return ans