Search results
Results from the WOW.Com Content Network
The three-part original paper is more than 300 pages long. (Britton later published a 282-page paper attempting to solve the problem, but his paper contained a serious gap.) 1960-1970 Fondements de la Géometrie Algébrique, Éléments de géométrie algébrique and Séminaire de géométrie algébrique. Grothendieck's work on the foundations ...
The Penguin Dictionary of Curious and Interesting Numbers is a reference book for recreational mathematics and elementary number theory written by David Wells. The first edition was published in paperback by Penguin Books in 1986 in the UK, and a revised edition appeared in 1997 (ISBN 0-14-026149-4).
In mathematics, the three-gap theorem, three-distance theorem, or Steinhaus conjecture states that if one places n points on a circle, at angles of θ, 2θ, 3θ, ... from the starting point, then there will be at most three distinct distances between pairs of points in adjacent positions around the circle. When there are three distances, the ...
The eminent historian of mathematics Carl Boyer once called Euler's Introductio in analysin infinitorum the greatest modern textbook in mathematics. [32] Published in two volumes, [ 33 ] [ 34 ] this book more than any other work succeeded in establishing analysis as a major branch of mathematics, with a focus and approach distinct from that ...
Recreational mathematics is mathematics carried out for recreation (entertainment) rather than as a strictly research-and-application-based professional activity or as a part of a student's formal education. Although it is not necessarily limited to being an endeavor for amateurs, many topics in this field require no knowledge of advanced ...
Also in 2008, Penguin Books USA published a complete annotated listing of all Penguin Classics titles in a single paperback volume in the style of its Penguin Classics books. The list organises the collection multiple times: alphabetically by author, subject categories, authors by region, and a complete alphabetic title index.
Solution of a travelling salesman problem: the black line shows the shortest possible loop that connects every red dot. In the theory of computational complexity, the travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the ...
London, UK; paperback division of Transworld Publishers Ltd.; now part of Penguin Random House: 553 Bantam Books … now part of Penguin Random House: 554 Bastion Books (Canada) 558 Pearson Custom 559 Bibliolife 560 E. J. Arnold; Arnold-Wheaton 562 Sampson Low: 563 BBC Publications now BBC Worldwide: 564 British & Foreign Bible Society: 565 ...