Posts Tagged ‘value’
Thursday, October 8th, 2009
Subsets in Set Theory
Description
A detailed tutorial on how to identify subsets of a set. Step by step tutorial including several examples of how to find subsets in a set for reference.
Overview
Each set in set theory has a certain amount of subsets. There is an easy way figure out how many subsets a set has. Pretend that every element of a set is 2, and multiply them together. This will be your number of subsets. For example, if you have three elements, you will have 8 subsets, because 2 cubed (which is 2 to the power of 3, or 2 times 2 times 2) is equal to 8. Now that you have determined how many subsets there are, you have to figure out what they are. A subset is defined as any set containing all or part of a set. Two subsets are going to be the set itself, and an empty set. Sometimes they are your only subsets. Now, following the definition, a subset must be all possible sets. This means, sets of one element - one for each element in your set. In addition to that, you may have sets of two elements – one for each possible combination of elements in your set. This should be continued until you have reached the maximum number of elements in the set you atarted out with.
Tags: combination, discrete math, element, empty set, exponent, Math, multiplication, number, set, set theory, subset, to the power, value
Posted in Discrete Math | No Comments »
Tuesday, October 6th, 2009
Fourier Transforms Explained
Description
A detailed tutorial on Fourier transforms. Step by step tutorial including several examples of Fourier transforms for reference.
Overview
A Fourier transform is an operation that transforms one complex-valued function of a real variable into another. The domain of the original function is typically referred to as the time domain, because it is a representation of time. The domain of the new function represetns frequency. The Fourier transform itself is often called the frequency domain representation of the original function because of this.
Tags: complex, differential equations, domain, Fourier, frequency, function, Math, Physics, real, Science, time, tranform, value, variable
Posted in Differential Equations | No Comments »
Tuesday, October 6th, 2009
How to Solve a Dirichlet Problem
Description
A detailed tutorial of solving Dirichlet problems. Step by step tutorial including several examples of how to solve Dirichlet problems for reference.
Overview
A Dirichlet problem is a problem of finding a function which solves a specified partial differential equation in the interior of a given region that takes prescribed values on the boundary of the region. It was originally supposed to be used for Laplace’s equation, although other equations can use it as well. The Dirichlet problem can be stated as: given a function f that has values everywhere on the boundary of a region in R^n, is there a unique continuous function u twice continuously differentiable in the interior and continuous on the boundary, such that u is harmonic in the interior and u = f on the boundary? A mathematical solution can be expressed as:
Tags: bounded, continuous, differential equations, Dirichlet, equation, harmonic, interior, Laplace, Math, partial differential equation, problem, region, solution, value
Posted in Differential Equations | No Comments »
Friday, October 2nd, 2009
Disjoint Sets in Set Theory
Description
A detailed tutorial on disjoint sets. Step by step tutorial including several examples of disjoint sets and how to identify disjoint sets for reference.
Overview
A disjoint set is a term applied in set theory when two or more sets have no elements in common. For example, the sets {1, 2, 3} and {7, 8, 9} are disjoint sets because none of the numbers in the sets are the same. The formal way to say this is that two sets are disjoint sets if their intersection creates an empty set, in other words, nothing at all. An intersection is when you only take the values that are found in both sets. If none of the values are the same, this would be an empty set. Disjoint sets can be classified into further categories of piecewise, pairwise, or mutually disjoint provided that in a collection, at least two sets are disjoint.
Tags: collection, discrete math, disjoint, elements, empty set, intersection, Math, mutually, pairwise, piecewise, set theory, sets, value
Posted in Discrete Math | No Comments »
Friday, October 2nd, 2009
Overview of Polynomial Long Division
Description
A detailed tutorial on polynomial long division. Step by step tutorial including several examples of polynomial long division for reference.
Overview
Polynomial long division is a mix of regular long division and rules of polynomials – it looks confusing at first, but isn’t too difficult to follow. Polynomial long division is actually a type of algorithm. It is only used when dividing a polynomial by another polynomial of either the same or a lower degree. The “degree” of a polynomial is the highest power in the polynomial, and the terms in the polynomial should be ordered from highest degree to lowest degree. When using polynomial long division, you must write out all coefficients and terms, even “invisible” ones – ones that have a coefficient of zero and so are typically not written in the polynomial. Polynomial long division is solved the same way as regular long division
Tags: algebra, algorithm, coefficient, degree, division, long division, Math, polynomial, polynomial long division, synthetic division, term, value, zero
Posted in Algebra | No Comments »
Thursday, October 1st, 2009
Definition of an Abscissa
Description
A detailed tutorial of the definition of an abscissa. Step by step tutorial including several examples of the definition of an abscissa for reference.
Overview
An abscissa is not a term commonly heard in math, but it is something that most of us are familar with. An abscissa is the first number or element in an ordered pair – pair implying that there are only two values. A well known example is a Cartesian coordinate (x, y). “x” is the abscissa in this case.
Tags: abscissa, cartesian, coordinate, element, First, Geometry, graph, Math, number, ordered, pair, term, value, x
Posted in Geometry | No Comments »
Thursday, October 1st, 2009
Boundedness Theorem Explained
Description
A detailed tutorial of the boundedness theorem. Step by step tutorial including an explanation of the boundedness theorem for reference. Knowledge of the boundedness theorem is required in calculus.
Overview
The boundedness theorem is a theorem that is very closely linked to the extreme value theorem. The boundedness theorem states that a continuous function f in the closed interval [a, b] is bounded on that interval. In mathematical terms, this means that there exist real numbers m and M such that
This translates to mean “m is less than or equal to f(x) which is less than or equal to M for all x belonging to [a, b]“.
Tags: a, b, bounded, boundedness theorem, c, Calculus, closed, continuous, d, EVT, extreme value theorem, f(c), f(d), f(x), function, graph, local, m, Math, maxima, maximum, minima, minumum, value, x
Posted in Calculus | No Comments »
Thursday, October 1st, 2009
Extreme Value Theorem Explained
Description
A detailed tutorial of the extreme value theorem. Step by step tutorial including an explanation of the extreme value theorem for reference. Knowledge of the extreme value theorem is required in calculus.
Overview
The extreme value theorem states that if a real valued function f is continuous in the closed and bounded interval [a, b], then f must attain its maximum and minimum value at least once. In mathematical terms, this means that there exist numbers c and d in [a, b] such that
The translation of that formula is “f(c) is greater than or equal to f(x) which is greater than or equal to f(d), for all x belonging to [a, b]“. In order for something to belong to an interval, it must be found in the interval.
Tags: a, b, bounded, c, Calculus, closed, continuous, d, EVT, extreme value theorem, f(c), f(d), f(x), function, graph, local, Math, maxima, maximum, minima, minumum, value, x
Posted in Calculus | No Comments »
Tuesday, September 29th, 2009
Introduction to Magnitude
Description
A detailed tutorial of how to solve for magnitude. Step by step tutorial including several examples of how to solve for magnitude for reference.
Overview
The magnitude refers to size – in mathematical concepts, what is larger? What has a greater value or quantity? This is what you look for when arranging things in order of magnitude. Several different measurements are considered to be types of magnitude – examples are volume, area, and length. Things that can be ordered by magnitude are fractions, line segments, planes, solids, and angles. Magnitude is considered to be measured only in positive, not in negative – not to say that the absolute value is taken, just that negative numbers are not included.
Tags: angles, area, arithmetic, fractions, greater, length, line segments, magnitude, Math, measurement, planes, positive, solids, value, volume
Posted in Arithmetic | No Comments »
Thursday, September 24th, 2009
How to Solve the Maclaurin Series
Description
A detailed tutorial on the solving of a Maclaurin series. Step by step tutorial including several examples of how to solve a Maclaurin series for reference.
Overview
A Maclaurin series is a Taylor series that is centered at zero instead of one of the other numbers. A Taylor series is a representation of a function as an infinite sum calculated from the values of its derivatives at a single point. A Maclaurin series can be expressed like this:
The only difference is that a Maclaurin series will be centered at the point zero. Many Maclaurin series, specifically e to the x, can easily be memorized so solving by a chart would not be necessary.
Tags: Calculus, chart, derivatives, factorial, function, infinite sum, Maclaurin series, Math, point, Taylor series, value, zero
Posted in Calculus | No Comments »