mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-03-03 13:28:40 +00:00
[pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
This commit is contained in:
parent
5f54615b8b
commit
a1ba381e4b
@ -59,7 +59,7 @@ def proth(number: int) -> int:
|
|||||||
return proth_list[number - 1]
|
return proth_list[number - 1]
|
||||||
|
|
||||||
|
|
||||||
def isProthNumber(number: int) -> bool :
|
def isProthNumber(number: int) -> bool:
|
||||||
"""
|
"""
|
||||||
:param number: nth number to calculate in the sequence
|
:param number: nth number to calculate in the sequence
|
||||||
:return: true if number is a Proth number, false etherwise
|
:return: true if number is a Proth number, false etherwise
|
||||||
@ -79,16 +79,14 @@ def isProthNumber(number: int) -> bool :
|
|||||||
if number < 1:
|
if number < 1:
|
||||||
msg = f"Input value of [number={number}] must be > 0"
|
msg = f"Input value of [number={number}] must be > 0"
|
||||||
raise ValueError(msg)
|
raise ValueError(msg)
|
||||||
|
|
||||||
N = number
|
N = number
|
||||||
N -= 1
|
N -= 1
|
||||||
n = 0
|
n = 0
|
||||||
while N%2 == 0 :
|
while N % 2 == 0:
|
||||||
N = N/2
|
N = N / 2
|
||||||
n += 1
|
n += 1
|
||||||
return N < (2**n)
|
return N < (2**n)
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
if __name__ == "__main__":
|
if __name__ == "__main__":
|
||||||
@ -108,8 +106,8 @@ if __name__ == "__main__":
|
|||||||
|
|
||||||
list = [3, 5, 9, 13, 49, 57, 193, 241, 163, 201]
|
list = [3, 5, 9, 13, 49, 57, 193, 241, 163, 201]
|
||||||
|
|
||||||
for number in list :
|
for number in list:
|
||||||
if isProthNumber(number):
|
if isProthNumber(number):
|
||||||
print(f"{number} is a Proth number")
|
print(f"{number} is a Proth number")
|
||||||
else :
|
else:
|
||||||
print(f"{number} is not a Proth number")
|
print(f"{number} is not a Proth number")
|
||||||
|
Loading…
x
Reference in New Issue
Block a user