Elementary number theory problems. XII: Primes in arithmetic progression
From MaRDI portal
Publication:6557124
DOI10.2478/FORMA-2023-0022zbMATH Open1540.68286MaRDI QIDQ6557124FDOQ6557124
Authors: Adam Grabowski
Publication date: 18 June 2024
Published in: Formalized Mathematics (Search for Journal in Brave)
Recommendations
Arithmetic progressions (11B25) Formalization of mathematics in connection with theorem provers (68V20) Primes (11A41)
Cites Work
- Title not available (Why is that?)
- Flexary connectives in Mizar
- Mathematical Knowledge Management
- Title not available (Why is that?)
- Polygonal numbers
- Title not available (Why is that?)
- Proth numbers
- Fermat's little theorem via divisibility of Newton's binomial
- Title not available (Why is that?)
- On a remark of Sierpiński
- Dataset description: formalization of elementary number theory in Mizar
- Extending numeric automation for number theory formalizations in Mizar
- Elementary number theory problems. V
- Elementary number theory problems. VI
Cited In (2)
This page was built for publication: Elementary number theory problems. XII: Primes in arithmetic progression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6557124)