Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | Green's Theorem prov. [TMRC] For any story, in any group of people there will be at least one person who has not heard the story. A refinement of the theorem states that there will be _exactly_ one person (if there were more than one, it wouldn't be as bad to re-tell the story). [The name of this theorem is a play on a fundamental theorem in calculus. --ESR]. Source: Jargon File. |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
In physics and mathematics, Green's Theorem gives the relationship between a line integral around a simple closed curve C and a double integral over the plane region D bounded by C. Green's Theorem was named after British scientist George Green, and is based on Stokes' theorem. The theorem states:
If we show Equations 1 and 2
If we express D as a region such that:
Proof of Green's Theorem, General Edition
Proof of Green's Theorem when D is a simple region
and
are true, we would prove Green's Theorem.
where g1 and g2 are continuous functions, we can compute the double integral of equation 1:
Now we break up C as the union of four curves: C1, C2, C3, C4.
With C1, use the parametric equations, x = x, y = g1(x), a ≤ x ≤ b. Therefore:
With -C3, use the parametric equations, x = x, y = g2(x), a ≤ x ≤ b. Therefore:
With C2 and C4, x is a constant, meaning:
Therefore,
Combining this with equation 4, we get:
A similar proof can be employed on Eq.2.
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Green's theorem."
Crosswords: GREEN'S THEOREM |
| Specialty definitions using "GREEN'S THEOREM": divergence theorem. (references) |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "'-e-e-e-e-g-h-m-n-o-r-r-s-t" | |
-4 letters: ergometers, rheometers. | |
-5 letters: emergents, ergometer, geometers, reemerges, rheometer, shortener, threesome. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)47 52 45 45 4E 27 53      54 48 45 4F 52 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000111 01010010 01000101 01000101 01001110 00100111 01010011 00100000 01010100 01001000 01000101 01001111 01010010 01000101 01001101 |
HTML Code (1990) (references)G R E E N ' S   T H E O R E M |
ISO 10646 (1991-1993) (references)0047 0052 0045 0045 004E 0027 0053      0054 0048 0045 004F 0052 0045 004D |
Encryption (beginner's substitution cypher): (references)4152393948953254423949523947 |
| 1. Crosswords 2. Anagrams 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.