Printer Friendly
The Free Library
22,710,190 articles and books

Carl Friedrich Gauss.



Education

Johann Carl Friedrich Gauss (person) Carl Friedrich Gauss - A German mathematician (1777 - 1855), one of all time greatest. Gauss discovered the method of least squares and Gaussian elimination.  was born on 30 April 1777 in the German city of Braunschweig (Brunswick). He was the only child of Gebhard Dietrich Gauss and Dorothea Benze. Neither of Gauss's parents had much education, his father could read and write, but earned his living doing menial MENIAL. This term is applied to servants who live under their master's roof Vide stat. 2 H. IV., c. 21.  jobs such as gardening and as a street butcher; his mother could read but not write.

In 1784 Gauss entered elementary school elementary school: see school. , where he was put in a class of fifty students. Gauss knew how to read and write before entering school, skills he appears to have learnt without any help from his parents. Gauss was lucky to have a competent and concerned teacher, Buttner, and assistant teacher, Bartels, who took a personal interest in Gauss, trying to help and encourage him. His teachers were amazed that when asked to sum the numbers 1 to 100, Gauss added (1 + 100) + (2 + 99) + (3 + 98) ... all the way to (50 + 51), reducing the whole problem to (50 x 101) = 5050.

Carl Friedrich left his parents home in 1788 when Buttner helped him be admitted to secondary school. The lectures were orderly and regular with smaller class sizes and with students who all had the same level of knowledge. The curriculum was old-fashioned and unbalanced, with an over-emphasis on Latin and High German. While still a teenager, Gauss propounded the theory of least squares, demonstrated a solution to the age-old problem of dividing a circle into 17 parts, and made important mathematical discoveries which he was too shy to publish, and entrusted only to his diary.

In 1791 Gauss was introduced to his prince, Duke of Brunswick-Wolfenbuttel, who undertook to finance his education and, in the process, became his lifelong patron and friend. Gauss attended the University of Gottingen and in 1799 obtained a Doctorate in Mathematics from the University of Helmstedt The University of Helmstedt, official Latin name: Academia Julia ("Julius University"), was a university in Helmstedt, Brunswick-Lüneburg, Holy Roman Empire, that existed from 1576 until 1810. . About this time he turned his attention to astronomy, making brilliant computations of orbits of asteroids This is a list of numbered minor planets, nearly all of them asteroids, in sequential order.

As of late September 2007 there are 164,612 numbered minor planets, and many more not yet numbered. Most asteroids are ordinary and not particularly noteworthy.
.

Gauss married Johanna Ostoff on 9 October 1805. He now had a happy personal life for the first time, although his benefactor, the Duke of Brunswick, was killed fighting for the Prussian army The Prussian Army (German: Preußische Armee) was the army of the Kingdom of Prussia. It was vital to the development of Brandenburg-Prussia as a European power. . In 1807, Gauss became director of the observatory in Gottingen, a post he held until his death in 1855. In 1808 his father died, and a year later Gauss's wife Johanna died after giving birth to their second son, who was to die soon after her. Gauss was married for a second time the next year, to Minna, the best friend of Johanna, and although they had three children, this marriage seemed to be one of convenience for Gauss.

The period 1817-1832 was a particularly distressing time for Gauss. He took in his sick mother in 1817, who stayed until her death in 1839, while he was arguing with his wife and her family about whether they should go to Berlin. He had been offered a position at Berlin University and Minna and her family were keen to move there. Gauss, however, never liked change and decided to stay in Gottingen.

Most of Gauss's contributions to mathematics and science were written in about 155 papers. He published anything only after the most thorough investigation and after he was sure it met his motto: Ut nihil amplius desiderandum relictum sit--that nothing further remains to be done. His mind was so full of numbers that when he was interrupted in solving a problem, and told that his wife was dying, he reportedly replied: "Tell her to wait until I am done."

In 1831 Gauss's second wife died after a long illness. Gauss died in his sleep early in the morning of 23 February, 1855.

The fundamental theorem of algebra fundamental theorem of algebra

Theorem of equations proved by Carl Friedrich Gauss in 1799. It states that every polynomial equation of degree n with complex number coefficients has n roots, or solutions, in the complex numbers.
 

The fundamental theorem of algebra was first stated by d'Alembert in 1746 but was only partially proved. Gauss, at the age of 21, was the first to give a rigorous proof of the theorem. In fact, Gauss gave three alternative proofs to the theorem. All three proofs can be found in the third volume of his Works.

The fundamental theorem of algebra states that every equation of the nth degree has n roots. We can alternatively express this theorem as:

the polynomial polynomial, mathematical expression which is a finite sum, each term being a constant times a product of one or more variables raised to powers. With only one variable the general form of a polynomial is a0xn+a  f(z) = [z.sup.n] + [c.sub.1][z.sup.n-1] + ... + [c.sub.n-1]z + [c.sub.n] can always be factored into n linear factors of the form z - [a.sub.i].

The proof of this theorem is done in two steps, first showing that an equation of the nth degree has at least one root, and then showing that the equation has n roots and no more.

Note that it is possible for several of the n roots [a.sub.1], [a.sub.2], ... [a.sub.n] to be the same; e.g., [a.sub.1] = [a.sub.2] = [a.sub.3]. In this case [a.sub.1] is a multiple root and for the example given is a root of multiplicity three.

Number theoretical work

Disquistiones Arithmeticae was published in Leipzig in 1801 and centred on Gauss's work in number theory. Disquistiones Arithmeticae is divided into seven chapters, called sections. The first three are introductory, sections IV-VI form the central part of the work and section VII is a short monograph devoted to a separate but related subject. The work is dedicated to the Duke of Brunswick.

The first section, only five pages long, deals with elementary results and concepts, such as the derivation of the divisibility rules for 3, 9 and 11. As the most basic concept in the work, congruences for rational integers modulo A mathematical operation (modulus arithmetic) in which the result is the remainder of a division. Also known as the "remainder operator," it is used to solve a variety of problems. For example, the following code in the C language determines if a number is odd or even.  (a natural number) are defined and their elementary properties are proved, among them the division algorithm
This article is about a mathematical theorem. For a list of division algorithms, see Division (digital).


The division algorithm is a theorem in mathematics which precisely expresses the outcome of the usual process of division of integers.
.

In section II (24 pages) Gauss proves the uniqueness of the factorisation Noun 1. factorisation - (mathematics) the resolution of an entity into factors such that when multiplied together they give the original entity
factoring, factorization

resolving, resolution - analysis into clear-cut components
 of integers into primes and defines the concepts of greatest common divisor (mathematics) greatest common divisor - (GCD) A function that returns the largest positive integer that both arguments are integer multiples of.

See also Euclid's Algorithm. Compare: lowest common multiple.
 and least common multiple. After defining the expression a [equivalent to] b mod c, Gauss turns to the equation ax + k [equivalent to] c. He derives an algorithm for its solution and mentions the possibility of using continued fractions instead of the Euclidean algorithm Euclidean Algorithm - Euclid's Algorithm .

Section III (35 pages) contains an investigation of the residues of a power of a given number modulo (odd) primes. The basis of the investigation is Fermat's 'little' theorem:

[a.sup.p-1] [equivalent to] 1 (mod p)

where p is any prime which does not divide a.

Gauss gives two proofs, one by 'exhaustion' which goes back to Euler or possibly Leibniz. The other uses the 'binomial theorem'

[(a + b + c + ...).sup.p] [equivalent to] [a.sup.p] + [b.sup.p] + [c.sup.p] + ... (mod p)

In section IV the main topic is the law of quadratic reciprocity The law of quadratic reciprocity is a theorem from number theory which considers two distinct odd prime numbers, p and q, and the statements
A: p is a square mod q, and
B: q is a square mod p.
. The law derives its name from a formalism invented by Legendre and is defined as follows. If p and q are positive, odd primes, we define

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII ASCII or American Standard Code for Information Interchange, a set of codes used to represent letters, numbers, a few symbols, and control characters. Originally designed for teletype operations, it has found wide application in computers. ]

The law of quadratic reciprocity is the identity:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

This result had been formulated by Euler and discussed at length by Legendre but had not been proved correctly. Try some simple examples!

Section V is the main section of Disquistiones Arithmeticae. It deals with the theory of binary quadratic forms; i.e., algebraic expressions of the type:

f (x,y) = a[x.sup.2] + 2bxy + c[y.sup.2]

for given integers a, b and c. A substantial amount of the fifth section is not original but merely summarises the work of Legendre. Gauss clearly indicates where his original work begins and gives credit to others were required.

In section VI Gauss presents several important applications of the concepts included in Section V. The principal topics are partial fractions, periodic decimals and the resolution of congruences. Another interesting topic is the derivation of criteria for distinguishing between prime and composite numbers. The remaining section of Disquistiones Arithmeticae deals with ruler and compass constructions and will be discussed shortly.

Ruler and compass constructions

The division of the circle using only a ruler and a compass is an old and classical problem. For many years it had been an open and often discussed problem as to whether the regular 17-gon can be constructed with the use of these two tools only. The ancient Greeks knew how to construct an equilateral triangle (3-gon), a square (4-gon), and a regular pentagon (5-gon), and of course they could double the number of sides of any polygon simply by bisecting the angles. They could also construct the 15-gon by combining a triangle and a pentagon. For over 2000 years no other constructible n-gons were known. Then, in 1796, the 19 year old Gauss discovered that it was possible to construct the regular heptadecagon (17-gon). Subsequently Gauss presented this result at the end of Disquistiones Arithmeticae, in which he proves the constructibility of the n-gon for any n that is a prime of the form

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]

also known as Fermat primes.

One of the nicest actual constructions of the 17-gon is Richmond's (1893), as reproduced in Stewart's Galois Theory. Draw a circle centred at O, and choose one vertex V on the circle. Then locate the point A on the circle such that OA is perpendicular to OV, and locate point B on OA such that OB is a quarter of OA. Next locate the point C on OV such that angle OBC OBC Other Backward Classes
OBC Ontario Building Code
OBC On Board Computer
OBC Organization for Bat Conservation
OBC Outline Business Case (UK government procurement)
OBC Oriental Bank of Commerce (India) 
 is a quarter the angle OBV OBV Obviously
OBV On Balance Volume (market momentum indicator that relates volume to price change; developed by Joseph Granville)
OBV Orbital Boost Vehicle
OBV On Board Video
OBV Obligated Volunteer
. Then find the point D on OV (extended) such that angle DBC See dBA.

(language, parallel) DBC - A data-parallel bit-serial C based on MPL. SRC, Bowie MD.

E-mail: <maya@super.org>.
 is half of a right angle. Let E denote the point where the circle on DV as diameter cuts OA. Now draw a circle centred at C through the point E, and let F and G denote the two points where this circle cuts OV. Then, if perpendiculars to OV are drawn at F and G, they strike the main circle (the one centred at O through V) at points [V.sub.3] and [V.sub.5], as shown in the figure.

[ILLUSTRATION OMITTED]

The points V, [V.sub.3], and [V.sub.5] are the zero, third, and fifth vertices The plural of vertex. See vertex.  of a regular heptadecagon, from which the remaining vertices are easily found (i.e., bisect bi·sect  
v. bi·sect·ed, bi·sect·ing, bi·sects

v.tr.
To cut or divide into two parts, especially two equal parts.

v.intr.
To split; fork.
 angle [V.sub.3]O[V.sub.5] to locate [V.sub.4], etc.). Gauss was clearly fond of this discovery, and there is a story that he asked to have a heptadecagon carved on his tombstone Tombstone, city (1990 pop. 1,220), Cochise co., SE Ariz.; inc. 1881. With its pleasant climate and legendary past, Tombstone is a well-known tourist attraction. The city became a national historic landmark in 1962. , like the sphere inscribed in·scribe  
tr.v. in·scribed, in·scrib·ing, in·scribes
1.
a. To write, print, carve, or engrave (words or letters) on or in a surface.

b. To mark or engrave (a surface) with words or letters.
 in a cylinder on Archimedes' tombstone.

Useful links and references

Eves, H. (1990). An Introduction to the History of Mathematics, (6th ed.). Saunders Publishing Co.

Stewart, I. (2004). Galois Theory (3rd ed.). New York New York, state, United States
New York, Middle Atlantic state of the United States. It is bordered by Vermont, Massachusetts, Connecticut, and the Atlantic Ocean (E), New Jersey and Pennsylvania (S), Lakes Erie and Ontario and the Canadian province of
: Chapman & Hall.

The MacTutor History of Mathematics archive The MacTutor History of Mathematics archive is an award-winning website maintained by John J. O'Connor and Edmund F. Robertson and hosted by the University of St Andrews in Scotland. . Available at: www-groups.dcs.st-andrews.ac.uk/~history/ Mathematicians/Gauss.html

Gauss' biography. Available at: www.geocities.com/RainForest/Vines/2977/gauss/g_bio.html

Carl Friedrich Gauss. Available at: www.genie-gauss.de (in German).

Laplace was once asked who was the greatest mathematician in Germany, and Laplace replied, "Pfaff." "But what about Gauss?" he was asked. "Gauss," replied Laplace, "is the greatest mathematician in the world."

Kathryn Rice

Paul Scott

Wattle wattle, in botany: see acacia.  Park, SA

mail@paulscott.info
COPYRIGHT 2005 The Australian Association of Mathematics Teachers, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2005 Gale, Cengage Learning. All rights reserved.

 Reader Opinion

Title:

Comment:



 

Article Details
Printer friendly Cite/link Email Feedback
Author:Rice, Kathryn; Scott, Paul
Publication:Australian Mathematics Teacher
Article Type:Biography
Date:Dec 22, 2005
Words:1850
Previous Article:Teachers of mathematics or numeracy?
Next Article:Mathematical fiction: its place in secondary-school mathematics learning.
Topics:



Related Articles
Cracking Kepler's sphere-packing problem.
Drama in numbers: putting a passion for mathematics on stage.
Math lab: computer experiments are transforming mathematics.
Stalking the Riemann Hypothesis: The Quest to Find the Hidden Law of Prime Numbers.
The Prince Of Mathematics.
The Prince of Mathematics: Carl Friedrich Gauss.
Problems with primes.
Gauss, Titan of Science.
Morgan Reynolds Publishing.

Terms of use | Copyright © 2014 Farlex, Inc. | Feedback | For webmasters