Geometry.Net - Theorems_And_Conjectures: Conjectures


Home - Theorems_And_Conjectures - Conjectures

e99.com Bookstore

Images

Newsgroups

121-140 of 149 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Next 20

Conjectures: more books (100)

Transtheoretic Foundations of Mathematics, Volume 1C: Goldbach Conjecture by H. Pogorzelski, 1997-12
Nouvelles Conjectures Sur La Pesanteur (1690) (French Edition) by Pierre Varignon, 2009-08-27
Scientific Computations on Mathematical Problems and Conjectures (CBMS-NSF Regional Conference Series in Applied Mathematics) by Richard S. Varga, 1987-01-01
EARTHTALKS: CONJECTURES ON THE SPIRIT JOURNEY by Charles Finn, 2004-04-22
Repertory of Conjectures on Aeschylus by R.D. Dawe, 1965
Conjectures Sur les Memoires Originaux Dont Il Paroit Cue Moyse s'est Servi pour Composer le Livre de la Genese (French Edition) by Author Unknown, 2009-04-27
Conjectures Concerning The Identity Of The Patriarch Job, His Family, The Time In Which He Lived, And The Locality Of The Land Of Uz (1832) by Samuel Lysons, 2010-05-23
The Lifted Root Number Conjecture and Iwasawa Theory by Jurgen Ritter, Alfred Weiss, 2002-04-01
Eclaircissemens Sur Les Conjectures Physiques (1710) (French Edition) by Nicolas Hartsoeker, 2010-05-23
Hora Philolgica: Or, Conjectures On the Structure of the Greek Language by William Sewell, 2010-03-10
Introduction to the Baum-Connes Conjecture by Alain Valette, 2002-06-10
The World Displayed, Or, a Curious Collection of Voyages and Travels: Selected from the Writers of All Nations : In Which the Conjectures and Interpolations ... Every Relation Is Made Concise and Plain, an by Samuel Johnson, Oliver Goldsmith, et all 2010-01-01
America: or, A general survey of the political situation of the several powers of the western continent, with conjectures on their future prospects by Alexander Hill Everett, 2010-09-08
Surprise and the psycho-analyst;: On the conjecture and comprehension of unconscious processes, by Theodor Reik, 1937

lists with details

Mathematical Mysteries: The Goldbach Conjecture | Plus.maths.org
A brief popular article with an applet generating solutions.
http://pass.maths.org/issue2/xfile/

Extractions: Prime numbers provide a rich source of speculative mathematical ideas. Some of the mystical atmosphere that surrounds them can be traced back to Pythagoras and his followers who formed secret brotherhoods in Greece, during the 5th Century BC. The Pythagoreans believed that numbers had spiritual properties. The discovery that some numbers such as the square root of 2 cannot be expressed exactly as the ratio of two whole numbers was so shocking to Pythagoras and his followers that they hushed up the proof! Today, prime numbers are fascinating but they are also of commercial importance, since the best commercial and military ciphers depend on their properties. (See " Discovering new primes " in Issue 1 - it is yet to be proved that there are infinitely many Mersenne primes.) Here is another unproved conjecture about prime numbers. It is called the Goldbach conjecture and may be stated as follows:
The Hodge Conjecture
A description of the conjecture by Deligne (PDF) and details of the prize offered for its resolution.
http://www.claymath.org/prizeproblems/hodge.htm
MathWorld News: Draft Proof Of Catalan's Conjecture Circulated
News brief announcing the break through that provides a history and description of the equation.
http://mathworld.wolfram.com/news/2002-05-05/catalan/

Extractions: Discrete Mathematics ... Headline News May 5, 2002Today, in an email sent to the NMBRTHRY mailing list, number theorist Alf van der Poorten confirmed that an apparent proof of the long-outstanding Catalan's conjecture has been circulated to a group of mathematicians by number theorist Preda Mihailescu. The conjecture in question was made by Belgian mathematician in 1844, and it states that 8 and 9 (2 and 3 ) are the only consecutive powers excluding and 1. In other words, Catalan conjectured that is the only nontrivial solution to the so-called Catalan's Diophantine problem x p y q three consecutive powers existed (Ribenboim 1996), Catalan's conjecture itself has stubbornly refused attack for more than a century and a half. The first groundbreaking result was that of Robert Tijdeman (1976), who showed that there can be at most a finite number of exceptions should the conjecture not hold. This led to considerable computational efforts, and in 1999, Maurice Mignotte showed that if a nontrivial solution exists, then 10 p and 10 q (Peterson 2000).
Goldbach Conjecture Verification
Computational results up to 3.10^17 and graphics by Tom s Oliveira e Silva.
http://www.ieeta.pt/~tos/goldbach.html

Extractions: Introduction News Results Top 50 ... [Up] The Goldbach conjecture is one of the oldest unsolved problems in number theory [1, problem C1] . In its modern form, it states that every even number larger than two can be expressed as a sum of two prime numbers. Let n be an even number larger than two, and let n=p+q , with p and q prime numbers, , be a Goldbach partition of n . Let r(n) be the number of Goldbach partitions of n . The number of ways of writing n as a sum of two prime numbers, when the order of the two primes is important, is thus R(n)=2r(n) when n/2 is not a prime and is R(n)=2r(n)-1 when n/2 is a prime. The Goldbach conjecture states that , or, equivalently, that , for every even n larger than two. In their famous memoir [2, conjecture A] , Hardy and Littlewood conjectured that when n tends to infinity, R(n) tends asymptotically to (i.e., the ratio of the two functions tends to one) n p-1 N2(n) = 2 C PRODUCT - , twin (log n)(log n-2) p odd prime p-2 divisor of n where p(p-2) C = PRODUCT - = twin p odd prime (p-1)^2 is the twin primes constant. In
Proof Of The Goldbach Conjecture By Kerry M. Evans
This article by Kerry M. Evans attempts to show that the proposition is correct as a consequence of Wilson s Theorem.
http://goldbach.yolasite.com/

Extractions: Proof of the Goldbach Conjecture by Kerry M. Evans Dedicated in dear memory of my Father Dr. Roy L. Evans Nearly two-hundred, seventy years have lapsed since Christian Goldbach proposed (in 1742) that every positive even Integer, not 2, can be expressed as the sum of two primes. This manuscript shows that the proposition is correct as a consequence of Wilson’s Theorem. Little effort will be required to understand the proof as it is not complicated. Many attempts have been made to solve the problem over the years. So the author must acknowledge that it is only by a stroke of good fortune that this “discovery,” as simply and straightforwardly as it presents itself, is the result only of astute observation. The method of proof is simple once the preliminary groundwork is presented. SECTION I The first section is begun with the statement of a version of Wilson’s Theorem. As the method rests nearly entirely on the development of this theorem, there must be little doubt as to its’ few limitations. Wilson’s Theorem has been known for a long time.
Celebrity Gossip By Derek Hail — Celebrity Gossip, Celebrity Pictures, And Hot
Discussion of rumors and conjecture, with a humorous twist to the lives of celebrities, movie reviews, and fashion.
http://www.derekhail.com

Extractions: ggv2id = "derekhai"; Celebrity Gossip by Derek Hail October 28, 2010 My last Emmanuelle Chriqui picture from the Sharp magazine photoshoot ( sigh Then check out these luscious links: October 28, 2010 Rihanna brought her girls out (kinda) for Marie Claire . Could be better, could be worse. Once you get over that damn Ronald McDonald hair of hers, at least. What the HELL is she (or her hair stylist) thinking Rather than imitate Lady Gaga, maybe you should copy Madonna and do a coffee table book posing nude. some imitation I could get behind! October 28, 2010 This chick is simply physically gifted. Blessed. And we are all grateful. Now if Candice could just hook up with Playboy October 27, 2010 Miranda Kerr is wasted in Glamour Check out these luscious links: October 27, 2010 Oh, yeah, baby! Meet Melissa Sata. As you can see, she has done one hell of a steamy photo spread with
MYSTERIES: FACT, FICTION AND CONJECTURE
Provides accounts of many of the world s greatest mysteries.
http://www.factfictionandconjecture.ca
CONjecture 2011
Annual science fiction and fantasy convention with an emphasis on literary programming and events. Held in San Diego.
http://www.conjecture.org
Broue's Abelian Defect Group Conjecture
A record of which groups and blocks have been proved to satisfy the conjecture, maintained by Jeremy Rickard.
http://www.maths.bris.ac.uk/~majcr/adgc/adgc.html

Extractions: The main purpose of these pages is to keep an up-to-date record of which groups and blocks have been proved to satisfy the conjecture. This is very much a first draft, and I would very much appreciate any corrections and additions. You can email me at In particular, I would be grateful for In compiling the bibliographies, I made extensive use of MathSciNet to collect references in BibTeX format, and of to create the web pages.
Beal
An elementary proof of Beal s Conjecture given the proof of Fermat s Last Theorem.
http://beal.yolasite.com/

Extractions: ON THE FULL BEAL CONJECTURE The purpose here is to confirm Beal’s Conjecture, specifically as a consequence of Fermat’s Last Theorem (FLT) and a defining transform, T used to generalize the problem, all in context with conditions necessary to uniquely describe the values of all supposed solutions. Consider the sum of a and b which is now unspecified: a + b a and b can be “cross-defined,” (one in terms of the other) by the transform T: a to b m b to a n with m and n greater than 2 subject to the specification p q T a b b m + a n p q which is the general representation of Beal’s Conjecture when equivalence on the right is negated. T may reapplied such that it does nothing to change the conditions on a and b. Reapplying T: T a + b = T( b m + a n b mn a mn p q The latter is possible only when a = b = 2 (see: http://fermat.yolasite.com ), in which case, 2 mn mn mn+1 Now let m n p q and further, Then m-n m-n p q n again see: http://fermat.yolasite.com Otherwise, 2 r r r+1 which is factorable to 1 z z = 2 where a = b = 1 while p q is reduced to 2. In all other cases a , b and p are factorable such that the general representation fails to hold.
The Prime Glossary: Catalan's Problem
Entry in the Prime Glossary with description, brief history and references.
http://primes.utm.edu/glossary/page.php?sort=CatalansProblem
A New Extreme ABC-example
Explanation of an example with quality 1.920859, found by Benne de Weger and Niklas Broberg.
http://deweger.xs4all.nl/oud/broberg.txt
[math/0312309] The Collatz 3n+1 Conjecture Is Unprovable
A paper by Craig Alan Feinstein arguing that the Collatz Conjecture cannot be formally proved.
http://arxiv.org/abs/math.GM/0312309

Extractions: new recent what is this? Authors: Craig Alan Feinstein (Submitted on 16 Dec 2003 ( ), last revised 4 May 2006 (this version, v16)) Abstract: In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible. We also give an informal argument that the Riemann Hypothesis is also unprovable. Comments: 3 pages. Modified the proof of Theorem 2 Subjects: General Mathematics (math.GM) MSC classes: Cite as: arXiv:math/0312309v16 [math.GM] From: Craig Alan Feinstein [ view email
Goldbach Summary
Biography, with links to other Goldbach resources.
http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Goldbach.html

Extractions: Christian Goldbach was a Prussian mathematician best known for the conjecture he made in a letter to Euler that every even integer > 2 is a sum of two primes. Full MacTutor biography [Version for printing] List of References (14 books/articles) Mathematicians born in the same country Show birthplace location Other Web sites Encyclopaedia Britannica The Prime Pages (Goldbach's conjecture) J Richstein including Goldbach's letter to Euler Linda Hall Library (Star Atlas) Previous (Chronologically) Next Main Index Previous (Alphabetically) Next Biographies index JOC/EFR � August 2006 The URL of this page is:
Clay Mathematics Institute
A Clay Mathematics Institute Prize problem, with description by Andrew Wiles PDF and lecture by Fernando Rodriguez-Villegas .ram.
http://www.claymath.org/millennium/Birch_and_Swinnerton-Dyer_Conjecture/
Novikov Conjecture Home Page
An archive of developments concerning the Novikov Conjecture and related problems in Algebraic Topology, General Topology, Geometry, Algebra, and Analysis. Maintained by Jonathan Rosenberg.
http://www.math.umd.edu/users/jmr/NC.html

Extractions: The intended function of this home page is to keep you up-to-date on the latest developments concerning the Novikov Conjecture and related problems in topology, geometry, algebra, and analysis. Further contributions of all sorts are welcome. Please send them to Jonathan Rosenberg at jmr@math.umd.edu This bibliography is based on the one in "A history and survey of the Novikov Conjecture" by Steve Ferry, Andrew Ranicki, and Jonathan Rosenberg. The original version appeared in volume 1 of "Novikov Conjectures, Index Theorems and Rigidity" (listed below under books) but we will try to update it regularly. To view the dvi file (approx. 80kb), click here . For a tar'ed dvi file (better suited for downloading), click here "Novikov Conjectures, Index Theorems and Rigidity," co-edited by Steve Ferry, Andrew Ranicki, and Jonathan Rosenberg, London Math. Soc. Lecture Notes, vols. 226 and 227 (approx. 380 pages each), Cambridge Univ. Press,
Goldbach's Conjecture And Factoring The Cryptographic Modulus
Algebraic Factoring of the Cryptography Modulus and Proof of Goldbach s Conjecture
http://www.coolissues.com/mathematics/Goldbach/goldbach.htm

Extractions: ALGEBRAIC FACTORING OF THE CRYPTOGRAPHY MODULUS AND PROOF OF GOLDBACH'S CONJECTURE James Constant math@coolissues.com Solving an Algebraic Quadratic Equation Factors the Cryptographic Modulus p=ab of Prime Numbers a and b and Proves Goldbach's Conjecture Introduction In the RSA cryptographic system a user chooses a pair of prime numbers a and b so large that factoring the product (modulus) p=ab is beyond all projected computing capabilities. As of 1984, the consensus was that a and b need to be about 75 decimal digits in size, and so p was roughly a 150-digit number. Since the largest hard numbers that could then be factored were 80 digits or less in size, and since the difficulty of factoring grows exponentially with the size of the number, 150 digits appeared cryptosecure for the foreseeable future. In 1996, a 130 digit number was factored and cryptographers talked about 100 digit prime numbers and 200 digit moduli. Today, some suggest 1024 and 2048 digit moduli. Goldbach's conjecture (GC) suggests that every even number greater than is the sum s of two prime numbers a and b , i.e.
Losing The Dressing Room
Blog covering football news and conjecture.
http://ltdr.blogspot.com/

Extractions: Football (soccer) conjecture, blatherings, stuff and nonsense The World Is Watching - a World Cup 2010 blog posted by Simon at 8:42 PM 19 comments but... who'd like to be involved in this year's World Cup group blog? It's going to start, hopefully, on 3rd March, 100 days before the first game, and during the tournament your regular interaction will of course be especially required. Highly recommended reading: Broken TV covers The Big Match Replayed posted by Simon at 10:39 PM 58 comments As you can tell, what with Sweeping The Nation, other online ventures and trailing in a distant third 'life', we haven't been updating Losing The Dressing Room a lot recently. We're loathe to just abandon it, so... do you want to join in? We're looking for co-maintaners for this blog to help us keep its mix of informed comment, uninformed whimsy and YouTube embeds that only really amuse us ticking over. (And, with a World Cup next year, also looking ahead to taking part in another seperate tournament spectacular) Email address is up there on the right. No time wasters.
BLDGBLOG
Los Angeles-based writer Geoff Manaugh provides architectural news and conjecture, heavily illustrated.
http://bldgblog.blogspot.com/
The N! Conjecture
Offers outline of the problem, bibliography, and math tables. Resources assembled by Fran ois Bergeron.
http://bergeron.math.uqam.ca/conjecture_fact.html

Extractions: For more information on the Garsia-Haiman conjecture (also known as the n! conjecture) stating that the bigraded Frobenius characteristic of the modules mentioned above is closely related to Macdonald polynomials The study of similar questions for diagonal harmonics is linked to the study of the nabla operator , which can be used to define a (q,t)-analog of the Catalan polynomials Also available, tables of small values of the bigraded Frobenius characteristic of the modules mentioned above, as well as some of Macdonald q,t-Kostka coefficients appearing as coefficients of Macdonald polynomials when expanded in the Schur polynomial basis.

121-140 of 149 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Next 20