Articles — Recent
Papers, presentations, reports and more, written in LaTeX and published by our community. Search or browse below.
![Riemann's Rearrangement Theorem](https://writelatex.s3.amazonaws.com/published_ver/3859.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=2fa6f04f4965996c43291e114ab19b0a20b4653a2153ec1060784b52839b6274)
Riemann's Rearrangement Theorem
"(Infinite) series are the invention of the devil, by using them, on
may draw any conclusion he pleases, and that is why these series
have produced so many fallacies and so many paradoxes."
-Neils Hendrik Abel
Courtney Ticer
![Newton's Method Cycles](https://writelatex.s3.amazonaws.com/published_ver/3875.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=130f61541a43f077d5e763fec53fe1f2b9523209576ce8e8d3e4709ee9fc2d17)
Newton's Method Cycles
Based on the paper Sometimes Newton's Method Cycles, we first asked ourselves if there were any Newtonian Method Cycle functions which have non-trivial guesses. We encountered a way to create functions that cycle between a set number of points with any initial, non-trivial guesses when Newton's Method is applied. We exercised these possibilities through the methods of 2-cycles, 3-cycles and 4-cycles. We then generalized these cycles into k-cycles. After generalizing Newton's Method, we found the conditions that skew the cycles into a spiral pattern which will either converge, diverge or become a near-cycle. Once we obtained all this information, we explored additional questions that rose up from our initial exploration of Newton's Method.
Edgara Vanoye & MacKay Martin
![Aadhithya Dinesh's Resume](https://writelatex.s3.amazonaws.com/published_ver/12196.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=f5b3afecb59f0812116d9b73be5c6006c7b0f909efa42ef82d45c1b7b60af3bb)
Aadhithya Dinesh's Resume
Aadhithya Dinesh's Resume
Aadhithya Dinesh
![Presentation for Conference (IMS 2012 example)](https://writelatex.s3.amazonaws.com/published_ver/4424.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=0693a219dd3f06eea84e54dd47b240dacb2e5fcf889601a23cbf74ee0c61cb7a)
Presentation for Conference (IMS 2012 example)
With Overleaf, edit online instantly this conference presentation (IMS 2012 example) and download a PDF version.
This project is also available on my web site
Tibault Reveyrand
![Presentation (CU-Boulder example)](https://writelatex.s3.amazonaws.com/published_ver/4423.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=5761d38f4cb494e51a21c3bcb745191fa653dcd98975f2019074c1c233c6696c)
Presentation (CU-Boulder example)
With Overleaf, edit online instantly this presentation (Internal talk at CU-Boulder) and download a PDF version.
This project is also available on my web site
Tibault Reveyrand
![Rapport pour TIPE 2017](https://writelatex.s3.amazonaws.com/published_ver/4417.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=644a821ebfa3a6e7a9eb027734bc84b6f835075dd2f65b31f455b9e198e980e5)
Rapport pour TIPE 2017
Exemple de rapport pour les TIPE (Travaux d'Initiative Personnelle Encadrés) pour les concours d'entrée aux écoles d'ingénieurs à partir de la session 2017.
Il y a surtout des exemples sur les différentes manières de composer des équations ainsi que comment introduire des portions de code Python pour illustrer son propos.
NB: le script TeXcount pourra vous être utile car il permet de compter les mots utilisés dans chaque section d'un document LaTeX. Vous en trouverez une version en ligne à l'adresse
http://app.uio.no/ifi/texcount/online.php
Il suffit d'y copier l'ensemble du document (via Ctrl-A/Ctrl-C puis Ctrl-V dans la fenêtre idoine) pour obtenir le récapitulatif tout en bas de la page qui s'ouvre alors.
(You can also get the word count in Overleaf by clicking on "Word Count" at the top of the file list panel.)
Jean-Julien Fleck
![Parth Kapadia's Résumé](https://writelatex.s3.amazonaws.com/published_ver/5425.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=766550f1eaf39704d5a0f863d5d1290008d3dcf31a268f55e5d1eb6b94c680d1)
Parth Kapadia's Résumé
Parth Kapadia's Résumé
Parth Kapadia
![Devansh Soni's CV](https://writelatex.s3.amazonaws.com/published_ver/13455.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=4e8c935f185a2709fd3cf9fa8576fd8a557acb7e299b0eb827de700f208f2f01)
Devansh Soni's CV
Devansh Soni's CV
Devansh Soni
![Riemann Rearrangement Thoerem and Proof](https://writelatex.s3.amazonaws.com/published_ver/6426.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240702T112539Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240702/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=81c8f56c9af3a67d131444fcdf3a6a113e0c101afc9c7ec2cb1ae989b1425639)
Riemann Rearrangement Thoerem and Proof
A simple proof of Riemann's Rearrangement Theorem. Also called Riemann's series theorem.
David Klapheck