Merge branch 'TheAlgorithms:master' into algo/transitiveClosure

Author: Deepak14Jain

.github/workflows/build.yml

@@ -14,7 +14,7 @@ jobs:
         with:
           enable-cache: true
           cache-dependency-glob: uv.lock
-      - uses: actions/setup-python@v5
+      - uses: actions/setup-python@v6
         with:
           python-version: 3.x
           allow-prereleases: true

.github/workflows/directory_writer.yml

@@ -9,7 +9,7 @@ jobs:
       - uses: actions/checkout@v5
         with:
           fetch-depth: 0
-      - uses: actions/setup-python@v5
+      - uses: actions/setup-python@v6
         with:
           python-version: 3.x
       - name: Write DIRECTORY.md

.github/workflows/project_euler.yml

@@ -16,7 +16,7 @@ jobs:
     steps:
       - uses: actions/checkout@v5
       - uses: astral-sh/setup-uv@v6
-      - uses: actions/setup-python@v5
+      - uses: actions/setup-python@v6
         with:
           python-version: 3.x
       - run: uv sync --group=euler-validate --group=test
@@ -26,7 +26,7 @@ jobs:
     steps:
       - uses: actions/checkout@v5
       - uses: astral-sh/setup-uv@v6
-      - uses: actions/setup-python@v5
+      - uses: actions/setup-python@v6
         with:
           python-version: 3.x
       - run: uv sync --group=euler-validate --group=test

.github/workflows/sphinx.yml

@@ -27,7 +27,7 @@ jobs:
     steps:
       - uses: actions/checkout@v5
       - uses: astral-sh/setup-uv@v6
-      - uses: actions/setup-python@v5
+      - uses: actions/setup-python@v6
         with:
           python-version: 3.13
           allow-prereleases: true

maths/special_numbers/proth_number.py

@@ -59,6 +59,50 @@ def proth(number: int) -> int:
     return proth_list[number - 1]
 
 
+def is_proth_number(number: int) -> bool:
+    """
+    :param number: positive integer number
+    :return: true if number is a Proth number, false otherwise
+    >>> is_proth_number(1)
+    False
+    >>> is_proth_number(2)
+    False
+    >>> is_proth_number(3)
+    True
+    >>> is_proth_number(4)
+    False
+    >>> is_proth_number(5)
+    True
+    >>> is_proth_number(34)
+    False
+    >>> is_proth_number(-1)
+    Traceback (most recent call last):
+        ...
+    ValueError: Input value of [number=-1] must be > 0
+    >>> is_proth_number(6.0)
+    Traceback (most recent call last):
+        ...
+    TypeError: Input value of [number=6.0] must be an integer
+    """
+    if not isinstance(number, int):
+        message = f"Input value of [{number=}] must be an integer"
+        raise TypeError(message)
+
+    if number <= 0:
+        message = f"Input value of [{number=}] must be > 0"
+        raise ValueError(message)
+
+    if number == 1:
+        return False
+
+    number -= 1
+    n = 0
+    while number % 2 == 0:
+        n += 1
+        number //= 2
+    return number < 2**n
+
+
 if __name__ == "__main__":
     import doctest
 
@@ -73,3 +117,9 @@ def proth(number: int) -> int:
             continue
 
         print(f"The {number}th Proth number: {value}")
+
+    for number in [1, 2, 3, 4, 5, 9, 13, 49, 57, 193, 241, 163, 201]:
+        if is_proth_number(number):
+            print(f"{number} is a Proth number")
+        else:
+            print(f"{number} is not a Proth number")

strings/palindrome.py

@@ -11,6 +11,8 @@
     "BB": True,
     "ABC": False,
     "amanaplanacanalpanama": True,  # "a man a plan a canal panama"
+    "abcdba": False,
+    "AB": False,
 }
 # Ensure our test data is valid
 assert all((key == key[::-1]) is value for key, value in test_data.items())
@@ -61,7 +63,7 @@ def is_palindrome_recursive(s: str) -> bool:
     >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
     True
     """
-    if len(s) <= 2:
+    if len(s) <= 1:
         return True
     if s[0] == s[len(s) - 1]:
         return is_palindrome_recursive(s[1:-1])