vedicmaths 0.1.0__tar.gz

vedicmaths-0.1.0/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Karthik Srinivasan
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

vedicmaths-0.1.0/PKG-INFO

@@ -0,0 +1,206 @@
+Metadata-Version: 2.4
+Name: vedicmaths
+Version: 0.1.0
+Summary: Python helpers for learning and applying Vedic mathematics techniques.
+Author: Karthik Srinivasan
+License-Expression: MIT
+Project-URL: Homepage, https://github.com/ksriniv2/vedicmaths
+Project-URL: Issues, https://github.com/ksriniv2/vedicmaths/issues
+Keywords: vedic mathematics,vedic maths,mental math,math,education,arithmetic
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Education
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Education
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: dev
+Requires-Dist: pytest>=8; extra == "dev"
+Dynamic: license-file
+
+# Vedic Mathematics
+
+Python helpers for learning and applying Vedic mathematics techniques. The
+library focuses on two things:
+
+- returning correct arithmetic results as simple Python values
+- exposing step-by-step workings that teachers, students, notebooks, and apps
+  can display
+
+This project is early-stage and intended to grow into an open-source package of
+well-tested Vedic mathematics methods.
+
+The first implementation pass is guided by the parsed source chunks in the
+larger Mr Rishi project, especially
+`data/processed/Vedic_mathematics_chunks.jsonl`.
+
+## Install for Development
+
+```powershell
+git clone https://github.com/ksriniv2/vedicmaths.git
+cd vedicmaths
+python -m pip install -e ".[dev]"
+```
+
+If you are working from this local starter folder:
+
+```powershell
+cd C:\Users\KARTH\OneDrive\Documents\vedicmathematics
+python -m pip install -e ".[dev]"
+```
+
+## Quick Start
+
+```python
+from vedicmathematics import (
+    nikhilam_multiply,
+    nikhilam_steps,
+    square_ending_in_5,
+    urdhva_tiryagbhyam_multiply,
+)
+
+print(nikhilam_multiply(98, 97))
+# 9506
+
+print(urdhva_tiryagbhyam_multiply(123, 456))
+# 56088
+
+print(square_ending_in_5(35))
+# 1225
+
+trace = nikhilam_steps(98, 97)
+for step in trace.steps:
+    print(step.title, step.expression, "=>", step.value)
+```
+
+You can also use the shorter package alias:
+
+```python
+from vedicmaths import nikhilam_multiply
+```
+
+## Available Functions
+
+| Function | Purpose |
+|---|---|
+| `digit_sum(number)` | Sums the decimal digits of a number. |
+| `sum_digits_until_single(number)` | Repeated digit sum, equivalent to digital root. |
+| `nikhilam_multiply(a, b, base=None)` | Multiplies numbers using a nearby base, commonly a power of ten. |
+| `nikhilam_steps(a, b, base=None)` | Returns the worked steps for Nikhilam multiplication. |
+| `anurupyena_multiply(a, b, working_base, theoretical_base=None)` | Proportionate-base multiplication when a multiple or sub-multiple is more convenient. |
+| `anurupyena_steps(a, b, working_base, theoretical_base=None)` | Worked steps for proportionate-base multiplication. |
+| `urdhva_tiryagbhyam_multiply(a, b)` | General multiplication using the vertically-and-crosswise digit method. |
+| `urdhva_tiryagbhyam_steps(a, b)` | Returns the worked steps for vertically-and-crosswise multiplication. |
+| `left_to_right_add(a, b)` | Addition with a trace-friendly column process. |
+| `left_to_right_add_steps(a, b)` | Worked steps for addition. |
+| `subtract_using_complement(a, b)` | Subtraction by complementing the subtrahend from a power of ten. |
+| `subtract_using_complement_steps(a, b)` | Worked steps for complement subtraction. |
+| `complement(number, base=None)` | Complement from a supplied base or next power of ten. |
+| `all_from_9_last_from_10(number)` | Nikhilam-style complement helper. |
+| `vinculum_digits(number)` | Signed digit representation for digits above 5. |
+| `multiply_by_5(number)` | Shortcut for multiplication by 5. |
+| `multiply_by_9(number)` | Shortcut for multiplication by 9. |
+| `multiply_by_11(number)` | Adjacent-sum shortcut for multiplication by 11. |
+| `multiply_by_11_steps(number)` | Worked steps for multiplication by 11. |
+| `multiply_by_12(number)` | Shortcut for multiplication by 12. |
+| `multiply_by_15(number)` | Shortcut for multiplication by 15. |
+| `multiply_by_25(number)` | Shortcut for multiplication by 25. |
+| `multiply_by_50(number)` | Shortcut for multiplication by 50. |
+| `multiply_by_75(number)` | Shortcut for multiplication by 75. |
+| `multiply_by_99(number)` | Shortcut for multiplication by 99. |
+| `multiply_by_125(number)` | Shortcut for multiplication by 125. |
+| `multiply_by_999(number)` | Shortcut for multiplication by 999. |
+| `multiply_by_repeated_9(number, count)` | Multiply by 9, 99, 999, etc. |
+| `square_ending_in_5(number)` | Squares numbers ending in 5 using the "one more than the previous" pattern. |
+| `square_ending_in_5_steps(number)` | Returns the worked steps for squaring a number ending in 5. |
+| `square_near_base(number, base=None)` | Squares numbers close to a power-of-ten base. |
+| `square_near_base_steps(number, base=None)` | Worked steps for near-base squaring. |
+| `square_near_50(number)` | Shortcut for squaring values near 50. |
+| `cube_ending_in_5(number)` | Cubes numbers ending in 5. |
+| `divide_by_5(number)` | Division by 5 as doubling then dividing by 10. |
+| `divide_by_25(number)` | Division by 25 as multiplying by 4 then dividing by 100. |
+| `recurring_decimal_unit_fraction(denominator, limit=None)` | Decimal expansion of `1 / denominator`, with repeating cycles in parentheses. |
+| `osculator_for_ending_9(divisor)` | Ekadhika-style osculator for divisors ending in 9. |
+| `fraction_to_percent(numerator, denominator)` | Converts fractions to percentages. |
+| `percent_of(percent, number)` | Calculates percent of a number. |
+| `transpose_percent(percent, number)` | Uses `a% of b = b% of a`. |
+| `is_divisible_by_3(number)` | Divisibility by 3 using digit sum. |
+| `is_divisible_by_9(number)` | Divisibility by 9 using digit sum. |
+| `is_divisible_by_11(number)` | Divisibility by 11 using alternating digit sums. |
+| `square_root_if_perfect(number)` | Returns the integer square root for perfect squares, otherwise `None`. |
+| `cube_root_if_perfect(number)` | Returns the integer cube root for perfect cubes, otherwise `None`. |
+| `digital_root(number)` | Computes a number's digital root. |
+| `casting_out_nines_check(a, b, result, operator="*")` | Verifies `+`, `-`, or `*` results using digital roots. |
+
+## Example Step Trace
+
+```python
+from vedicmathematics import nikhilam_steps
+
+trace = nikhilam_steps(98, 97)
+print(trace.result)
+# 9506
+
+for step in trace.steps:
+    print(f"{step.title}: {step.expression} = {step.value}")
+```
+
+Output:
+
+```text
+Choose base: base = 100 = 100
+Find deviations: 98 - 100, 97 - 100 = -2, -3
+Cross subtract: 98 + (-3) = 95
+Multiply deviations: (-2) * (-3) = 6
+Combine: (95 * 100) + (6) = 9506
+```
+
+## Roadmap
+
+Good next functions to add:
+
+- division using Paravartya Yojayet
+- multiplication by 9, 99, 999, and related bases
+- straight division and auxiliary fractions
+- simple and complex oscillators for divisibility
+- cube-root techniques
+- fraction simplification and recurring decimal patterns
+- richer renderers for traces, such as Markdown and HTML
+
+## Development
+
+Run tests:
+
+```powershell
+python -m pytest
+```
+
+Project structure:
+
+```text
+vedicmathematics/
+  vedicmathematics/
+    __init__.py
+    arithmetic.py
+  tests/
+    test_arithmetic.py
+  pyproject.toml
+  README.md
+```
+
+## Contributing
+
+Contributions are welcome. Please include:
+
+- a clear function name and docstring
+- tests for regular cases and edge cases
+- a `*_steps` variant when the method is teachable step by step
+- examples in the README when adding a major new method
+
+## License
+
+MIT

vedicmaths-0.1.0/README.md

@@ -0,0 +1,182 @@
+# Vedic Mathematics
+
+Python helpers for learning and applying Vedic mathematics techniques. The
+library focuses on two things:
+
+- returning correct arithmetic results as simple Python values
+- exposing step-by-step workings that teachers, students, notebooks, and apps
+  can display
+
+This project is early-stage and intended to grow into an open-source package of
+well-tested Vedic mathematics methods.
+
+The first implementation pass is guided by the parsed source chunks in the
+larger Mr Rishi project, especially
+`data/processed/Vedic_mathematics_chunks.jsonl`.
+
+## Install for Development
+
+```powershell
+git clone https://github.com/ksriniv2/vedicmaths.git
+cd vedicmaths
+python -m pip install -e ".[dev]"
+```
+
+If you are working from this local starter folder:
+
+```powershell
+cd C:\Users\KARTH\OneDrive\Documents\vedicmathematics
+python -m pip install -e ".[dev]"
+```
+
+## Quick Start
+
+```python
+from vedicmathematics import (
+    nikhilam_multiply,
+    nikhilam_steps,
+    square_ending_in_5,
+    urdhva_tiryagbhyam_multiply,
+)
+
+print(nikhilam_multiply(98, 97))
+# 9506
+
+print(urdhva_tiryagbhyam_multiply(123, 456))
+# 56088
+
+print(square_ending_in_5(35))
+# 1225
+
+trace = nikhilam_steps(98, 97)
+for step in trace.steps:
+    print(step.title, step.expression, "=>", step.value)
+```
+
+You can also use the shorter package alias:
+
+```python
+from vedicmaths import nikhilam_multiply
+```
+
+## Available Functions
+
+| Function | Purpose |
+|---|---|
+| `digit_sum(number)` | Sums the decimal digits of a number. |
+| `sum_digits_until_single(number)` | Repeated digit sum, equivalent to digital root. |
+| `nikhilam_multiply(a, b, base=None)` | Multiplies numbers using a nearby base, commonly a power of ten. |
+| `nikhilam_steps(a, b, base=None)` | Returns the worked steps for Nikhilam multiplication. |
+| `anurupyena_multiply(a, b, working_base, theoretical_base=None)` | Proportionate-base multiplication when a multiple or sub-multiple is more convenient. |
+| `anurupyena_steps(a, b, working_base, theoretical_base=None)` | Worked steps for proportionate-base multiplication. |
+| `urdhva_tiryagbhyam_multiply(a, b)` | General multiplication using the vertically-and-crosswise digit method. |
+| `urdhva_tiryagbhyam_steps(a, b)` | Returns the worked steps for vertically-and-crosswise multiplication. |
+| `left_to_right_add(a, b)` | Addition with a trace-friendly column process. |
+| `left_to_right_add_steps(a, b)` | Worked steps for addition. |
+| `subtract_using_complement(a, b)` | Subtraction by complementing the subtrahend from a power of ten. |
+| `subtract_using_complement_steps(a, b)` | Worked steps for complement subtraction. |
+| `complement(number, base=None)` | Complement from a supplied base or next power of ten. |
+| `all_from_9_last_from_10(number)` | Nikhilam-style complement helper. |
+| `vinculum_digits(number)` | Signed digit representation for digits above 5. |
+| `multiply_by_5(number)` | Shortcut for multiplication by 5. |
+| `multiply_by_9(number)` | Shortcut for multiplication by 9. |
+| `multiply_by_11(number)` | Adjacent-sum shortcut for multiplication by 11. |
+| `multiply_by_11_steps(number)` | Worked steps for multiplication by 11. |
+| `multiply_by_12(number)` | Shortcut for multiplication by 12. |
+| `multiply_by_15(number)` | Shortcut for multiplication by 15. |
+| `multiply_by_25(number)` | Shortcut for multiplication by 25. |
+| `multiply_by_50(number)` | Shortcut for multiplication by 50. |
+| `multiply_by_75(number)` | Shortcut for multiplication by 75. |
+| `multiply_by_99(number)` | Shortcut for multiplication by 99. |
+| `multiply_by_125(number)` | Shortcut for multiplication by 125. |
+| `multiply_by_999(number)` | Shortcut for multiplication by 999. |
+| `multiply_by_repeated_9(number, count)` | Multiply by 9, 99, 999, etc. |
+| `square_ending_in_5(number)` | Squares numbers ending in 5 using the "one more than the previous" pattern. |
+| `square_ending_in_5_steps(number)` | Returns the worked steps for squaring a number ending in 5. |
+| `square_near_base(number, base=None)` | Squares numbers close to a power-of-ten base. |
+| `square_near_base_steps(number, base=None)` | Worked steps for near-base squaring. |
+| `square_near_50(number)` | Shortcut for squaring values near 50. |
+| `cube_ending_in_5(number)` | Cubes numbers ending in 5. |
+| `divide_by_5(number)` | Division by 5 as doubling then dividing by 10. |
+| `divide_by_25(number)` | Division by 25 as multiplying by 4 then dividing by 100. |
+| `recurring_decimal_unit_fraction(denominator, limit=None)` | Decimal expansion of `1 / denominator`, with repeating cycles in parentheses. |
+| `osculator_for_ending_9(divisor)` | Ekadhika-style osculator for divisors ending in 9. |
+| `fraction_to_percent(numerator, denominator)` | Converts fractions to percentages. |
+| `percent_of(percent, number)` | Calculates percent of a number. |
+| `transpose_percent(percent, number)` | Uses `a% of b = b% of a`. |
+| `is_divisible_by_3(number)` | Divisibility by 3 using digit sum. |
+| `is_divisible_by_9(number)` | Divisibility by 9 using digit sum. |
+| `is_divisible_by_11(number)` | Divisibility by 11 using alternating digit sums. |
+| `square_root_if_perfect(number)` | Returns the integer square root for perfect squares, otherwise `None`. |
+| `cube_root_if_perfect(number)` | Returns the integer cube root for perfect cubes, otherwise `None`. |
+| `digital_root(number)` | Computes a number's digital root. |
+| `casting_out_nines_check(a, b, result, operator="*")` | Verifies `+`, `-`, or `*` results using digital roots. |
+
+## Example Step Trace
+
+```python
+from vedicmathematics import nikhilam_steps
+
+trace = nikhilam_steps(98, 97)
+print(trace.result)
+# 9506
+
+for step in trace.steps:
+    print(f"{step.title}: {step.expression} = {step.value}")
+```
+
+Output:
+
+```text
+Choose base: base = 100 = 100
+Find deviations: 98 - 100, 97 - 100 = -2, -3
+Cross subtract: 98 + (-3) = 95
+Multiply deviations: (-2) * (-3) = 6
+Combine: (95 * 100) + (6) = 9506
+```
+
+## Roadmap
+
+Good next functions to add:
+
+- division using Paravartya Yojayet
+- multiplication by 9, 99, 999, and related bases
+- straight division and auxiliary fractions
+- simple and complex oscillators for divisibility
+- cube-root techniques
+- fraction simplification and recurring decimal patterns
+- richer renderers for traces, such as Markdown and HTML
+
+## Development
+
+Run tests:
+
+```powershell
+python -m pytest
+```
+
+Project structure:
+
+```text
+vedicmathematics/
+  vedicmathematics/
+    __init__.py
+    arithmetic.py
+  tests/
+    test_arithmetic.py
+  pyproject.toml
+  README.md
+```
+
+## Contributing
+
+Contributions are welcome. Please include:
+
+- a clear function name and docstring
+- tests for regular cases and edge cases
+- a `*_steps` variant when the method is teachable step by step
+- examples in the README when adding a major new method
+
+## License
+
+MIT

vedicmaths-0.1.0/pyproject.toml

@@ -0,0 +1,39 @@
+[build-system]
+requires = ["setuptools>=68", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "vedicmaths"
+version = "0.1.0"
+description = "Python helpers for learning and applying Vedic mathematics techniques."
+readme = "README.md"
+requires-python = ">=3.10"
+license = "MIT"
+license-files = ["LICENSE"]
+authors = [
+  { name = "Karthik Srinivasan" }
+]
+keywords = ["vedic mathematics", "vedic maths", "mental math", "math", "education", "arithmetic"]
+classifiers = [
+  "Development Status :: 3 - Alpha",
+  "Intended Audience :: Education",
+  "Programming Language :: Python :: 3",
+  "Programming Language :: Python :: 3.10",
+  "Programming Language :: Python :: 3.11",
+  "Programming Language :: Python :: 3.12",
+  "Topic :: Education",
+  "Topic :: Scientific/Engineering :: Mathematics",
+]
+
+[project.optional-dependencies]
+dev = ["pytest>=8"]
+
+[project.urls]
+Homepage = "https://github.com/ksriniv2/vedicmaths"
+Issues = "https://github.com/ksriniv2/vedicmaths/issues"
+
+[tool.setuptools.packages.find]
+include = ["vedicmathematics", "vedicmaths"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]

vedicmaths-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

vedicmaths-0.1.0/tests/test_arithmetic.py

@@ -0,0 +1,198 @@
+import pytest
+
+from vedicmathematics import (
+    all_from_9_last_from_10,
+    anurupyena_multiply,
+    casting_out_nines_check,
+    complement,
+    cube_ending_in_5,
+    cube_root_if_perfect,
+    digit_sum,
+    digital_root,
+    divide_by_5,
+    divide_by_25,
+    fraction_to_percent,
+    is_divisible_by_3,
+    is_divisible_by_9,
+    is_divisible_by_11,
+    left_to_right_add,
+    multiply_by_5,
+    multiply_by_9,
+    multiply_by_11,
+    multiply_by_12,
+    multiply_by_15,
+    multiply_by_25,
+    multiply_by_50,
+    multiply_by_75,
+    multiply_by_99,
+    multiply_by_125,
+    multiply_by_999,
+    multiply_by_repeated_9,
+    nikhilam_multiply,
+    nikhilam_steps,
+    osculator_for_ending_9,
+    percent_of,
+    recurring_decimal_unit_fraction,
+    square_ending_in_5,
+    square_near_50,
+    square_near_base,
+    square_root_if_perfect,
+    subtract_using_complement,
+    sum_digits_until_single,
+    transpose_percent,
+    urdhva_tiryagbhyam_multiply,
+    vinculum_digits,
+)
+
+
+@pytest.mark.parametrize(
+    ("number", "expected"),
+    [(0, 0), (9, 9), (10, 1), (99, 9), (12345, 6), (-987, 6)],
+)
+def test_digital_root(number, expected):
+    assert digital_root(number) == expected
+
+
+def test_digit_sum_helpers():
+    assert digit_sum(98765) == 35
+    assert sum_digits_until_single(98765) == 8
+
+
+def test_casting_out_nines_check():
+    assert casting_out_nines_check(98, 97, 9506)
+    assert casting_out_nines_check(45, 17, 62, "+")
+    assert not casting_out_nines_check(45, 17, 63, "+")
+
+
+@pytest.mark.parametrize(
+    ("a", "b"),
+    [(98, 97), (104, 103), (1002, 1005), (-98, 97), (98, -97)],
+)
+def test_nikhilam_multiply(a, b):
+    assert nikhilam_multiply(a, b) == a * b
+
+
+def test_nikhilam_steps_exposes_working():
+    trace = nikhilam_steps(98, 97)
+    assert trace.result == 9506
+    assert trace.steps[0].title == "Choose base"
+    assert trace.steps[-1].title == "Combine"
+
+
+def test_anurupyena_multiply():
+    assert anurupyena_multiply(41, 41, 50, 100) == 1681
+    assert anurupyena_multiply(46, 44, 50, 100) == 46 * 44
+
+
+@pytest.mark.parametrize(
+    ("a", "b"),
+    [(12, 13), (123, 456), (999, 999), (1001, 77), (-321, 45), (-321, -45)],
+)
+def test_urdhva_tiryagbhyam_multiply(a, b):
+    assert urdhva_tiryagbhyam_multiply(a, b) == a * b
+
+
+@pytest.mark.parametrize("number", [5, 15, 25, 105, 9995, -35])
+def test_square_ending_in_5(number):
+    assert square_ending_in_5(number) == number * number
+
+
+def test_square_ending_in_5_rejects_other_numbers():
+    with pytest.raises(ValueError):
+        square_ending_in_5(42)
+
+
+def test_complements():
+    assert complement(87) == 13
+    assert complement(887, 1000) == 113
+    assert all_from_9_last_from_10(76) == 24
+
+
+def test_left_to_right_add():
+    assert left_to_right_add(987, 654) == 1641
+
+
+@pytest.mark.parametrize(("a", "b"), [(1000, 348), (348, 1000), (12345, 9876)])
+def test_subtract_using_complement(a, b):
+    assert subtract_using_complement(a, b) == a - b
+
+
+def test_vinculum_digits():
+    assert vinculum_digits(18) == (2, -2)
+    assert vinculum_digits(76) == (1, -2, -4)
+    assert vinculum_digits(576) == (6, -2, -4)
+
+
+@pytest.mark.parametrize("number", [0, 1, 7, 42, 1234, -56])
+def test_multiplication_shortcuts(number):
+    assert multiply_by_5(number) == number * 5
+    assert multiply_by_9(number) == number * 9
+    assert multiply_by_11(number) == number * 11
+    assert multiply_by_12(number) == number * 12
+    assert multiply_by_15(number) == number * 15
+    assert multiply_by_25(number) == number * 25
+    assert multiply_by_50(number) == number * 50
+    assert multiply_by_75(number) == number * 75
+    assert multiply_by_99(number) == number * 99
+    assert multiply_by_125(number) == number * 125
+    assert multiply_by_999(number) == number * 999
+    assert multiply_by_repeated_9(number, 4) == number * 9999
+
+
+@pytest.mark.parametrize("number", [98, 102, 1004, 47, -103])
+def test_square_near_base(number):
+    assert square_near_base(number) == number * number
+
+
+@pytest.mark.parametrize("number", [47, 49, 51, 56])
+def test_square_near_50(number):
+    assert square_near_50(number) == number * number
+
+
+def test_cube_ending_in_5():
+    assert cube_ending_in_5(15) == 15**3
+    assert cube_ending_in_5(-25) == (-25) ** 3
+    with pytest.raises(ValueError):
+        cube_ending_in_5(24)
+
+
+def test_division_and_percent_helpers():
+    assert divide_by_5(125) == 25
+    assert divide_by_25(125) == 5
+    assert fraction_to_percent(1, 8) == 12.5
+    assert percent_of(12.5, 80) == 10
+    assert transpose_percent(12.5, 80) == percent_of(80, 12.5)
+
+
+def test_divisibility_helpers():
+    assert is_divisible_by_3(123)
+    assert is_divisible_by_9(729)
+    assert is_divisible_by_11(121)
+    assert not is_divisible_by_11(123)
+
+
+def test_recurring_decimal_unit_fraction():
+    assert recurring_decimal_unit_fraction(2) == "0.5"
+    assert recurring_decimal_unit_fraction(3) == "0.(3)"
+    assert recurring_decimal_unit_fraction(19) == "0.(052631578947368421)"
+
+
+def test_osculator_for_ending_9():
+    assert osculator_for_ending_9(19) == 2
+    assert osculator_for_ending_9(29) == 3
+    with pytest.raises(ValueError):
+        osculator_for_ending_9(21)
+
+
+def test_perfect_roots():
+    assert square_root_if_perfect(144) == 12
+    assert square_root_if_perfect(145) is None
+    assert cube_root_if_perfect(15625) == 25
+    assert cube_root_if_perfect(-15625) == -25
+    assert cube_root_if_perfect(15626) is None
+
+
+def test_vedicmaths_alias():
+    from vedicmaths import nikhilam_multiply as alias_nikhilam_multiply
+
+    assert alias_nikhilam_multiply(98, 97) == 9506