High-performance C++17 framework for computational proofs of Euler’s theorems in number theory, complex analysis, and topology.
-
Updated
Sep 12, 2025 - C++
High-performance C++17 framework for computational proofs of Euler’s theorems in number theory, complex analysis, and topology.
This repository contains the problem sets completed as part of a discrete math course.
A teenager's independent rediscovery of classical number theory theorems (2002-2007). Complete diary, analysis, and reflections.
A playground for Coq/Rocq proofs and ideas.
Add a description, image, and links to the mathematical-proofs topic page so that developers can more easily learn about it.
To associate your repository with the mathematical-proofs topic, visit your repo's landing page and select "manage topics."