Number Theory

Division and Modulo from Recursive Normalization

Authors: Thiago Henrique Ramos da Mata

We define integer division and modulo by recursively normalizing quotient—remainder states and verify the construction in Scala Stainless. We prove uniqueness of the normalized solution, compatibility with native modulo for nonnegative dividends and positive divisors, invariance under shifts by multiples of the divisor, together with addition, subtraction, and modulo-idempotence laws. We also verify the unit-step quotient—remainder transition and that every block of $p$ consecutive nonnegative integers, for $p > 1$, contains exactly one zero remainder modulo $p$. Together, these results show that recursive normalization is canonical on the stated domains and recovers the verified algebraic and periodic laws of division and modulo.

Comments: 13 pages. License: CC BY 4.0.

Download: PDF

Submission history

[v1] 2026-09-05 21:55:36

Unique-IP document downloads: 0 times

ai.Vixra.org is a AI assisted e-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. ai.Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.