Все публикации

Fundamental Theorem of Arithmetic - Proof | Unique Prime Factorization

Randomized Algorithm | Success Probability Amplification | RP & BPP complexity classes

Counting Number of Increasing Functions | Number of Non-Decreasing functions

Counting number of Strictly Increasing Functions

Increasing Function | Strictly Increasing Function | Example and Non-Example

Probability of at least 4 consecutive heads occurring | 10 coin tosses | Exercise 1.1 (d)

Pigeonhole principle Application : Property of an (n+1) size subset of [2n]

Probability & Computing Problem solving series | Mitzenmacher & Upfal | Exercise 1.1 (c)

Number of ways of Distributing 'n' Identical objects into 'm' Distinct containers | Combinatorics

Probability & Computing Problem Solving series | Exercise 1.1 (b) | Mitzenmacher & Upfal

Probability & Computing Problem Solving Series | Mitzenmacher & Upfal | Exercise 1.1 a | Let's solve

Existence Proof : Constructive & Non-Constructive | Explained with Examples

Number of Handshakes between 'n' people : Formula | Handshake Problem | Two Methods of Counting

0.999... = 1 Here is the proof !

Combinatorial Proof : C(2n,2) = 2*C(n,2) + n^2 | Combinatorial Proofs-3

0.9 bar = 1 | 0.999..(infinite 9s) = 1 | PROOF

Combinatorial Proof : part 2 | Why k * C(n, k) = n * C(n-1, k-1) ?

What is Combinatorial Proof ? Why C(n, r) = C(n, n-r) ? : a Combinatorial proof | Part - 1

Application of Pigeon Hole Principle : Problem 1 | Combinatorics

Well Ordered Set : Explained with Examples | Well Ordering Relation

Totally Ordered Set : Explained with Examples | Total Order Relation

Partially Ordered Set : Explained with Examples | Partial Ordering Relation

Number of Symmetric Relations on a set with 'n' elements | Detailed Explanation

Surprise Test Paradox | An Episode in the Life of a Student