# Category Archives: Engineering Mathematics

Problem-1:Set G = { 1, ω, ω2 } i.e., three roots of unity and form a finite abelian group with respect to multiplication, also prove… Read More
Let G be a non-empty set, then a one-one onto mapping to itself that is as shown below is called a permutation.   The number of… Read More
Introduction : Suppose an event can occur several times within a given unit of time. When the total number of occurrences of the event is… Read More
Let we have a running stream of numbers as x1,x2,x3,…,xn. The formula for calculating mean and variance at any given point is given as : … Read More
A question arises that is there any root possible for z if sin (z) = 2. First answer which comes to mind that no such… Read More
Problem-: Prove that ( I, + ) is an abelian group. i.e. The set of all integers I form an abelian group with respect to… Read More
Introduction : Suppose an event can occur several times within a given unit of time. When the total number of occurrences of the event is… Read More
In this article, we will discuss Types of Sets in Discrete Structure or Discrete Mathematics. Also, we will cover the examples. Let’s discuss one by… Read More
Let’s first know some basics about numbers used  in floating-point arithmetic or in other words Numerical analysis and how they are calculated. Basically, all the… Read More
Prerequisite – Permutation and Combination, Permutations | Set 1 Formula’s Used : P(n, r) = n! / (n-r)! Example-1 : How many words can be… Read More
Z-test is a statistical method to determine whether the distribution of the test statistics can be approximated by a normal distribution. It is the method… Read More
Levene’s test is used to assess the equality of variance between two different samples. For every case, it calculates the absolute difference between the value… Read More
In the previous article, we discussed hypothesis testing which is the backbone of inferential statistics. We previously discussed the basic hypothesis testing including Null and… Read More
A recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given; each… Read More
Prerequisite – Permutation and Combination Formula’s Used : 1. P(n, r) = n! / (n-r)! 2. P(n, n) = n! Example-1 : How many 4-letter… Read More