Who can help me calculating up to 10 exact decimal places sum (1/n^(1-1/n) - 1/n) sum (1/p^(1-1/p) - 1/p) sum (ln(n) / n^2) sum (ln(p) / p^2) n=positive...
An interesting extension of Patrick De Geest's Table is where 10^n+p and p are both prime (the first instance) The table begins: n---------p ============= ...
miltbrown@...
Jul 5, 2007 2:26 pm
19021
... Patrick already has a list where 10^n-p1, 10^n+p2, n, p1 and p2 are all prime on his page http://www.worldofnumbers.com/index.html . Just search for...
maybe... let Z = 2^(2^(p+1))+1 ; p is prime Z is prime iff [Z (mod (2^p+1))] == 2^q ; for some q for p = 2, 3,..., next??? eg. p=2, 2^8+1 mod 5 == 2^1 and... ...
Thanks for evaluations received. What I mean is: Can sum(ln(n)/n^2 ~ 0.93 reach 1? Can sum(ln(p)/p^2 ~ 0.49 reach 0.5? WDS ... [Non-text portions of this...
Hello members ! Is it possible that exist a new prime-k-tuplet page ? Since some days, I can't reach http://www.ltkz.demon.co.uk/ktuplets.htm best -- Norman ...
Hello, ... Consider the inequality sum(ln(k)/k^2, k=A+1..infinity) < integral(ln(k)/k^2, k=A..infinity) The right-hand side can be evaluated as (ln(A)+1)/A....
What is the probability of a number being square free... it seems that the more square free numbers than the non-square free numbers for big numbers. Would be...
... The density of numbers being nth-powerfree is 1/zeta(n), where zeta is the Riemann Zeta Function. So, for squarefree numbers, we have your probability is...
I´d like to share a little concept for ACCOUSTICAL FACTORIZATION by using the relation between tones and overtones on strings, many guitarplayers might be...
Using a similar trick, one can verify the sum over the primes is strictly less than 0.5. One overestimates the tail end of the sum: sum(log(t)/t^2,t=p to 00,...
PHYSICS: Factoring Numbers with Waves Zubairy Science 27 April 2007: 554-555 DOI: 10.1126/science.1140915 Hugo Scolnik A wise man hears one word and...
I was searching for an interesting note I've read years ago. Here it is: http://www.mathpages.com/home/kmath222.htm Hugo Scolnik [Non-text portions of this...
Fine trick, but what makes you sure the integral is not e.g. = 0.008? Didn't you only shift the problem upon the integral? Werner ... [Non-text portions of...
... The integral can be evaluated explicitly, exactly as I did in my original post. I just didn't find this method "nice trick"-y enugh, as it required adding...
... 0.008? ... original ... required ... sum). ... is ... 1000, ... terms ... 0.5. ... You are quite right. I integrated only numerically. Everything clear. ...
Let p be a large prime, and g a generator of Z/pZ. Let u<p be non-zero modulo small prime q. From g^u (mod p), is it ever possible to tell anything more about...
Hello All, I generated the following fractal plot: http://www.isenbek.com based on the first 10,000 primes. I was wondering if anyone has seen this before, and...
The new version of RMA.NET, has been extensively tested, and is now ready for release. This windows program is by far the fastest prime number software ...
The divergence of sum(1/2^ln n) and sum(1/2^ln p) can easily be proven. How can be proven that sum(1/3^ln n) and sum(1/3^ln p) converge? (IF they do. What are...
... proven. ... the tail ... Thank you. Remains adding that the convergence radius r of sum(1/a^ln n) and sum(1/a^ln p) is r=a>e corresponding to the unity in...
We fill the array with it's index up to the length of the table. For example if we wish to use the Fermat prime number sieve to find the primes < 250, we set...
2^(2^m) + 1 mod prime 3 cannot divide any number in this series because (2 -1)^2 + 1 = 2 5 cannot divide any number in this series except 5 because (2 -...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
