Geometry.Net - the online learning center
Home  - Theorems_And_Conjectures - Goldbach's Conjecture
e99.com Bookstore
  
Images 
Newsgroups
Page 2     21-40 of 93    Back | 1  | 2  | 3  | 4  | 5  | Next 20

         Goldbach's Conjecture:     more detail
  1. Uncle Petros and Goldbach's Conjecture by Apostolos Doxiadis, 2000-02-19
  2. Transtheoretic Foundations of Mathematics, Volume 1C: Goldbach Conjecture by H. Pogorzelski, 1997-12
  3. The Goldbach Conjecture (2nd Edition)
  4. Uncle Petros and Goldbach's Conjecture by Apostolos Doxiadis, 2001-05-01
  5. Uncle Petros and Goldbach's Conjecture.(Review): An article from: World Literature Today by Minas Savvas, 2000-06-22
  6. Uncle Peteros & Goldbach's Conjecture by Apostolos Doxiadis, 2000
  7. Oncle Petros ou la conjecture de Goldbach by Apostolos Doxiadis, 2002-01-14
  8. Decoding the code in Goldbach conjecture: the law and proof of Goldbach conjecture by QingHui Chen, 2006
  9. Checking the Goldbach conjecture on a vector computer (Report. Centrum voor Wiskunde en Informatica) by A Granville, 1988
  10. UNCLE PETROS & GOLDBACHS CONJECTURE by Apostolos Doxiadis, 2000
  11. Goldbach Conjecture
  12. Goldbach Conjecture
  13. Number Theory Seven by K. Savithri, 1986

21. Editorial Reviews: Uncle Petros And Goldbach's Conjecture
Reviews of Uncle Petros and Goldbach s conjecture by Apostolos Doxiadis. From Kirkus Reviews An intellectual thriller that manages
http://www.maths.ex.ac.uk/~mwatkins/zeta/doxiadis.htm
Reviews of Uncle Petros and Goldbach's Conjecture by Apostolos Doxiadis
From Kirkus Reviews
Oliver Sacks

A mathematical conjecture unsolved for two centuries; a mathematical genius uncle driven mad trying to solve it; an ambiguous relation with a mathematically-minded nephew; and acute human observation all come together in Uncle Petros to make a very funny, tender, charming and, to my mind, irresistable novel. Book Description
In the tradition of Fermat's Last Theorem and Einstein's Dreams, a novel about mathematical obsession. Petros Papachristos devotes the early part of his life trying to prove one of the greatest mathematical challenges of all time: Goldbach's Conjecture, the deceptively simple claim that every even number greater than two is the sum of two primes. Against a tableau of famous historical figuresamong them G.H. Hardy, the self-taught Indian genius Srinivasa Ramanujan, and a young Kurt GodelPetros works furiously to prove the notoriously difficult conjecture, but suddenly disappears into a solitary existence playing chess in the Greek countryside. To his nephew, he is known as the solitary, eccentric Uncle Petros, but when the young man finds out that his uncle is an esteemed professor of mathematics, he searches out his uncle's hidden past. Through an adversarial friendship based on chess and mathematics, he drives the retired mathematician back into the hunt to prove Goldbach's Conjecture... but at the cost of the old man's sanity, and perhaps even his life.

22. Goldbach
Other references in MacTutor. Chronology 1740 to 1760. Other Web sites, The Prime Pages (Goldbach s conjecture);
http://www-gap.dcs.st-and.ac.uk/~history/Mathematicians/Goldbach.html
Christian Goldbach
Born:
Died: 20 Nov 1764 in Moscow, Russia
Show birthplace location Previous (Chronologically) Next Biographies Index Previous (Alphabetically) Next Main index
In 1725 Christian Goldbach became professor of mathematics and historian at St Petersburg. Then, in 1728, he went to Moscow as tutor to Tsar Peter II. He travelled round Europe meeting mathematicians. He met Leibniz Nicolaus(I) Bernoulli Nicolaus(II) Bernoulli de Moivre ... Daniel Bernoulli and Hermann Goldbach did important work in number theory , much of it in correspondence with Euler . He is best remembered for his conjecture, made in 1742 in a letter to Euler and still an open question, that every even integer greater than 2 can be represented as the sum of two primes . Goldbach also conjectured that every odd number is the sum of three primes. Vinogradov made progress on this second conjecture in 1937. Goldbach also studied infinite sums, the theory of curves and the theory of equations.
Article by: J J O'Connor and E F Robertson Click on this link to see a list of the Glossary entries for this page List of References (11 books/articles) Mathematicians born in the same country Cross-references to History Topics
  • Fermat's last theorem
  • Topology enters mathematics
  • The fundamental theorem of algebra
  • Prime numbers ... e
    Other references in MacTutor Chronology: 1740 to 1760 Other Web sites
  • The Prime Pages (Goldbach's conjecture)
  • J Richstein including Goldbach's letter to Euler
  • Linda Hall Library (Star Atlas)
    Previous
    (Chronologically) Next Biographies Index Previous (Alphabetically)
  • 23. Goldbach's Conjecture (II)
    Goldbach s conjecture (II). Goldbach s conjecture For any even number n greater than or equal to 4, there exists at least one pair
    http://acm.uva.es/p/v6/686.html

    Goldbach's Conjecture (II)
    Goldbach's Conjecture: For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p and p such that n p p
    This conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can find such a pair of prime numbers, if any, for a given even number. The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number.
    A sequence of even numbers is given as input. Corresponding to each number, the program should output the number of pairs mentioned above. Notice that we are interested in the number of essentially different pairs and therefore you should not count p p ) and p p ) separately as two different pairs.
    Input
    An integer is given in each input line. You may assume that each integer is even, and is greater than or equal to 4 and less than 2 . The end of the input is indicated by a number 0.
    Output
    Each output line should contain an integer number. No other characters should appear in the output.

    24. Goldbach's Conjecture
    Goldbach s conjecture. Goldbach s conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states
    http://www.fact-index.com/g/go/goldbach_s_conjecture.html
    Main Page See live article Alphabetical index
    Goldbach's conjecture
    Goldbach's Conjecture is one of the oldest unsolved problems in number theory and in all of mathematics . It states:
    Every even number greater than 2 can be written as the sum of two primes
    (The same prime may be used twice.) The conjecture had been known to Descartes . The following statement is equivalent and is the one originally conjectured in a letter written by Goldbach to Euler in
    Every number greater than 5 can be written as the sum of three primes.
    . The majority of mathematicians believe the conjecture to be true, mostly based on statistical considerations focusing on the probabilistic distribution of prime numbers : the bigger the even number, the more "likely" it becomes that it can be written as a sum of two primes. We know that every even number can be written as the sum of at most six primes. As a result of work by Vinogradov, every sufficiently large even number can be written as the sum of at most four primes. Vinogradov proved furthermore that almost all even numbers can be written as the sum of two primes (in the sense that the fraction of even numbers which can be so written tends towards 1). In

    25. Goldbachs Conjecture - Encyclopedia Article About Goldbachs Conjecture. Free Acc
    In mathematics, Goldbach s conjecture is one of the oldest unsolved problem This article describes currently unsolved problems in mathematics.
    http://encyclopedia.thefreedictionary.com/Goldbachs conjecture
    Dictionaries: General Computing Medical Legal Encyclopedia
    Goldbachs conjecture
    Word: Word Starts with Ends with Definition In mathematics, Goldbach's conjecture is one of the oldest unsolved problem This article describes currently unsolved problems in mathematics The seven Millennium Prize Problems set by the Clay Mathematics Institute are:
    • P versus NP
    • The Hodge Conjecture
    • The Poincaré Conjecture
    • The Riemann Hypothesis
    • Yang-Mills Existence and Mass Gap
    • Navier-Stokes Existence and Smoothness
    • The Birch and Swinnerton-Dyer Conjecture
    Other still-unsolved problems:
    • Number of Magic squares
    • Goldbach's conjecture
    • Twin prime conjecture
    • Hilbert's sixteenth problem

    Click the link for more information. s in number theory Traditionally, number theory is that branch of pure mathematics concerned with the properties of integers and contains many open problems that are easily understood even by non-mathematicians. More generally, the field has come to be concerned with a wider class of problems that arose naturally from the study of integers. Number theory may be subdivided into several fields according to the methods used and the questions investigated. See for example the list of number theory topics.
    Click the link for more information.

    26. A Proof For Goldbach's Conjecture
    a topic from sci.math.symbolic A proof for Goldbach s conjecture. post a message on this topic post a message on a new topic 26 Apr
    http://mathforum.org/epigone/sci.math.symbolic/dendhangsmix
    a topic from sci.math.symbolic
    A proof for Goldbach's conjecture
    post a message on this topic
    post a message on a new topic

    26 Apr 2001 A proof for Goldbach's conjecture , by Hamid V. Ansari
    5 Oct 2003 Dumb , by abcd
    19 Jan 2004 about gold bach cojecture , by seyed mehdi raissian
    3 Dec 2001 A proof for Goldbach's conjecture , by Hamid V. Ansari
    4 Dec 2001 Re: A proof for Goldbach's conjecture , by Christian Bau
    6 Dec 2001 Re: A proof for Goldbach's conjecture , by Hamid V. Ansari
    6 Dec 2001 Re: A proof for Goldbach's conjecture , by Christian Bau
    7 Dec 2001 Re: A proof for Goldbach's conjecture , by Hamid V. Ansari
    7 Dec 2001 Re: A proof for Goldbach's conjecture , by Christian Bau 7 Dec 2001 Re: A proof for Goldbach's conjecture , by Paul Schlyter 6 Dec 2001 Re: A proof for Goldbach's conjecture , by Tony T. Warnock 7 Dec 2001 Re: A proof for Goldbach's conjecture , by Brian Chandler 7 Dec 2001 Re: A proof for Goldbach's conjecture , by Phil Carmody 10 Dec 2001 Re: A proof for Goldbach's conjecture , by Tony T. Warnock 10 Dec 2001 Re: A proof for Goldbach's conjecture , by Brian Chandler 10 Dec 2001 Re: A proof for Goldbach's conjecture , by Tony T. Warnock

    27. A Proof For Goldbach's Conjecture
    a topic from sci.math.numanalysis A proof for Goldbach s conjecture. post a message on this topic post a message on a new topic
    http://mathforum.org/epigone/sci.math.num-analysis/yoisnandnend
    a topic from sci.math.num-analysis
    A proof for Goldbach's conjecture
    post a message on this topic
    post a message on a new topic

    28 Feb 2001 A proof for Goldbach's conjecture , by Hamid V. Ansari
    28 Feb 2001 Re: A proof for Goldbach's conjecture , by Ken Cox
    28 Feb 2001 Re: A proof for Goldbach's conjecture , by Peter Percival
    19 May 2001 A proof for Goldbach's conjecture , by Hamid V. Ansari
    19 May 2001 Re: A proof for Goldbach's conjecture , by Jan Kristian Haugland
    26 Jul 2001 A proof for Goldbach's conjecture , by Hamid V. Ansari
    31 Jul 2001 Re: A proof for Goldbach's conjecture , by himadri mukherjee
    31 Jul 2001 Re: A proof for Goldbach's conjecture , by Rick Link
    31 Jul 2001 Re: A proof for Goldbach's conjecture , by Erk Jensen 1 Aug 2001 Re: A proof for Goldbach's conjecture , by Vit Drga 31 Aug 2001 A proof for Goldbach's conjecture , by Hamid V. Ansari 31 Aug 2001 Re: A proof for Goldbach's conjecture , by Gib Bogle 1 Dec 2002 A proof for Goldbach's conjecture , by Hamid V. Ansari 1 Dec 2002 Re: A proof for Goldbach's conjecture , by Christian Bau 2 Dec 2002 Re: A proof for Goldbach's conjecture , by David Harden 3 Dec 2002 Re: A proof for Goldbach's conjecture , by Hamid V. Ansari

    28. Mudd Math Fun Facts: Goldbach's Conjecture
    From the Fun Fact files, here is a Fun Fact at the Easy level Goldbach s conjecture. The Goldbach conjecture, dating from 1742, says that the answer is yes.
    http://www.math.hmc.edu/funfacts/ffiles/10002.5.shtml
    hosted by the Harvey Mudd College Math Department Francis Su
    Any Easy Medium Advanced
    Search Tips

    List All Fun Facts

    Fun Facts Home

    About Math Fun Facts
    ...
    Other Fun Facts Features

    1553359 Fun Facts viewed
    since 20 July 1999.
    Francis Edward Su
    From the Fun Fact files, here is a Fun Fact at the Easy level:
    Goldbach's Conjecture
    Here's a famous unsolved problem: is every even number greater than 2 the sum of 2 primes? The Goldbach conjecture , dating from 1742, says that the answer is yes. Some simple examples:
    What is known so far: Schnirelmann(1930): There is some N such that every number from some point onwards can be written as the sum of at most N primes. Vinogradov(1937): Every odd number from some point onwards can be written as the sum of 3 primes. Chen(1966): Every sufficiently large even integer is the sum of a prime and an "almost prime" (a number with at most 2 prime factors). See the reference for more details. Presentation Suggestions: Have students suggest answers for the first few even numbers. The Math Behind the Fact: This conjecture has been numerically verified for all even numbers up to several million. But that doesn't make it true for all N... see

    29. Goldbach's Conjecture
    Goldbach s conjecture. This conjecture claims that every even integer bigger equal to 4 is expressible as the sum of two prime numbers.
    http://db.uwaterloo.ca/~alopez-o/math-faq/node62.html
    Next: Twin primes conjecture Up: Unsolved Problems Previous: Collatz Problem
    Goldbach's conjecture
    This conjecture claims that every even integer bigger equal to 4 is expressible as the sum of two prime numbers. It has been tested for all values up to by Sinisalo.
    Alex Lopez-Ortiz
    Mon Feb 23 16:26:48 EST 1998

    30. Goldbach's Conjecture
    Goldbach s conjecture. © Copyright 2000, Jim Loy. The modern version of Goldbach s conjecture (called Goldbach s Strong conjecture) is this
    http://www.jimloy.com/number/goldbach.htm
    Return to my Mathematics pages
    Go to my home page
    Goldbach's Conjecture
    The modern version of Goldbach's Conjecture (called Goldbach's Strong Conjecture) is this: Every even number greater than 2 is the sum of two primes. Let's try a few:
    The conjecture is looking safe so far. Not only is each even number the sum of two primes, but the number of pairs of primes tends to increase. This trend seems to continue. But no one has ever proved that this goes on forever. All of the even number up to 400,000,000,000 have been tested, so far, with no exceptions found. Mathematicians have achieved some results in their efforts to prove (or disprove) this conjecture. In 1966, J. R. Chen showed that every sufficiently large even number is either the sum of two primes or of a prime and a near prime. A near prime is a number that is the product of two primes, like 91=7x13 or 4=2x2. No one knows just how large "sufficiently large" is. There is another Goldbach Conjecture, that every odd number greater than 5 is the sum of three primes. This is known as the Weak Goldbach Conjecture. This too has not been proved or disproved. It has been shown that if there are exceptions, then there are only a finite number of exceptions. A slightly different form of these conjectures was originally posed by Christian Goldbach, in 1742. Incidentally, if either Goldbach Conjecture is ever proven, then that would also prove that there are infinitely many primes. But we already knew that. See

    31. The Prime Glossary: Goldbach's Conjecture
    This pages contains the entry titled Goldbach s conjecture. Come explore a new prime term today! See Also odd Goldbach conjecture.
    http://primes.utm.edu/glossary/page.php?sort=GoldbachConjecture

    32. Goldbach's Sequence And Goldbach's Conjecture
    Goldbach s Sequence And Goldbach s conjecture by Huen YK CAHRC, PO.Box 1003, Singapore 911101 http//web.singnet.com.sg/~activweb/ Related URLsites http//web
    http://web.singnet.com.sg/~huens/paper43.htm
    Goldbach's Sequence And Goldbach's Conjecture
    by
    Huen Y.K.
    CAHRC, P.O.Box 1003, Singapore 911101
    http://web.singnet.com.sg/~activweb/
    Related URL-sites: http://web.singnet.com.sg/~huens/
    email: huens@mbox3.singnet.com.sg
    (A short communication - 1st released: 18/12/97)
    Abstract
    1. Introduction

    A very efficient way of weeding out unnecessary tests for noncontiguities in Goldbach's sequences, i.e. Goldbach(z), is to test only the high ends of Prime(z). This comes from a theorem on the contiguity of Odd(z)^2 in which it was proved that if the second largest odd integer is removed from Odd(z) before squaring, the resultant even integer sequence is never contiguous [11]. Since Prime(z) is a subset of Odd(z), we know that if Odd(z)^2 is not conitiguous then Prime(z)^2 of the same integer range will not be contiguous. This method is used here to extend the range of search for noncontiguous Goldbach(z) above 10^9. The method is determinstic on noncontiguities only. To determine contiguities, we still need to perform the full contiguity tests. 2. The Original Global Contiguity Tests

    33. (2) Brief History Of Goldbach's Conjecture
    (2). Brief History of Goldbach s conjecture. Goldbach s conjecture. Then, in 1728, he went to Moscow as tutor to Tsar Peter II. Goldbach s conjecture states
    http://web.singnet.com.sg/~huens/gbpage02.htm
    2). Brief History of Goldbach's Conjecture Goldbach's Conjecture
    In 1725 Goldbach became professor of mathematics and historian at St. Peterburg. Then, in 1728, he went to Moscow as tutor to Tsar Peter II. Goldbach's Conjecture states:
    Every even positive integer greater than 3 is the sum of two (not necessarily distinct) primes.
    Go back to Homepage.

    34. Goldbach's Conjecture Definition Meaning Information Explanation
    Goldbach s conjecture definition, meaning and explanation and more about Goldbach s conjecture. Free Goldbach s conjecture. definition
    http://www.free-definition.com/Goldbachs-conjecture.html
    A B C D ...
    Contact

    Beta 0.71 powered by:

    akademie.de

    PHP

    PostgreSQL

    Google News about your search term
    Goldbach's conjecture
    In mathematics, Goldbach's conjecture is one of the oldest unsolved problem s in number theory and in all of mathematics . It states:
    Every even number greater than 2 can be written as the sum of two primes . (The same prime may be used twice.)
    For example,
    etc.
    Inhaltsverzeichnis 1 Origins
    2 Results

    3 Trivia

    4 External links
    Origins
    In 1742, the Prussian mathematician Christian Goldbach wrote a letter to Leonhard Euler in which he proposed the following conjecture:
    Every number greater than 5 can be written as the sum of three primes.
    Euler, becoming interested in the problem, answered with a stronger version of the conjecture:
    Every even number greater than 2 can be written as the sum of two primes.
    The former conjecture is known today as the 'weak' Goldbach conjecture, the latter as the 'strong' Goldbach conjecture. Without qualification, the strong version is meant. Both questions have remained unsolved ever since.
    Results
    Goldbach's conjecture has been researched by many number theorists. The majority of mathematicians believe the (strong) conjecture to be true, mostly based on statistical considerations focusing on the

    35. Apostolos Doxiadis. Uncle Petros And Goldbach's Conjecture
    conjecture. Gebunden - 223 Seiten, Uncle Petros and Goldbach s conjecture. Faber Faber, 2001.
    http://www.lesekost.de/HHL154.htm
    Apostolos Doxiadis. Uncle Petros and Goldbach's Conjecture
    Nachdem ich von Simon Singhs Fermat's Enigma
    der Goldbachschen Vermutung Empfehlenswert. Bei Amazon nachschauen durch Klick aufs Bild Onkel Petros und die Goldbachsche Vermutung Uncle Petros and Goldbach's Conjecture

    36. Online Encyclopedia - Goldbach's Conjecture
    , Encyclopedia Entry for Goldbach s conjecture. Dictionary Definition of Goldbach s conjecture. Goldbach s......Encyclopedia
    http://www.yourencyclopedia.net/Goldbach's_conjecture.html
    Encyclopedia Entry for Goldbach's conjecture
    Dictionary Definition of Goldbach's conjecture

    Goldbach's Conjecture is one of the oldest unsolved problem in number theory and in all of mathematics . It states:
    Every even number greater than 2 can be written as the sum of two primes
    (The same prime may be used twice.) The conjecture had been known to Descartes . The following statement is equivalent and is the one originally conjectured in a letter written by Goldbach to Euler in
    Every number greater than 5 can be written as the sum of three primes.
    . The majority of mathematicians believe the conjecture to be true, mostly based on statistical considerations focusing on the probabilistic distribution of prime numbers : the bigger the even number, the more "likely" it becomes that it can be written as a sum of two primes. We know that every even number can be written as the sum of at most six primes. As a result of work by Vinogradov , every sufficiently large even number can be written as the sum of at most four primes. Vinogradov proved furthermore that almost all even numbers can be written as the sum of two primes (in the sense that the fraction of even numbers which can be so written tends towards 1). In

    37. PlanetMath: Goldbach's Conjecture
    Goldbach s conjecture, (conjecture). Goldbach s conjecture is owned by drini. full author list (3) owner history (1) . (view preamble).
    http://planetmath.org/encyclopedia/GoldbachsConjecture.html
    (more info) Math for the people, by the people. Encyclopedia Requests Forums Docs ... Random Login create new user name: pass: forget your password? Main Menu sections Encyclop¦dia
    Papers

    Books

    Expositions

    meta Requests
    Orphanage

    Unclass'd

    Unproven
    ...
    Corrections

    talkback Polls
    Forums
    Feedback Bug Reports downloads Snapshots PM Book information Docs Classification News Legalese ... TODO List Goldbach's conjecture (Conjecture) The conjecture states that every even integer is expressible as the sum of two primes In 1966 Chen proved that every sufficiently large even number can be expressed as the sum of a prime and a number with at most two prime divisors Vinogradov proved that every sufficiently large odd number is a sum of three primes. In 1997 it was shown by J.-M. Deshouillers, G. Effinger, H. Te Riele, and D. Zinoviev that assuming generalized Riemann hypothesis every odd number can be represented as sum of three primes. The conjecture was first proposed in a 1742 letter from Christian Goldbach to Euler and still remains unproved. "Goldbach's conjecture" is owned by drini full author list owner history view preamble View style: HTML with images page images TeX source See Also: prime Cross-references: Euler odd number generalized Riemann hypothesis divisors ... states There is 1 reference to this object.

    38. Factoids > Goldbach's Conjecture
    Susan Stepney s Home Page factoid indexGoldbach s conjecture. Goldbach s conjecture Every even number 4 is the sum of two odd primes.
    http://www-users.cs.york.ac.uk/~susan/cyc/g/goldbach.htm
    Goldbach's conjecture
    Goldbach's conjecture primes
    • 389,965,026,819,938 = 5,569 + 389,965,026,814,369 (and no decomposition with a smaller prime exists) Proof status g n p q n p q p q gives data on g n ), for n
    Goldbach's odd conjecture primes
    • decompositions easily generated from the even decompositions, by systematically subtracting primes Proof status : Proved under the assumption of the truth of the generalized Riemann hypothesis; remains unproved unconditionally for only a finite (but yet not computationally coverable) set of numbers.

    39. Goldbach's Conjecture :: Online Encyclopedia :: Information Genius
    Goldbach s conjecture. Online Encyclopedia Goldbach s conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states
    http://www.informationgenius.com/encyclopedia/g/go/goldbach_s_conjecture.html
    Quantum Physics Pampered Chef Paintball Guns Cell Phone Reviews ... Science Articles Goldbach's conjecture
    Online Encyclopedia

    Goldbach's Conjecture is one of the oldest unsolved problems in number theory and in all of mathematics . It states:
    Every even number greater than 2 can be written as the sum of two primes
    (The same prime may be used twice.) The conjecture had been known to Descartes . The following statement is equivalent and is the one originally conjectured in a letter written by Goldbach to Euler in
    Every number greater than 5 can be written as the sum of three primes.
    . The majority of mathematicians believe the conjecture to be true, mostly based on statistical considerations focusing on the probabilistic distribution of prime numbers : the bigger the even number, the more "likely" it becomes that it can be written as a sum of two primes. We know that every even number can be written as the sum of at most six primes. As a result of work by Vinogradov, every sufficiently large even number can be written as the sum of at most four primes. Vinogradov proved furthermore that almost all even numbers can be written as the sum of two primes (in the sense that the fraction of even numbers which can be so written tends towards 1). In

    40. ThinkQuest : Library : A Taste Of Mathematic
    Goldbach s conjecture. Goldbach s conjecture Every even integer n greater than two is the sum of two primes. This is easily seen to be equivalent to
    http://library.thinkquest.org/C006364/ENGLISH/problem/goldbach.htm
    Index Math
    A Taste of Mathematic
    Welcome to A Taste of Mathematics.You will find the taste of mathematics here.The history of Mathematics,famous mathematicians,cxciting knowledge,the world difficult problems and also mathematics in our life... Browsing,thinking,enjoying,and have a good time here! Visit Site 2000 ThinkQuest Internet Challenge Languages English Chinese Students fangfei Beijing No.4 High School, Beijing, China ziyan Beijing No.4 High School, Beijing, China Coaches Tife Zesps3 Szks3 Ogslnokszta3c9cych Numer 1, Beijing, China xueshun Beijing No.4 High School, Beijing, China Want to build a ThinkQuest site? The ThinkQuest site above is one of thousands of educational web sites built by students from around the world. Click here to learn how you can build a ThinkQuest site. Privacy Policy

    Page 2     21-40 of 93    Back | 1  | 2  | 3  | 4  | 5  | Next 20

    free hit counter