This paper introduces a new paradigm for the construction of reversible transforms that map integers to integers. Transform matrices with integer entries are first considered, and the modulo ...

I'm sure FPGA logic designers have often heard it said: “We just need to take this number mod 3.” Or maybe something like, “Just round to the nearest hundred.” This latter case really means: “Take the ...

MOMA is a Rust framework for exploring number theory, cryptography, and bioinformatics through the lens of Moving Origin Modular Arithmetic. The crate is designed for researchers and developers who ...

Recurrent neural networks (RNNs) can implement complex computations by leveraging a range of dynamics, such as oscillations, attractors, and transient trajectories. A growing body of work has ...

Abstract: Measurement-based uncomputation (MBU) is a technique used to perform probabilistic uncomputation of quantum circuits. We formalize this technique for the case of single-qubit registers, and ...

Abstract: We propose a new modulo arithmetic theorem to decompose the base of modulo operations. This new theorem has been used to reduce further the modulo size of the modified CRT (Chinese remainder ...

One of my fellow contributors here recently wrote a post about leap years and why we have them. This reminded me of modular arithmetic and the formula for calculating the day of the week for any date ...