Welcome to Keçeci Numbers’s Documentation!
Keçeci Numbers is a Python library for generating, analyzing, and visualizing dynamic sequences inspired by the Collatz Conjecture across diverse number systems.
This library provides a unified algorithm that operates on 16 different number types, from standard integers to complex algebraic structures like quaternions and neutrosophic numbers. It is designed as a tool for academic research and exploration in number theory.
Getting Started
User Guide
API Reference
What are Keçeci Numbers?
Keçeci Numbers are sequences generated from a specific starting value using a recursive rule. The process for each step is as follows:
Add: An increment value is added to the current value. This “added value” is recorded in the sequence.
Divide: An attempt is made to divide this “added value” by 3 or 2 (whichever was not used in the previous step).
ASK (Augment/Shrink then Check) Rule: If the number is indivisible and prime, a type-specific unit value is added or subtracted. This “modified value” is recorded, and the division is re-attempted.
Carry Over: If division fails, the number itself (either the “added value” or “modified value”) becomes the next element in the sequence.
Key Features
20 Different Number Types: Supports integers, rationals, complex numbers, quaternions, neutrosophic numbers, and more.
Unified Generator: Uses a single, consistent
unified_generatoralgorithm for all number types.Advanced Visualization: Provides a multi-dimensional
plot_numbersfunction tailored to the nature of each number system.Keçeci Prime Number (KPN) Analysis: Identifies the most recurring prime representation in sequences to analyze their convergence behavior.
Interactive and Programmatic Usage: Allows for both interactive parameter input (
get_interactive) and direct use in scripts (get_with_params).