## Discrete Mathematics | Types of Recurrence Relations – Set 2

Prerequisite – Solving Recurrences, Different types of recurrence relations and their solutions, Practice Set for Recurrence Relations The sequence which is defined by indicating a… Read More »

## Inclusion-Exclusion and its various Applications

In the field of Combinatorics, it is a counting method used to compute the cardinality of the union set. According to basic Inclusion-Exclusion principle: For… Read More »

## Mathematics | Indefinite Integrals

Antiderivative – Definition :A function ∅(x) is called the antiderivative (or an integral) of a function f(x) of ∅(x)’ = f(x). Example : x4/4 is… Read More »

## Mathematics | Some theorems on Nested Quantifiers

Prerequisite – Predicates and Quantifiers – Set 1, Set 2 Quantifiers are expressions that indicate the scope of the term to which they are attached,… Read More »

## Corollaries of Binomial Theorem

The expression denotes times. This can be evaluated as the sum of the terms involving for k = 0 to n, where the first term… Read More »

## Newton’s Divided Difference Interpolation Formula

Interpolation is an estimation of a value within two known values in a sequence of values. Newton’s divided difference interpolation formula is a interpolation technique… Read More »

## Digital Logic | Implicants in K-Map

Prerequisite – K – Map (Karnaugh Map) Implicant is a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS)… Read More »

## Cauchy’s Mean Value Theorem

Suppose f(x) and g(x) are 2 functions satisfying three conditions: 1) f(x), g(x) are continuous in the closed interval a <= x <= b 2)… Read More »

## Activation Functions

To put in simple terms, an artificial neuron calculates the ‘weighted sum’ of its inputs and adds a bias, as shown in the figure below… Read More »

## Number of possible Equivalence Relations on a finite set

An equivalence relation is Reflexive, Symmetric and Transitive. Before counting the number of possible equivalence relations on a set |A|=n, let us see an example… Read More »

## Different Operations on Matrices

For introduction on matrices, you can refer the following article: Matrix Introduction In this article, we will discuss various operations on matrices and their properties:… Read More »

## Digital Logic | Consensus theorem

Prerequisite – Properties of Boolean algebra, Minimization of Boolean Functions Redundancy theorem is used as a Boolean algebra trick in Digital Electronics. It is also… Read More »

## Mathematics | Probability Distributions Set 5 (Poisson Distribution)

The previous article covered the Binomial Distribution. This article talks about another Discrete Probability Distribution, the Poisson Distribution. Introduction – Suppose an event can occur… Read More »

## Mathematics | Unimodal functions and Bimodal functions

Unimodal Function : A function f(x) is said to be unimodal function if for some value m it is monotonically increasing for x≤m and monotonically… Read More »

## Mathematics | Probability Distributions Set 4 (Binomial Distribution)

The previous articles talked about some of the Continuous Probability Distributions. This article covers one of the distributions which are not continuous but discrete, namely… Read More »