Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Firoozbakht's_conjecture> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Firoozbakht's_conjecture abstract "In number theory, Firoozbakht’s conjecture (or the Firoozbakht conjecture) states that (where is the nth prime) is a strictly decreasing function of n, i.e.,Equivalently: Another equivalent statement is see OEIS A205827.The conjecture is named after Farideh Firoozbakht, from the University of Isfahan, who stated it in 1982. If this conjecture is true, then the prime gap function satisfies which is sharper than (hence implies) Cramér's conjecture Using a table of maximal gaps, the inequality can be verified for all primes below 4×1018.The conjecture is believed to be false, as it contradicts the Cramér–Granville heuristic. Pintz refers to this as MCM, the modified Cramér model.".
- Firoozbakht's_conjecture thumbnail Wikipedia_primegaps.png?width=300.
- Firoozbakht's_conjecture wikiPageID "36793030".
- Firoozbakht's_conjecture wikiPageRevisionID "606286198".
- Firoozbakht's_conjecture subject Category:Conjectures_about_prime_numbers.
- Firoozbakht's_conjecture comment "In number theory, Firoozbakht’s conjecture (or the Firoozbakht conjecture) states that (where is the nth prime) is a strictly decreasing function of n, i.e.,Equivalently: Another equivalent statement is see OEIS A205827.The conjecture is named after Farideh Firoozbakht, from the University of Isfahan, who stated it in 1982.".
- Firoozbakht's_conjecture label "Firoozbakht's conjecture".
- Firoozbakht's_conjecture label "حدسية فيروزبخت".
- Firoozbakht's_conjecture sameAs m.0ll339b.
- Firoozbakht's_conjecture sameAs Q5452148.
- Firoozbakht's_conjecture sameAs Q5452148.
- Firoozbakht's_conjecture wasDerivedFrom Firoozbakht's_conjecture?oldid=606286198.
- Firoozbakht's_conjecture depiction Wikipedia_primegaps.png.
- Firoozbakht's_conjecture isPrimaryTopicOf Firoozbakht's_conjecture.
