First  |  Prev |  Next  |  Last
Pages: 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86
proof of Infinitude of Twin Primes does not yield proof for primes N +2k for k >1; #656 Correcting Math
Alright, I made a series of mistakes in the last several posts, starting off by thinking that the method that proves infinitude of Twin Primes is going to prove Quad Primes, then N+6 primes then etc etc. When caught in confusion, it is best to walk away from it and let the mind settle down, and piece things to... 12 Jul 2010 19:38
Alright, resolved, this method is only good for a Twin Prime proof #655 Correcting Math
> Now what could save the above: (5) Successively divide all the primes in the sequence S into W+3 and W-3 and they all leave a remainder but I also need to consider primes from 11 out to 27 and they are 13, 17, 19, and 23 Is that somehow, if 13, 17, 19, and 23 were prime factors of W+3 = 773 ... 12 Jul 2010 16:17
polynomial with rational coefficients and integer values
Let be P(x) = Sum(a(k)*x^k, k=0 .. N) a polynomial function, where the a(k) are rational numbers. I am looking for a 'handy' criterion when P maps integers to integers - say 'true for enough integers or large primes then yes' or so (sorry for being vague). Certainly something known for that (probably it is cla... 16 Jul 2010 04:29
a second patch onto the square-root patch?? #654 Correcting Math
Archimedes Plutonium wrote: Archimedes Plutonium wrote: Archimedes Plutonium wrote: (snipped) There maybe a sticking point about this proof procedure for large even numbered prime pairs such as say p_n and p_n+1000, that we may have to have some more qualifiers... 12 Jul 2010 16:17
method only works for Twin Primes?? and not for N+4 nor N+6 or beyond? #653 Correcting Math
Archimedes Plutonium wrote: Archimedes Plutonium wrote: (snipped) There maybe a sticking point about this proof procedure for large even numbered prime pairs such as say p_n and p_n+1000, that we may have to have some more qualifiers to impose the Square Root Patch, due to the la... 12 Jul 2010 15:10
DIV and GRAD of a MATRIX 3x3
how can i compute DIV of a matrix U_ij (x,y) for i,j=1,2,3 and x,y in R^3 is it the sum of the elements of the partial deriv. of each column or row?? the DIV_x is diferrent from DIV_y ?? ... 12 Jul 2010 15:10
square-root eliminator works for all even separated primes, for example N+4 primes #652 Correcting Math
Archimedes Plutonium wrote: (snipped) There maybe a sticking point about this proof procedure for large even numbered prime pairs such as say p_n and p_n+1000, that we may have to have some more qualifiers to impose the Square Root Patch, due to the large spread between the n and even numbe... 12 Jul 2010 15:10
A trinom equality ...
Good afternoon, Some years ago while working with iterates I fell upon : T[n+1](x) +(r1-r2)^2/4 = (T^[n](x) - (r1+r2)/2 )^2 T(x) a trinom (x-r1)*(x-r2) , T^[n](x) its nth iterate , Example: T(x) = (x-2)*(x-4) = x^2-6x+8 T^[2](x) = (x^2-6x+8-2)*(x^2-6x+8-4) = (x^2-6x+5)^2 - 1 When r1 and r2 same parity, ... 12 Jul 2010 14:03
Are space and time separate issues that can be treated in a parallel way.
On Sun, 11 Jul 2010 20:07:40 -0700, Immortalist wrote: If there is a arrow of time is there a arrow of space? Or.. what's the point? Is space independent of objects or imagined parameter (eg: point) a space is between? If not, space is object dependent, it is as objects define it. There is one but us... 12 Jul 2010 12:56
A conjecture involving Goldbach and twin primes
Let 2n be an even number larger than 4 such that 2n - 1 and 2n + 1 are prime. Conjecture: 2n can be written as the sum of two primes in a way that both primes are members of twin prime pairs. For example: 6 = 3 + 3 12 = 5 + 7 18 = 7 + 11 30 = 11 + 19 42 = 11 + 31 I've gone up to 2n = 1290 with... 16 Jul 2010 12:08
First  |  Prev |  Next  |  Last
Pages: 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86