Author: Yvon Henel, aka Le TeXnicien de surface (contact)
Documentation in French only
This material is subject to the LaTeX Project Public License. See http://www.ctan.org/license/lppl1.3 for the details of that license.
© 2019-2020 Yvon Henel (Le TeXnicien de surface)
Description of the Archive
An article based on the presentation made in Dunkerque for the “stage LaTeX”, 12 June 2019.
The archive contains the pdf file and all the necessary files to produce it. You have to invoke the Makefile with
make all to create the pdf file.
Summary of the Article
- I use Expl3 to solve the well known problem of creating the prime numbers
- I use Expl3 again to implement the Sieve of Eratosthenes
- I finish with an Expl3 implementation of Kaprekar algorithm
You can cast a glance at the glossary to see a list of all the commands used in the code.
Version 1.2 — 2020-03-21
Version 1.1 — 2019-09-24
Version 1 — 2019-08-29
Download the contents of this package in one zip archive (331.1k).
expose-expl3-dunkerque-2019 – Using expl3 to implement some numerical algorithms
An article, in French, based on a presentation made in Dunkerque for the “stage LaTeX” on 12 June 2019.
The articles gives three examples of code in expl3 with (lots of) comments:
- Knuth’s algorithm to create a list of primes,
- the sieve of Eratosthenes,
- Kaprekar sequences.
The package contains the code itself, the documentation as a PDF file, and all the files needed to produce it.
|Licenses||The LaTeX Project Public License 1.3|
|Copyright||2019–2020 Yvon Henel (Le TeXnicien de surface)|
|Contained in||TeX Live as expose-expl3-dunkerque-2019|
MiKTeX as expose-expl3-dunkerque-2019