Dictate Wizard is an open source dictation tool powered by OpenAI's Whisper. The goal is to obsolete as much typing as possible and let you speak your emails, instant messages etc instead.

Jacobian: an MCP server, CLI, and Python library that gives AI agents a composable toolbox of mathematical capabilities with inspectable artifacts and independent verification.

Chebyshev polynomials of the first kind and primality testing

Given initial terms of an unknown generating function F, conjecture a functional equation that F satisfies.

A python program to run the Collatz algorithm

A calculator to test numbers against the collatz conjecture

Keçeci Numbers, Keçeci Sayıları, kececinumbers, Keçeci Conjecture

Completed exercisms on exercism.io

Various code related to the problem of cycle (circuit) double covers

Calculate the number of steps before a given input reaches one, when the rules of Collatz Conjecture are applied.

Tests the, still open, Ruskey-Savage Conjecture (1993) for small values of n. Searches for Hamiltonian cycle with constraints. (Final project for Non-procedural programming course.)

Create colorful background images utilizing the Collatz conjecture

Nine-paper series introducing Constitutional Forcing — a mechanism by which algebraic structure uniquely determines governing constants across prime arithmetic, information theory, and fluid dynamics. θₖ = (2ᵏ − k)/2ᵏ. Khayyam Wakil, ARC Institute of Knowware, 2026.

Collatz Conjecture implementation in various languages and or environments.

A python program that automatically produces mathematical conjectures in the field of graph theory.

A verified counterexample to Written on the Wall II Conjecture 85 GPT 5.6 Pro found, with a complete proof, LaTeX/PDF write-up, and exhaustive Python checker.

Complete reproducible working-proof chain and exact verification materials for Dittert’s conjecture (all dimensions; under review)

Optimized Cycle finder for Collatz Conjecture generalization (qx+c)

A finite algebraic covering system for the Erdos-Straus conjecture, verified to 10^11 (max A = 359); exploratory search to 1.2x10^12 finds A = 479. Gateway decompositions via divisors of N^2.