Green' s Theorem
(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. [Jargon File] (1994-12-16) In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ arg ] [ as ] [ at ] [ b ] [ ba ] [ be ] [ C ] [ ca ] [ ch ] [ cu ] [ du ] [ er ] [ es ] [ fi ] [ file ] [ gr ] [ group ] [ h ] [ hat ] [ hr ] [ hu ] [ humour ] [ id ] [ il ] [ in ] [ is ] [ it ] [ J ] [ Jargon File ] [ la ] [ lc ] [ ld ] [ Lex ] [ lu ] [ ly ] [ M ] [ mo ] [ mod ] [ module ] [ na ] [ ne ] [ no ] [ op ] [ pe ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ so ] [ st ] [ state ] [ T ] [ th ] [ TM ] [ TMRC ] [ to ] [ um ] [ up ] [ us ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (1784 Reads) |
