From 076193eefa161a2030ca4b1ee60b285d4a50e4c6 Mon Sep 17 00:00:00 2001
From: Akshay Dubey <38462415+itsAkshayDubey@users.noreply.github.com>
Date: Thu, 10 Nov 2022 08:09:47 +0530
Subject: [PATCH] feat: Add pronic number implementation (#7979)

* feat: Add pronic number implementation

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
---
 maths/pronic_number.py | 54 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 maths/pronic_number.py

diff --git a/maths/pronic_number.py b/maths/pronic_number.py
new file mode 100644
index 000000000..8b554dbbd
--- /dev/null
+++ b/maths/pronic_number.py
@@ -0,0 +1,54 @@
+"""
+== Pronic Number ==
+A number n is said to be a Proic number if
+there exists an integer m such that n = m * (m + 1)
+
+Examples of Proic Numbers: 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110 ...
+https://en.wikipedia.org/wiki/Pronic_number
+"""
+
+# Author : Akshay Dubey (https://github.com/itsAkshayDubey)
+
+
+def is_pronic(number: int) -> bool:
+    """
+    # doctest: +NORMALIZE_WHITESPACE
+    This functions takes an integer number as input.
+    returns True if the number is pronic.
+    >>> is_pronic(-1)
+    False
+    >>> is_pronic(0)
+    True
+    >>> is_pronic(2)
+    True
+    >>> is_pronic(5)
+    False
+    >>> is_pronic(6)
+    True
+    >>> is_pronic(8)
+    False
+    >>> is_pronic(30)
+    True
+    >>> is_pronic(32)
+    False
+    >>> is_pronic(2147441940)
+    True
+    >>> is_pronic(9223372033963249500)
+    True
+    >>> is_pronic(6.0)
+    Traceback (most recent call last):
+        ...
+    TypeError: Input value of [number=6.0] must be an integer
+    """
+    if not isinstance(number, int):
+        raise TypeError(f"Input value of [number={number}] must be an integer")
+    if number < 0 or number % 2 == 1:
+        return False
+    number_sqrt = int(number**0.5)
+    return number == number_sqrt * (number_sqrt + 1)
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod()