Tag archive
Integers modulo N form a ring, an algebraic structure that determines which algorithms apply. Understanding this structure unlocks algorithms from cryptography to competitive programming.
I pointed Claude Code at the Erdős problem database with vague instructions to 'find interesting things.' It built 92 Python modules, ran 131 subagents, and computed exact Ramsey numbers nobody had computed before. I mostly watched.
Rational numbers give exact arithmetic where floating-point fails. The implementation connects GCD, the Stern-Brocot tree, and the algebraic structure of fields.
The Miller-Rabin primality test demonstrates how probabilistic algorithms achieve arbitrary certainty, trading absolute truth for practical efficiency.
Today, as I was tackling some LeetCode problems (easy ones, of course :D), I stumbled upon an...
A Lychrel number is a natural number that cannot form a palindrome through the iterative process of...
There’s something about this special sub-set in the integers set known as prime numbers, unyielding...
The topic included in this article is very important. It can be used in many types of questions, so...
A number is said to be prime if it is divisible by a number other than 1 and itself. 1 is not consid...