---
title: "#number-theory articles | Hashnode"
description: "Explore 31 articles tagged #number-theory on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/number-theory"
---

Tag

# #number-theory

31 posts · 2 followers

[99 sunny](https://hashnode.com/@sunny99x) · [Sep 22](https://hashnode.com/posts/an-executable-proof-trail-beats-a-spectacular-claim/6ab2f3ab742373d531117f7b)

### [An executable proof trail beats a spectacular claim](https://sunny99.hashnode.dev/an-executable-proof-trail-beats-a-spectacular-claim?utm_source=hashnode&utm_medium=feed)

Epistemic status: Independent clean-room replay of a public Lean 4 artifact (v1.0.0) for a weakened Goldbach-type statement about the Liouville function. I am reporting what rebuilt and what I checked

7 min read · [sunny99.hashnode.dev](https://sunny99.hashnode.dev/an-executable-proof-trail-beats-a-spectacular-claim?utm_source=hashnode&utm_medium=feed)

[Sukalyan Roy](https://hashnode.com/@Suka03) · [Sep 19](https://hashnode.com/posts/the-algorithm-that-grinds-problems-to-dust/6aae494a3d7c8e2ea8da9c3b)

### [The Algorithm That Grinds Problems to Dust](https://sukalyanroy.hashnode.dev/the-algorithm-that-grinds-problems-to-dust?utm_source=hashnode&utm_medium=feed)

In 499 CE, Aryabhata wrote down a step-by-step procedure for solving equations that would take European mathematics another twelve centuries to independently rediscover.

12 min read · [sukalyanroy.hashnode.dev](https://sukalyanroy.hashnode.dev/the-algorithm-that-grinds-problems-to-dust?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/the-algorithm-that-grinds-problems-to-dust/6aae494a3d7c8e2ea8da9c3b)

[Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-located-the-first-30-zeros-of-riemanns-zeta-on-the-critical-line-they-all-sat-exactly-where-1859-said-they-would/6a025d642828387794138fa1)

### [I located the first 30 zeros of Riemann's zeta on the critical line. They all sat exactly where 1859 said they would.](https://forgottentheorieshashnodedev.hashnode.dev/i-located-the-first-30-zeros-of-riemanns-zeta-on-the-critical-line-they-all-sat-exactly-where-1859-said-they-would?utm_source=hashnode&utm_medium=feed)

In November 1859, Bernhard Riemann submitted an eight-page memoir to the Berlin Academy. The paper was about prime numbers. Buried in the middle, almost as an aside, was a sentence that has shaped analytic number theory ever since: it is very likely

6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-located-the-first-30-zeros-of-riemanns-zeta-on-the-critical-line-they-all-sat-exactly-where-1859-said-they-would?utm_source=hashnode&utm_medium=feed)

[Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-counted-every-twin-prime-under-ten-million-hardy-and-littlewoods-1923-guess-landed-within-03/6a025d2e859efcceac079c29)

### [I counted every twin prime under ten million. Hardy and Littlewood's 1923 guess landed within 0.3%.](https://forgottentheorieshashnodedev.hashnode.dev/i-counted-every-twin-prime-under-ten-million-hardy-and-littlewoods-1923-guess-landed-within-03?utm_source=hashnode&utm_medium=feed)

Twin primes are pairs of primes two apart: (3, 5), (5, 7), (11, 13),

6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-counted-every-twin-prime-under-ten-million-hardy-and-littlewoods-1923-guess-landed-within-03?utm_source=hashnode&utm_medium=feed)

[Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-checked-keplers-1611-claim-that-fn1fn-approaches-phi-the-match-is-exact-and-the-convergence-rate-hits-log1phi2-to-six-digits/6a025d3a1a5170458724739a)

### [I checked Kepler's 1611 claim that F\_{n+1}/F\_n approaches phi. The match is exact, and the convergence rate hits log(1/phi^2) to six digits.](https://forgottentheorieshashnodedev.hashnode.dev/i-checked-keplers-1611-claim-that-fn1fn-approaches-phi-the-match-is-exact-and-the-convergence-rate-hits-log1phi2-to-six-digits?utm_source=hashnode&utm_medium=feed)

In a letter written around 1611, Johannes Kepler pointed out something his contemporaries had mostly overlooked. If you write down the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 (each term the sum of the previous two) and form the ratios of c

7 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-checked-keplers-1611-claim-that-fn1fn-approaches-phi-the-match-is-exact-and-the-convergence-rate-hits-log1phi2-to-six-digits?utm_source=hashnode&utm_medium=feed)

[Saptarshi Sarkar](https://hashnode.com/@SaptarshiSarkar) · [Mar 7](https://hashnode.com/posts/maths-for-dsa/69ac548486766ac3a6d2febb)

### [Key Math Concepts in Data Structures and Algorithms](https://saptarshisarkar.hashnode.dev/maths-for-dsa?utm_source=hashnode&utm_medium=feed)

Discover the mathematical foundations of data structures and algorithms—number systems, bitwise logic, primes, modular arithmetic, and more.

17 min read · [saptarshisarkar.hashnode.dev](https://saptarshisarkar.hashnode.dev/maths-for-dsa?utm_source=hashnode&utm_medium=feed)

[Muppidi Srinivas](https://hashnode.com/@srinivas364) · [Feb 16](https://hashnode.com/posts/essential-math-algorithms-for-competiti/69930df5158d96c77393e444)

### [Essential Math Algorithms for Competitive Coding](https://srinivastechblog.hashnode.dev/essential-math-algorithms-for-competiti?utm_source=hashnode&utm_medium=feed)

Binary Exponentiation, Primality Testing, and the Euclidean Algorithm Explained for Efficient Coding.

7 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/essential-math-algorithms-for-competiti?utm_source=hashnode&utm_medium=feed)

[Kofi / Illestpreacha](https://hashnode.com/@illestpreacha) · [Jan 15](https://hashnode.com/posts/genuary2026perfect/69686b5a3bc49b62311e875b)

### [Genuary2026\_Perfect](https://blog.illestpreacha.com/genuary2026perfect?utm_source=hashnode&utm_medium=feed)

Mathematical Perfect

1 min read · [blog.illestpreacha.com](https://blog.illestpreacha.com/genuary2026perfect?utm_source=hashnode&utm_medium=feed)

[Serg G.](https://hashnode.com/@xcont) · [Nov 26, 2025](https://hashnode.com/posts/billiard-fractals-the-infinite-patterns-hidden-in-a-rectangle/69267931f9c53b66ecc7bf96)

### [Billiard Fractals: The Infinite Patterns Hidden in a Rectangle](https://xcont.hashnode.dev/billiard-fractals-the-infinite-patterns-hidden-in-a-rectangle?utm_source=hashnode&utm_medium=feed)

Binary Billiards, Perfect-Shuffle Isomorphisms, and Irrational Discretization

31 min read · [xcont.hashnode.dev](https://xcont.hashnode.dev/billiard-fractals-the-infinite-patterns-hidden-in-a-rectangle?utm_source=hashnode&utm_medium=feed)

[Kaushal Maurya](https://hashnode.com/@KaushalM) · [May 26, 2025](https://hashnode.com/posts/count-primes-unveiling-the-sieve-of-eratosthenes-java/683443900dcac753b9385243)

### [Count Primes - Unveiling the Sieve of Eratosthenes (Java)](https://kaushalm.hashnode.dev/count-primes-unveiling-the-sieve-of-eratosthenes-java?utm_source=hashnode&utm_medium=feed)

Beyond Simple Loops: Efficiently Counting Primes with the Sieve of Eratosthenes (Java) - Leetcode#204 - Medium

4 min read · [kaushalm.hashnode.dev](https://kaushalm.hashnode.dev/count-primes-unveiling-the-sieve-of-eratosthenes-java?utm_source=hashnode&utm_medium=feed)
