Fermat, Euler, Wilson -- three case studies in number theory
type: Item
instance of: scholarly article
title: Fermat, Euler, Wilson -- three case studies in number theory
zbMATH Open document ID: 1439.68027
author: Christoph Walther
author: Nathan Wasser
published in: Journal of Automated Reasoning
publication date: 2018-04-03T00:00:00Z
Mathematics Subject Classification ID: 68V15
Mathematics Subject Classification ID: 11-03
Mathematics Subject Classification ID: 11A07
Mathematics Subject Classification ID: 68V05
zbMATH DE Number: 6855342
zbMATH Keywords: program verification
zbMATH Keywords: theorem proving by induction
zbMATH Keywords: number theory
describes a project that uses: Isabelle
describes a project that uses: NQTHM
describes a project that uses: VeriFun
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s10817-016-9387-z
OpenAlex ID: W2529619281
cites work: Q3894958
cites work: Proof Checking the RSA Public Key Encryption Algorithm
cites work: Q4550802
cites work: An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem
cites work: On proving the termination of algorithms by machine
cites work: A theorem prover for a computational logic
DOI: 10.1007/S10817-016-9387-Z
description: scientific article; zbMATH DE number 6855342