Difference between revisions of "AoPS Wiki:Article of the Day/Archive"
(aotd) |
m (→Canada/USA MathCamp) |
||
(13 intermediate revisions by one other user not shown) | |||
Line 1: | Line 1: | ||
− | ==1/7/ | + | ==2/3/08 - 2/29/08== |
+ | AotD will be back in March as Article of the Week! | ||
+ | ==2/2/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Law of Tangents=== | ||
+ | The '''Law of Tangents''' is a useful [[trigonometric identity]] that, along with the [[law of sines]] and [[law of cosines]], can be used to determine [[angle]]s in a triangle. Note that the law of tangents usually cannot determine sides, since only angles are involved in its statement.... [[Law of Tangents|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==2/1/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Law of Sines=== | ||
+ | The '''Law of Sines''' is a useful identity in a [[triangle]], which, along with the [[law of cosines]] and the [[law of tangents]] can be used to determine sides and angles. The law of sines can also be used to determine the [[circumradius]], another useful function... [[Law of Sines|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/31/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Law of Cosines=== | ||
+ | {{WotWAlso}} | ||
+ | The '''Law of Cosines''' is a theorem which relates the side-[[length]]s and [[angle]]s of a [[triangle]]. It can be derived in several different ways, the most common of which are listed in the "proofs" section ... [[Law of Cosines|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/30/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Euler's totient function=== | ||
+ | '''Euler's totient function''' <math>\phi(n)</math> applied to a [[positive integer]] <math>n</math> is defined to be the number of positive integers less than or equal to <math>n</math> that are [[relatively prime]] to <math>n</math>. <math>\phi(n)</math> is read "phi of n."... [[Euler's totient function|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/29/08== | ||
+ | There was no AotD for January 1st, 2008. | ||
+ | ==1/28/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Expected value=== | ||
+ | {{WotWAlso}} | ||
+ | Given an event with a variety of different possible outcomes, the '''expected value''' is what one should expect to be the average outcome if the event were to be repeated many times. Note that this is ''not'' the same as the "most likely outcome." | ||
+ | |||
+ | More formally, we can define expected value as follows: if we have an event <math>Z</math> whose outcomes have a [[discrete]] [[probability]] distribution, the... [[Expected value|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/27/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Introductory modular arithmetic=== | ||
+ | '''[[Modular arithmetic]]''' is a special type of arithmetic that involves only [[integers]]. This goal of this article is to explain the basics of modular arithmetic while presenting a progression of more difficult and more interesting problems that are easily solved using... [[Modular arithmetic/Introduction|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/26/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Rational approximation of famous numbers=== | ||
+ | '''Rational approximation''' is the application of [[Rational approximation|Dirichlet's theorem]] which shows that, for each irrational number <math>x\in\mathbb R</math>, the inequality <math>\left|x-\frac pq\right|<\frac 1{q^2}</math> has infinitely many solutions. On the other hand, sometimes it is useful to know that <math>x</math> cannot be approximated by rationals too well, or, more precisely, that <math>x</math> is not a [[Liouvillian number]], i.e., that for some power <math>M<+\infty</math>, the inequality [[Rational approximation of famous numbers|[more]]] | ||
+ | </blockquote> | ||
+ | ==1/25/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Power set=== | ||
+ | The '''power set''' of a given [[set]] <math>S</math> is the set <math>\mathcal{P}(S)</math> of all [[subset]]s of that set This is denoted, other than by the common <math>\math{P}(S)</math>, by <math>2^{S}</math> (which has to do with the number of elements in the power set of a... [[power set|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/24/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Function=== | ||
+ | A '''function''' is a rule that maps one set of values to another set of values. For instance, one function may map 1 to 1, 2 to 4, 3 to 9, 4 to 16, and so on. This function has the rule that it takes its input value, and squares it to get an output value. One can... [[function|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/23/08== | ||
+ | There was no AotD for January 23rd, 2008. | ||
+ | ==1/22/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Permutation=== | ||
+ | A '''permutation''' of a [[set]] of <math>r</math> objects is any rearrangement (linear ordering) of the <math>r</math> objects. There are <math>r!</math> (the [[factorial]] of <math>r</math>) permutations of a set with <math>r</math> distinct objects. | ||
+ | |||
+ | One can also consider permutations of [[infinite]] sets. In this case, a permutation of a set <math>S</math> is simply a [[bijection]] between <math>S</math> and... [[Permutation|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/21/08== | ||
+ | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
+ | ===Euclidean algorithm=== | ||
+ | {{WotWAlso}} | ||
+ | The '''Euclidean algorithm''' (also known as the '''Euclidean division algorithm''' or '''Euclid's algorithm''') is an algorithm that finds the [[greatest common divisor]] (GCD) of two elements of a [[Euclidean domain]], the most common of which is the [[nonnegative]] [[integer]]s <math>\mathbb{Z}{\geq 0}</math>, without [[factoring]]... [[Euclidean algorithm|[more]]] | ||
+ | </blockquote> | ||
+ | |||
+ | ==1/8/08-1/20/08== | ||
+ | On vacation. | ||
+ | ==1/7/08== | ||
<blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
===Math books=== | ===Math books=== | ||
Line 11: | Line 91: | ||
</blockquote> | </blockquote> | ||
− | ==1/6/ | + | ==1/6/08== |
<blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
===Limit=== | ===Limit=== | ||
Line 17: | Line 97: | ||
</blockquote> | </blockquote> | ||
− | ==1/5/ | + | ==1/5/08== |
<blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
===American Mathematics Competitions=== | ===American Mathematics Competitions=== | ||
Line 23: | Line 103: | ||
</blockquote> | </blockquote> | ||
− | ==1/4/ | + | ==1/4/08== |
<blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
===Physics=== | ===Physics=== | ||
Line 36: | Line 116: | ||
[[physics|[more]]] | [[physics|[more]]] | ||
</blockquote> | </blockquote> | ||
− | ==1/3/ | + | ==1/3/08== |
<blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
===United States of America Mathematical Olympiad=== | ===United States of America Mathematical Olympiad=== | ||
Line 44: | Line 124: | ||
</blockquote> | </blockquote> | ||
− | ==12/13/07 - 1/2/ | + | ==12/13/07 - 1/2/08== |
AotD is on vacation. | AotD is on vacation. | ||
==12/22/07== | ==12/22/07== | ||
Line 159: | Line 239: | ||
==12/8/07== | ==12/8/07== | ||
<blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours"> | ||
− | ===Canada/USA | + | ===Canada/USA Mathcamp=== |
{{WotWAlso}} | {{WotWAlso}} | ||
The '''Canada/USA Mathcamp''' is an intensive 5-week-long summer program for mathematically talented high school students, designed to inspire and motivate mathematically talented high school students by exposing them to the beauty and variety of mathematics, to impart valuable knowledge and skills for the pursuit of mathematics in high school, university, and beyond, and to provide a supportive and fun environment for interaction among students who love mathematics. | The '''Canada/USA Mathcamp''' is an intensive 5-week-long summer program for mathematically talented high school students, designed to inspire and motivate mathematically talented high school students by exposing them to the beauty and variety of mathematics, to impart valuable knowledge and skills for the pursuit of mathematics in high school, university, and beyond, and to provide a supportive and fun environment for interaction among students who love mathematics. | ||
− | The environment of Mathcamp tends to be relaxed in terms of rules; in fact it officially only has four rules (generally involving common sense and respect). Originally it had been stricter, though by 1997 most of the mentors found the structure too... [[Canada/USA | + | The environment of Mathcamp tends to be relaxed in terms of rules; in fact it officially only has four rules (generally involving common sense and respect). Originally it had been stricter, though by 1997 most of the mentors found the structure too... [[Canada/USA Mathcamp|[more]]] |
</blockquote> | </blockquote> | ||
Latest revision as of 22:58, 15 February 2008
Contents
- 1 2/3/08 - 2/29/08
- 2 2/2/08
- 3 2/1/08
- 4 1/31/08
- 5 1/30/08
- 6 1/29/08
- 7 1/28/08
- 8 1/27/08
- 9 1/26/08
- 10 1/25/08
- 11 1/24/08
- 12 1/23/08
- 13 1/22/08
- 14 1/21/08
- 15 1/8/08-1/20/08
- 16 1/7/08
- 17 1/6/08
- 18 1/5/08
- 19 1/4/08
- 20 1/3/08
- 21 12/13/07 - 1/2/08
- 22 12/22/07
- 23 12/21/07
- 24 12/20/07
- 25 12/19/07
- 26 12/18/07
- 27 12/17/07
- 28 12/16/07
- 29 12/15/07
- 30 12/14/07
- 31 12/13/07
- 32 12/12/07
- 33 12/11/07
- 34 12/10/07
- 35 12/9/07
- 36 12/8/07
- 37 12/7/07
- 38 12/6/07
- 39 12/5/07
- 40 12/4/07
- 41 12/3/07
- 42 12/2/07
- 43 12/1/07
- 44 11/30/07
- 45 11/27/07
- 46 11/25/07
2/3/08 - 2/29/08
AotD will be back in March as Article of the Week!
2/2/08
Law of Tangents
The Law of Tangents is a useful trigonometric identity that, along with the law of sines and law of cosines, can be used to determine angles in a triangle. Note that the law of tangents usually cannot determine sides, since only angles are involved in its statement.... [more]
2/1/08
Law of Sines
The Law of Sines is a useful identity in a triangle, which, along with the law of cosines and the law of tangents can be used to determine sides and angles. The law of sines can also be used to determine the circumradius, another useful function... [more]
1/31/08
Law of Cosines
This article was also a AoPSWiki word of the week
The Law of Cosines is a theorem which relates the side-lengths and angles of a triangle. It can be derived in several different ways, the most common of which are listed in the "proofs" section ... [more]
1/30/08
Euler's totient function
Euler's totient function
applied to a positive integer
is defined to be the number of positive integers less than or equal to
that are relatively prime to
.
is read "phi of n."... [more]
1/29/08
There was no AotD for January 1st, 2008.
1/28/08
Expected value
This article was also a AoPSWiki word of the week
Given an event with a variety of different possible outcomes, the expected value is what one should expect to be the average outcome if the event were to be repeated many times. Note that this is not the same as the "most likely outcome."
More formally, we can define expected value as follows: if we have an event
whose outcomes have a discrete probability distribution, the... [more]
1/27/08
Introductory modular arithmetic
Modular arithmetic is a special type of arithmetic that involves only integers. This goal of this article is to explain the basics of modular arithmetic while presenting a progression of more difficult and more interesting problems that are easily solved using... [more]
1/26/08
Rational approximation of famous numbers
Rational approximation is the application of Dirichlet's theorem which shows that, for each irrational number
, the inequality
has infinitely many solutions. On the other hand, sometimes it is useful to know that
cannot be approximated by rationals too well, or, more precisely, that
is not a Liouvillian number, i.e., that for some power
, the inequality [more]
1/25/08
Power set
The power set of a given set
is the set
of all subsets of that set This is denoted, other than by the common $\math{P}(S)$ (Error compiling LaTeX. Unknown error_msg), by
(which has to do with the number of elements in the power set of a... [more]
1/24/08
Function
A function is a rule that maps one set of values to another set of values. For instance, one function may map 1 to 1, 2 to 4, 3 to 9, 4 to 16, and so on. This function has the rule that it takes its input value, and squares it to get an output value. One can... [more]
1/23/08
There was no AotD for January 23rd, 2008.
1/22/08
Permutation
A permutation of a set of
objects is any rearrangement (linear ordering) of the
objects. There are
(the factorial of
) permutations of a set with
distinct objects.
One can also consider permutations of infinite sets. In this case, a permutation of a set
is simply a bijection between
and... [more]
1/21/08
Euclidean algorithm
This article was also a AoPSWiki word of the week
The Euclidean algorithm (also known as the Euclidean division algorithm or Euclid's algorithm) is an algorithm that finds the greatest common divisor (GCD) of two elements of a Euclidean domain, the most common of which is the nonnegative integers
, without factoring... [more]
1/8/08-1/20/08
On vacation.
1/7/08
Math books
These math books are recommended by Art of Problem Solving administrators and members of the <url>index.php AoPS-MathLinks Community</url>.
Levels of reading and math ability are loosely defined as follows:
- Elementary is for elementary school students up through possibly early middle school.
- Getting Started is recommended for students grades 6 to 9.
- Intermediate is recommended for students grades 9 to 12.
- Olympiad is recommended for high school students... [more]
1/6/08
Limit
For a real function
and some value
,
(said, "the limit of
at
as
goes to
) equals
iff for every
there exists a
such that if
, then
... [more]
1/5/08
American Mathematics Competitions
The American Mathematics Competitions (AMC) consist of a series of increasingly difficult tests for students in middle school and high school. The AMC sets the standard in the United States for talented high school students of mathematics. The AMC curriculum is both comprehensive and modern. AMC exams are so well designed that some top universities such as MIT now ask students for their AMC scores. "AMC" is also used as an abbreviation for American Math Contest, used to refer to the AMC 8, AMC 10, and AMC 12... [more]
1/4/08
Physics
The study of energy is known as physics. Everything concerning energy in some form or the other is covered by physics.
Physics as was known till the end of the nineteenth century is known now as classical physics. It is broadly classified into the following branches:
1/3/08
United States of America Mathematical Olympiad
The United States of America Mathematical Olympiad (USAMO) is the third test in a series of exams used to challenge bright students on the path toward choosing the team that represents the United States at the International Mathematics Olympiad (IMO).
The USAMO is administered by the American Mathematics Competitions (AMC). Art of Problem Solving (AoPS) is a proud sponsor of the AMC and of the recent expansion of USAMO participants from around 250 to around 400. [more]
12/13/07 - 1/2/08
AotD is on vacation.
12/22/07
Leonhard Euler
Leonhard Euler (1707-1735, pronounced Oiler) was a famous Swiss mathematician and physicist. He made numerous contributions to many fields of mathematics and science. Euler is often considered to be one of the greatest mathematicians of all time, along with Isaac Newton, Archimedes, and Carl Friedrich Gauss.
Euler was born on April 15, 1707 in Basel, Switzerland. Euler's parents were Paul Euler, a pastor of the Reformed Church, and Marguerite Brucker, a pastor's
12/21/07
Zermelo-Fraenkel Axioms
The Zermelo-Fraenkel Axioms are a set of axioms that compiled by Ernst Zermelo and Abraham Fraenkel that make it very convenient for set theorists to determine whether a given collection of objects with a given property describable by the language of set theory could be called a set. As shown by paradoxes such as Russell's Paradox, some restrictions must be put on which collections to call sets.
This axiom establishes the... [more]
12/20/07
Joining an ARML team
Team selection for the American Regions Mathematics League varies from team to team.
Florida ARML sends two teams to ARML each year. The selection criteria for the Florida ARML team takes into consideration several factors:
- AMC and AIME performance
- Past AMC, AIME, and USAMO scores
- Past ARML performance
- FAMAT-designated competitions
- An annual statewide tryout test
The organizers are Jason Wiggins of... [more]
12/19/07
Zorn's Lemma
Zorn's Lemma is a set theoretic result which is equivalent to the Axiom of Choice.
Let
be a partially ordered set.
We say that
is inductively ordered if every totally ordered subset
of
has an upper bound, i.e., an element
such that for all
,
. We say that
is strictly inductively ordered if every totally ordered subset
of
has a least upper bound, i.e., an upper bound
so that if
is an upper bound of
, then
.
An element
is maximal if the relation
implies
. (Note that a set may have several maximal... [more]
12/18/07
There was no AotD for December eighteenth.
12/17/07
Diophantine equation
This article was also a AoPSWiki word of the week
A Diophantine equation is an multi-variable equation for which integer solutions (or sometimes natural number or whole number solutions) are to be found.
Finding the solution or solutions to a Diophantine equation is closely tied to modular arithmetic and number theory. Often, when a Diophantine equation has infinitely many solutions, parametric form is used to express the relation between the variables of the equation.
Diophantine equations are named for the ancient Greek/Alexandrian mathematician Diophantus.
A Diophantine equation in the form
is known as a linear combination. If two relatively prime integers
and
are written in this form with
, the equation will have an infinite number of solutions. More generally, there will always be an... [more]
12/16/07
Fibonacci sequence
This article was also a AoPSWiki word of the week
The Fibonacci sequence is a sequence of integers in which the first and second terms are both equal to 1 and each subsequent term is the sum of the two preceding it. The first few terms are
.
The Fibonacci sequence can be written recursively as
and
for
. This is the simplest nontrivial... [more]
12/15/07
Cauchy-Schwarz inequality
The Cauchy-Schwarz Inequality (which is known by other names, including Cauchy's Inequality, Schwarz's Inequality, and the Cauchy-Bunyakovsky-Schwarz Inequality) is a well-known inequality with many elegant applications... [more]
12/14/07
Rearrangement inequality
The Rearrangement Inequality states that, if
is a permutation of a finite set (in fact, multiset) of real numbers and
is a permutation of another finite set of real numbers, the quantity
is maximized when
and
are similarly sorted (that is, if
is greater than or equal to exactly
of the other members of
, then
is also greater than or equal to exactly
of the other members of
). Conversely,
is minimized when
and
are oppositely sorted (that is, if
is less than or equal
12/13/07
There was no AotD for December thirteenth.
12/12/07
Trigonometric identities
Trigonometric identities are used to manipulate trigonometry equations in certain ways. Here is a list of them:
The six basic trigonometric functions can be defined using [more]
12/11/07
MATHCOUNTS
MATHCOUNTS is a large national mathematics competition and mathematics coaching program that has served millions of middle school students since 1984. Sponsored by the CNA Foundation, National Society of Professional Engineers, the National Council of Teachers of Mathematics, and others, the focus of MATHCOUNTS is on mathematical problem solving. Students are eligible for up to three years, but cannot compete beyond their eighth grade year.
MATHCOUNTS curriculum... [more]
12/10/07
Polynomial
A polynomial is a function in one or more variables that consists of a sum of variables raised to nonnegative, integral powers and multiplied by coefficients (usually integral, rational, real or complex, but in abstract algebra often coming from an arbitrary field).
For example, these are... [more]
12/9/07
Pascal's identity
Pascal's identity is a common and useful theorem in the realm of combinatorics dealing with combinations (also known as binomial coefficients), and is often used to reduce large, complicated combinations.
Pascal's identity is also known as Pascal's rule, Pascal's formula, and occasionally... [more]
12/8/07
Canada/USA Mathcamp
This article was also a AoPSWiki word of the week
The Canada/USA Mathcamp is an intensive 5-week-long summer program for mathematically talented high school students, designed to inspire and motivate mathematically talented high school students by exposing them to the beauty and variety of mathematics, to impart valuable knowledge and skills for the pursuit of mathematics in high school, university, and beyond, and to provide a supportive and fun environment for interaction among students who love mathematics.
The environment of Mathcamp tends to be relaxed in terms of rules; in fact it officially only has four rules (generally involving common sense and respect). Originally it had been stricter, though by 1997 most of the mentors found the structure too... [more]
12/7/07
Prime number
A prime number (or simply prime) is a positive integer
whose only positive divisors are 1 and itself. Note that
is usually defined as being neither prime nor composite because it is its only factor among the natural numbers. The Sieve of Eratosthenes is a relatively quick method for... [more]
12/6/07
Calculus
The discovery of the branch of mathematics known as calculus was motivated by two classical problems: how to find the slope of the tangent line to a curve at a point and how to find the area bounded by a curve. What is surprising is that these two problems are fundamentally connected and, together with the notion of limits, can be used to analyse instantaneous rates of change, accumulations of change, volumes of irregular solids, and... [more]
12/5/07
Pi
Pi is an irrational number (in fact, transcendental number, as proved by Lindeman in 1882) denoted by the greek letter
.
Pi is the ratio of the circumference (perimeter) of a given circle to its diameter. It is approximately equal to 3.141592653. The number pi is one of the most important constants in all of mathematics and appears in some of the most surprising places, such as in the sum
. Some common... [more]
12/4/07
Isaac Newton
Isaac Newton (1643 – 1727) was a famous British physicist and mathematician. His most famous work in mathematics was the compilation of calculus.
Isaac Newton was born on January 4, 1643 in Lincolnshire, England. Newton was born very shortly after the death of his father. He did very well... [more]
12/3/07
Logarithm
This article was also a AoPSWiki word of the week
Logarithms and exponents are very closely related. In fact, they are inverse functions. This means that logarithms can be used to reverse the result of exponentiation and vice versa, just as addition can be used to reverse the result of subtraction. Thus, if we have
, then taking the logarithm with base
on both sides will give us
.
We would read this as "the logarithm of b, base a, is x". For example, we know that
. To express the same fact... [more]
12/2/07
American Invitational Mathematics Examination
The American Invitational Mathematics Examination (AIME) is the second exam in the series of exams used to challenge bright students on the path toward choosing the team that represents the United States at the International Mathematics Olympiad (IMO). While most AIME participants are high school students, some bright middle school students also qualify each year.
High scoring AIME students are invited to take the prestigious United States of America Mathematics Olympiad (USAMO).
The AIME is administered by... [more]
12/1/07
Inequality
The subject of mathematical inequalities is tied closely with optimization methods. While most of the subject of inequalities is often left out of the ordinary educational track, they are common in mathematics Olympiads.
Inequalities are arguably a branch of... [more]
11/30/07
Asymptote (geometry)
This article was also a AoPSWiki word of the week
An asymptote is a line or curve that a certain function approaches.
Linear asymptotes can be of three different kinds: horizontal, vertical or slanted (oblique).
The vertical asymptote can be found by finding values of
that make the function undefined, generally because it results in a division by zero, which is undefined... [more]
11/27/07
Complex number
The complex numbers arise when we try to solve equations such as
.
We know (from the trivial inequality) that the square of a real number cannot be negative, so this equation has no solutions in the real numbers. However, it is possible to define a number,
, such that
. If we add this new number to the reals, we will have solutions to
. It turns out that in the system that results... [more]
11/25/07
Set
The notion of a set is one of the fundamental notions in mathematics that is difficult to precisely define. Of course, we have plenty of synonyms for the word "set," like collection, ensemble, group, etc., but those names really do not define the meaning of the word set; all they can do is replace it in various sentences. So, instead of defining what sets are, one has to define what can be done with them or, in other words, what axioms the sets satisfy. These axioms are chosen to agree with our intuitive concept of a set, on one hand, and to allow various, sometimes quite sophisticated, mathematical constructions on the other hand. For the full collection...[more]