Community articles — Math

Primeiras questões respondidas do banco de Cálculo 1 da UFAL.

Template: (c) 2010 Association for Computing Machinery (ACM) For tracking purposes => this is v1.3 - March 2012

This paper will state and prove the quadratic formula.

It's easy to find out how many combinations you can have if you know the total number of items, and the number of items you are combining. It's a little harder to do that in reverse. This document shows how to find the total number of items if you know how many are combined at a time, and the total number of combinations.

Modern Algebra HW

"(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

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.)

A simple proof of Riemann's Rearrangement Theorem. Also called Riemann's series theorem.

Prove the circular convolution property of Discrete Fourier Transform (DFT) Use ebgaramond package