101. Some Open Problems Spinrad) Can you recognize transitive graphs in less time than it takes to perform the transitive closure of the graph, or are these problems provably of the http://www.vuse.vanderbilt.edu/~spin/open.html

Send comments or new problems to include to spin@vuse.vanderbilt.edu

102. E-Tutor | Universe Of Learning ... E-Tutor Homeschool Anytime, Anywhere, Everyday Learning eTutor offers students, parents and educators the vision, tools and resources for initiating and implementing technology http://www.e-tutor.com/

Anytime, Anywhere, Everyday Learning e-Tutor offers students, parents and educators the vision, tools and resources for initiating and implementing technology-rich, activity-based learning. e-Tutor lessons have been created to provide a superior learning experience. Access ID Password System Requirements Contact Us Careers Site Map ... Help Strategic Studies Corporation is member of the BBB Online Reliability Program as well as a member of the Better Business Bureau of Chicago and Northern Illinois.

103. Prime Conjectures And Open Question See Ribenboim95 and Wang84 for more information. The Odd Goldbach Problem Every odd n 5 is the sum of three primes. There http://www.utm.edu/research/primes/notes/conjectures/

Prime Conjectures and Open Questions (Another of the Prime Pages ' resources) Home Search Site Largest The 5000 ... Submit primes Below are just a few of the many conjectures concerning primes. Goldbach's Conjecture: Every even n Goldbach wrote a letter to Euler in 1742 suggesting that . Euler replied that this is equivalent to this is now know as Goldbach's conjecture. Schnizel showed that Goldbach's conjecture is equivalent to distinct primes It has been proven that every even integer is the sum of at most six primes [ ] (Goldbach's conjecture suggests two) and in 1966 Chen proved every sufficiently large even integers is the sum of a prime plus a number with no more than two prime factors (a P ). In 1993 Sinisalo verified Goldbach's conjecture for all integers less than 4 ]. More recently Jean-Marc Deshouillers, Yannick Saouter and Herman te Riele have verified this up to 10 with the help, of a Cray C90 and various workstations. In July 1998, Joerg Richstein completed a verification to 4

Page 6     101-103 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6