Skip to content

Weird numbers #6871

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 9 commits into from
Oct 12, 2022
Merged
Changes from 6 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
72 changes: 72 additions & 0 deletions maths/weird_number.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
from math import sqrt


def factors(n: int) -> list[int]:

v = []
v.append(1)

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

if n % i == 0:
v.append(i)
if int(n / i) != i:
v.append(int(n / i))
return v


def abundant(n: int) -> bool:
sum = 0
v = factors(n)
for i in range(len(v)):
sum += v[i]
if sum > n:
return True
else:
return False


def semi_perfect(n: int) -> bool:
v = factors(n)
v.sort(reverse=False)
r = len(v)
subset = [[0 for i in range(n + 1)] for j in range(r + 1)]
for i in range(r + 1):
subset[i][0] = True

for i in range(1, n + 1):
subset[0][i] = False

for i in range(1, r + 1):
for j in range(1, n + 1):
if j < v[i - 1]:
subset[i][j] = subset[i - 1][j]
else:
subset[i][j] = subset[i - 1][j] or subset[i - 1][j - v[i - 1]]

if (subset[r][n]) == 0:
return False
else:
return True


def weird(n: int) -> bool:
if abundant(n) == True and semi_perfect(n) == False:
return True
else:
return False


def main() -> None:
n = 70
if weird(n):
print("Weird Number")
else:
print("Not Weird Number")


if __name__ == "__main__":
import doctest

doctest.testmod(verbose=True)
main()