https://github.com/mcopes73/FTA

Complete formalization of the Fundamental Theorem of Arithmetic in Coq and Isabelle/HOL.
https://github.com/mcopes73/FTA

Last synced: 3 months ago
JSON representation

Complete formalization of the Fundamental Theorem of Arithmetic in Coq and Isabelle/HOL.

• Host: GitHub
• URL: https://github.com/mcopes73/FTA
• Owner: mcopes73
• Created: 2016-01-25T14:59:13.000Z (almost 9 years ago)
• Default Branch: master
• Last Pushed: 2017-01-24T17:29:51.000Z (almost 8 years ago)
• Last Synced: 2024-02-17T07:34:57.481Z (9 months ago)
• Language: Coq
• Homepage:
• Size: 88.9 KB
• Stars: 8
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Fundamental Theorem of Arithmetic

I propose an algorithm for efficently calculating the prime factorization of a number and fully certified it both in Coq v8.4 and Isabelle/HOL 2015.

In addition, the FTA (Prime factorization is unique up to reordering of factors) is also fully formalized in both proof assistants.

The style of the proof is ment to be educational and therefore does not rely on automatic proof techniques offered by these proof assistants.