## Finding nth term of any Polynomial Sequence

Given a few terms of a sequence, we are often asked to find the expression for the nth term of this sequence. While there is… Read More »

- Program for Gauss Siedel Method (Computational Mathematics)
- Count of numbers whose 0th and Nth bits are set
- Rough Set Theory | An Introduction
- Digital Logic | Number of Boolean functions
- 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
- Subgroup and Order of group | Mathematics
- Definite Integral | Mathematics
- Partial Orders and Lattices (Set-2) | Mathematics
- Program for Picard's iterative method | Computational Mathematics
- Cayley Table and Cyclic group | Mathematics
- Application of Derivative - Maxima and Minima | Mathematics
- Gauss's Forward Interpolation
- Finite Group in Algebraic Structure

Given a few terms of a sequence, we are often asked to find the expression for the nth term of this sequence. While there is… Read More »

Prerequisite : Permutation and Combination Given a polygon of m sides, count number of triangles that can be formed using vertices of polygon. Answer :… Read More »

Prerequisite : Permutation and Combination n students appear in an examination, find the number of ways the result of examination can be announced. Answer is… Read More »

Prerequisite – Binary Tree Data Structure In this article, we will discuss various cases for relationship between number of nodes and height of binary tree.… Read More »

Prerequisite – Introduction of Set theory, Set Operations (Set theory) For a given set S, Power set P(S) or 2^S represents the set containing all… Read More »

In this article, we are discussing how to find number of functions from one set to another. For understanding the basics of functions, you can… Read More »

A graph is a data structure that is defined by two components : A node or a vertex. An edge E or ordered pair is… Read More »

Prerequisite – Relational Model Introduction and Codd Rules Any subset of attributes of a table that can uniquely identify all the tuples of that table… Read More »

A set of operations is said to be functionally complete or universal if and only if every switching function can be expressed by means of… Read More »

Problem 1 – There are 25 telephones in Geeksland. Is it possible to connect them with wires so that each telephone is connected with exactly… Read More »

In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths. For every pair of vertices in a connected… Read More »

Switching algebra is also known as Boolean Algebra. It is used to analyze digital gates and circuits It is logic to perform mathematical operation on… Read More »

Prerequisite – Random Variable In probability theory and statistics, a probability distribution is a mathematical function that can be thought of as providing the probabilities… Read More »

In numerical analysis and linear algebra, LU decomposition (where ‘LU’ stands for ‘lower upper’, and also called LU factorization) factors a matrix as the product… Read More »

A Boolean function is described by an algebraic expression consisting of binary variables, the constants 0 and 1, and the logic operation symbols For a… Read More »