... Rewriting the conjecture into a bit more readable form, we get the following claim (where p[n] denotes n-th prime number): For n >= 10, if we express...
24345
Aldrich
aldrich617
Aug 2, 2012 5:21 pm
... In this example, if p was not known already known to be prime or even if it was a possible value of F(x,y), would the qfbsolve procedure prove it to be so...
24346
Sebastian Martin Ruiz
s_m_ruiz
Aug 2, 2012 8:07 pm
Hello all: Conjecture: Let p(n) the nth prime number n>1 There is a twin prime pair between p(n) and p(n+1+Floor[log[n]^ (2-1/Pi^2)]) ...
24347
whygee@...
yasep16
Aug 2, 2012 8:11 pm
... Hello, ... I'm curious about your thought process. Can you please provide more background ? what makes you think this is true, how did you come to this...
24348
bobgillson@...
bobgillson
Aug 2, 2012 8:19 pm
Very good. But surely you must prove the Twin Prime Conjecture first. . . Sent from my iPad ... [Non-text portions of this message have been removed]...
24349
whygee@...
yasep16
Aug 2, 2012 8:22 pm
... Sure. but I don't think that the Twin Prime Conjecture will hold long :-)...
24350
bobgillson@...
bobgillson
Aug 2, 2012 8:26 pm
Opinions are far more numerous than proofs Sent from my iPad ... [Non-text portions of this message have been removed]...
24351
Sebastian Martin Ruiz
s_m_ruiz
Aug 2, 2012 8:29 pm
I tried experimentalemte many values. I work with MATHEMATICA and modifying the formulas many timesĀ I looking for symmetry, beauty and simplicity. Respect to...
24352
bobgillson@...
bobgillson
Aug 2, 2012 8:52 pm
Now I am totally lost. . . Symmetry, beauty and simplicity may well demonstrate that the Twin Prime Conjecture is false. Until someone, somewhere, is able to...
24353
whygee@...
yasep16
Aug 2, 2012 8:53 pm
... certainly. however, I have been working on-and-off on this and see that it is not impossible. It just requires a LOT of work, collaboration and more...
24354
bobgillson@...
bobgillson
Aug 2, 2012 9:17 pm
As I said the conversation is futile, but good luck! Sent from my iPad ... [Non-text portions of this message have been removed]...
24355
Mark
marku606
Aug 2, 2012 11:23 pm
Very neat conjecture Aldrich which I well remember you posted before. I bet it could be proven. Upon a flippant and cursory examination, perhaps your...
24356
djbroadhurst
Aug 2, 2012 11:55 pm
... No. ... No. ... It depends crucially on the sign of the discriminant. In the case of G(x,y) = 2*x^2 + 2*x*y + y^2 = (x + y)^2 + x^2 with negative...
24357
Mark
marku606
Aug 3, 2012 12:46 am
If x and y are relatively prime, the conjecture would be modified to this: If A is the set of all numbers of the form 5x^2 + 5xy + y^2, with x and y...
24358
kad
yourskadhir
Aug 4, 2012 8:54 am
For a given odd composite N = pq where p & q is odd. without knowing value of p & q, Is there any algorithm to find floor value of q/p using N alone. Is it...
24359
kad
yourskadhir
Aug 4, 2012 5:56 pm
For a rsa challenge numbers N = pq where q > p what will be the range of floor value of q/p. As far for known factored rsa numbers what is the floor value of...
24360
Peter Kosinar
pkosinar
Aug 5, 2012 12:36 am
... You can easily check this yourself -- just have a look at http://en.wikipedia.org/wiki/RSA_numbers and calculate the ratios. A quick looks suggests that...
24361
Sebastian Martin Ruiz
s_m_ruiz
Aug 5, 2012 4:47 am
Conjecture: Let p(n) the nth prime number n>1 There is a twin prime pair between p(n) and p(n+1+Floor[log[n]^ w] w is a real number 1<w< 2 ...
24362
Sebastian Martin Ruiz
s_m_ruiz
Aug 5, 2012 4:52 am
large lists of twin primes would be interesting to someone with a powerful computer trying to refine the value of wfor n>n0 sufficiently large. Conjecture: ...
24363
Aldrich
aldrich617
Aug 5, 2012 3:16 pm
{A,x,y,F,m : positive integers} Consider for a moment the values of 'A' that are +/- 1 mod 10. Exclude all values of 'A' with Gcd(A,y) > 1, as well as all...
24364
Aldrich
aldrich617
Aug 5, 2012 3:16 pm
... Perhaps. I thought my statement more succinct though. ... Perhaps again, but I think its status will remain 'empirical observation' for quite some time....
24365
whygee@...
yasep16
Aug 5, 2012 10:06 pm
Hello, I have just found this article : http://www.math.ens.fr/culturemath/maths/articles/Bienvenu/the-prime-generating-algorithm.html The original french...
24366
Aldrich
aldrich617
Aug 6, 2012 9:07 am
... From the archives: qfbsolve(Q,p) Solve the equation Q(x,y) = p over the integers, where Q is a binary quadratic form and p a prime number. Return [x,y] as...
24367
Peter Kosinar
pkosinar
Aug 6, 2012 7:20 pm
... More succint? Yes. As strong? No. Mark's conjecture characterizes (a slightly different) set A fully (i.e. he describes what *is* and what *is not* in it),...
24368
Mark
marku606
Aug 7, 2012 4:49 am
... Nicely put. I'm scratching my head trying to figure out how or where I got the notion that the prime factors of the form +/- 1 (mod 10) were raised to odd...
24369
Aldrich
aldrich617
Aug 7, 2012 7:22 am
... In Philosophy, the term "presuppose" generally means that the truth of one Proposition depends partly on another that is not explicitly mentioned, so...
24370
Peter Kosinar
pkosinar
Aug 7, 2012 3:10 pm
... The main difference is that someone already *has found* a deductive proof of qfbsolve's algorithm correctness (proof of the fact that it always terminates...
24371
djbroadhurst
Aug 8, 2012 8:19 am
... In the case in question, it presupposes that Theorem 257 of Hardy and Wright is correct. Like many others, I believe that this is the case. David (per...
24372
James Merickel
moralforce120
Aug 9, 2012 12:09 am
I think that having gone through (at least) 5 editions and been scrutinized by all of the best number theorists in the world for the better part of a century...
24373
kad
yourskadhir
Aug 9, 2012 1:05 pm
In order to factorize a given 'N' with 'n' number of bits. The GNFS had a time complexity O(N) = exp( ((64/9)^(1/3) + 1)(ln n)^(1/3)(ln ln n)^(2/3) ) And i had...
