## 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 »

- Program to calculate Double Integration
- Program for Gauss Siedel Method (Computational Mathematics)
- Count of numbers whose 0th and Nth bits are set
- Digital Logic | Number of Boolean functions
- Rough Set Theory | An Introduction
- Properties of Determinants of Matrices
- Digital Logic | Number of possible Functions
- Rough Set Theory | Properties and Important Terms | Set - 2
- Counting Boolean function with some variables
- Definite Integral | Mathematics
- Subgroup and Order of group | Mathematics
- Program for Picard's iterative method | Computational Mathematics
- Partial Orders and Lattices (Set-2) | Mathematics
- Application of Derivative - Maxima and Minima | Mathematics
- Cayley Table and Cyclic group | Mathematics
- Finite Group in Algebraic Structure
- Gauss's Forward Interpolation

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

The previous two articles introduced two Continuous Distributions: Uniform and Exponential. This article covers the Normal Probability Distribution, also a Continuous distribution, which is by… Read More »

The previous article covered the basics of Probability Distributions and talked about the Uniform Probability Distribution. This article covers the Exponential Probability Distribution which is… Read More »

Prerequisite – Combinatorics Basics, Generalized PnC Set 1, Set 2 Definition : Generating functions are used to represent sequences efficiently by coding the terms of… Read More »