Passer au contenu principal
Tangente
Subscribe

All articles

Dive into the fascinating world of mathematics with our captivating articles, written by passionate experts. Whether you are a curious amateur or a seasoned mathematician, our articles cover a wide range of topics, from fundamental concepts to the latest discoveries, including practical applications and philosophical reflections.

Markov algorithm: rewriting and universal computation | Tangente
Math for everyone

Markov algorithm: rewriting and universal computation | Tangente

Mar 16, 2026
Kruskal's algorithm: minimum spanning tree | Tangente
Math for everyone

Kruskal's algorithm: minimum spanning tree | Tangente

Mar 16, 2026
Gallows method: calculating square roots by hand | Tangente
History and Culture

Gallows method: calculating square roots by hand | Tangente

Mar 16, 2026
Karatsuba algorithm: fast multiplication | Tangente
Math for everyone

Karatsuba algorithm: fast multiplication | Tangente

Mar 16, 2026
Kaprekar's algorithm and the 6174 constant | Tangente
Games and Challenges

Kaprekar's algorithm and the 6174 constant | Tangente

Mar 16, 2026
Gram–Schmidt algorithm: orthogonalization | Tangente
Math for everyone

Gram–Schmidt algorithm: orthogonalization | Tangente

Mar 16, 2026
Ford algorithm: shortest paths, negative arcs | Tangente
Math for everyone

Ford algorithm: shortest paths, negative arcs | Tangente

Mar 16, 2026
Ford-Fulkerson algorithm: maximum flow | Tangente
Math for everyone

Ford-Fulkerson algorithm: maximum flow | Tangente

Mar 16, 2026
Floyd's algorithm: all-pairs shortest paths | Tangente
Math for everyone

Floyd's algorithm: all-pairs shortest paths | Tangente

Mar 16, 2026
Fibonacci–Sylvester: Egyptian fractions | Tangente
Math for everyone

Fibonacci–Sylvester: Egyptian fractions | Tangente

Mar 16, 2026
Dantzig algorithm: the simplex method | Tangente
Math for everyone

Dantzig algorithm: the simplex method | Tangente

Mar 16, 2026
Graph coloring algorithm explained | Tangente
Games and Challenges

Graph coloring algorithm explained | Tangente

Mar 16, 2026
Chudnovsky algorithm: π digit records | Tangente
History and Culture

Chudnovsky algorithm: π digit records | Tangente

Mar 16, 2026
Borwein algorithm: convergence to π | Tangente
Math for everyone

Borwein algorithm: convergence to π | Tangente

Mar 16, 2026
Brent–Salamin algorithm: calculating π by doubling the number of correct decimal places | Tangente
Math for everyone

Brent–Salamin algorithm: calculating π by doubling the number of correct decimal places | Tangente

Mar 16, 2026
Bombelli's algorithm: continued fractions | Tangente
Math for everyone

Bombelli's algorithm: continued fractions | Tangente

Mar 16, 2026
Bellman–Ford algorithm: shortest path | Tangente
Math for everyone

Bellman–Ford algorithm: shortest path | Tangente

Mar 16, 2026
Babylonian algorithm: square-root approximation | Tangente
Math for everyone

Babylonian algorithm: square-root approximation | Tangente

Mar 16, 2026
Adleman–Huang algorithm: discrete logarithm | Tangente
Math for everyone

Adleman–Huang algorithm: discrete logarithm | Tangente

Mar 16, 2026
Extended Euclidean algorithm and Bézout's identity | Tangente
Math for everyone

Extended Euclidean algorithm and Bézout's identity | Tangente

Mar 16, 2026