Gilbreath's conjecture
| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Bohus, Peter | |
| dc.creator | Károlyi, Márton | |
| dc.date | 2013-09-25T18:12:04Z | |
| dc.date | 2013-09-25T18:12:04Z | |
| dc.date | 2013-09-25 | |
| dc.date.accessioned | 2017-04-05T18:57:15Z | |
| dc.date.available | 2017-04-05T18:57:15Z | |
| dc.identifier | http://acervodigital.unesp.br/handle/unesp/70256 | |
| dc.identifier | http://objetoseducacionais2.mec.gov.br/handle/mec/22882 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/847803 | |
| dc.description | Educação Superior::Ciências Exatas e da Terra::Matemática | |
| dc.description | A surprising conjecture about the gaps between primes, namely: Let {p_n} denote the ordered sequence of prime numbers p_n, and define each term in the sequence {d_{1,n}} by d_{1,n}} = p_(n+1)- p_n, where n is positive. Also, for each integer k greater than 1, let the terms in {d_{k,n}} be given by d_{k,n}= |d_{k-1,n+1} - d_{k-1,n}|. Gilbreath's conjecture states that every term in the sequence a_{k}=d_{k,1} is 1. With this Demonstration you can check this amazing statement up to the 1000th difference series. The controls let you see the matrix of d_{k,n}, where k goes from k_min to k_max, and n goes from 1 to n_max (If k_min > k_max, they switch roles) | |
| dc.publisher | Wolfram demonstrations project | |
| dc.relation | GilbreathsConjecture.nbp | |
| dc.rights | DEmonstration freeware using MathematicaPlayer | |
| dc.subject | Números primos | |
| dc.subject | Educação Superior::Ciências Exatas e da Terra::Matemática::Teoria dos Números | |
| dc.title | Gilbreath's conjecture | |
| dc.type | Software |