Elementary number theory problems. XII: Primes in arithmetic progression

DOI10.2478/FORMA-2023-0022MaRDI QIDQ6557124zbMATH OpenFDO

Authors Adam Grabowski

Publication date 18 June 2024

Published in Formalized Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.2478/FORMA-2023-0022

zbMATH Keywords

arithmetic progressionnumber theoryprimes

Mathematics Subject Classification ID

Primes (11A41) Arithmetic progressions (11B25) Formalization of mathematics in connection with theorem provers (68V20)

Recommendations

• Elementary number theory problems. VI
• Elementary number theory problems. V
• Elementary number theory problems. IX
• Elementary number theory problems. XI

Cites work

• Dataset description: formalization of elementary number theory in Mizar
• Elementary number theory problems. V
• Elementary number theory problems. VI
• Extending numeric automation for number theory formalizations in Mizar
• Fermat's little theorem via divisibility of Newton's binomial
• Flexary connectives in Mizar
• scientific article; zbMATH DE number 5903191 (Why is no real title available?)
• scientific article; zbMATH DE number 5850143 (Why is no real title available?)
• scientific article; zbMATH DE number 3335201 (Why is no real title available?)
• scientific article; zbMATH DE number 3197229 (Why is no real title available?)
• Mathematical Knowledge Management
• On a remark of Sierpiński
• Polygonal numbers
• Proth numbers

Cited in

(4)

• Elementary number theory problems. VI
• Elementary number theory problems. XIII
• Pascal's triangle and Lucas's theorem
• Elementary number theory problems. Part XIV: Diophantine equations

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)