最近的
Template: (c) 2010 Association for Computing Machinery (ACM) For tracking purposes => this is v1.3 - March 2012
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.
A template for submitting written assignments in LaTex.
Modern Algebra HW
Template for Math 351
Template for mathematics *group* homework assignments.
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
Discrete maths for students of mathfac hse 19-23