**Proof by Method of Induction: **This is one of the methods of proof that is usually used to prove a theory with series of numbers. The main concept and working steps are described with example.** Please see this video.**

**Modulo Operation: **Modulo Operation is a basic calculation technique in the number theory. Modulo, MOD in short form, is used as an operator or a function. The concept and applications are described with example.** Please see this video.**

**Affine Cipher Code Data Encryption Example: **Affine Ciphering is one of the methods for Data Encryption. This method is stronger than Caesar Cipher Code. The method of encryption and decryption is described with example.** Please see this video.**

**Caesar Cipher Code Data Encryption Example: **Caesar Ciphering is one of the methods for Data Encryption. The method is named on Roman Emperor Julius Caesar of around 100 years BC. This interesting idea is described with example.** Please see this video.**

**Sum of infinite series with 1’s:** Adding some whole numbers is fun, right? What about only 1’s? If the 1’s are plus and minus alternatively, it will be more fun. It will be exciting when the 1’s are unlimited with alternate signs. **Please see this video.**

**Pascal’s Triangle 1st:** Pascal’s Triangle is a triangle of calculated numbers. There is a pattern of calculations. And, off course there are connections with Mathematics, such as Combination formula and Binomial Theorem. **Please see this 1st video.**

**Pascal’s Triangle 2nd:** Numbers in Pascal’s Triangle are the coefficients of Binomial expansions. There is a pattern in these coefficients in Binomial Theorem. **Please see the 2nd video.**

### Like this:

Like Loading...