I have been studying prime reciprocals in binary, but I am still fairly novice to number theory. I would like to understand if there is a proof for the...
... Information on /unique period primes/ should help you. Think about the process of performing the division by hand, and compare that to the concept of the...
Many thanks to everyone who made an effort to earn the prizes of CONTEST! AND CONTEST++, but the deadline is about to pass with no winning entries.If you are...
I've been experimenting with a couple of algortihms over the past few days and have developed a curious little program for generating sequential prime numbers,...
19193
miltbrown@...
Jan 3, 2008 3:42 pm
Perhaps this is a new constant for the Riemann Zeta function for prime numbers where it is written as the sum of sin, cos, and sum(-1)^r/r^(1/2) This constant...
hi. i need help with ubasic. how do i write a double loop properly... for example: for I=0 to 100 for J=0 to 100 if p(i,j)is true then cancel for,for: goto ......
Hi All, Not sure how to go about listing them but the TPS searchers have 2 more AP3's among their findings 01808289789*2^333333-1 100353 L212 Mar 2007 ...
... The loop itself is fine, but the values of I and J are available only within their respective loops yet your print statement is outside both.. I suggest...
From: primenumbers@yahoogroups.com on Behalf Of Ken Davis ... I wondered if anyone was checking those! These comments can only be added manually right now (if...
I was trying to discover what I thought should be a simple thing, about primes the other day. Is there a way of calculating, for any PI(x) (within reason),...
First of all, I can't use English well. However I believe one simple thing that mathematics's notes go through the whole world. I suggest some algorithm...
... about primes the other day. ... proportion in percentage terms the twin primes play their part? ... total primes. ... not to be repeated later. ... decline...
Generalization of difference of squares factoring. One method of searching for factors is to find A such that A^2 - z = c^2. Then having found A and C, we...
I discovered this simpler proof of the generalization that also gives added insight into its limitations. z = t^s - s^2 z + s^2 = t^2 z + s^2 - (t - A)^2 =...
i hope it isn't too much to ask help again...can you please help me convert this ubasic code to a pari/gp program... i always get errors:( 10 'algorithm for...
Hello, try this: 10 'algorithm for finding solutions to the equation -x^4+4*p*y^4= z^2' 20 input "Input p";Cc 30 for I=1 to 50000 40 for J=1 to 50000 ...
Congrats to Rich for his find: http://primes.utm.edu/primes/page.php?id=83650 with 999,997 decimal digits! He had previously found a 999,744 "digiter" for...
oh i meant that i want to write the ubasic program below in pari/gp since i believe it candle bigger numbers...:) ... Wissenswertes für Bastler und Hobby...
Hi Not sure about your Ubasic code but this sems to do what you want in pari. Even if it isn't it should help with your syntax problems \\ 'algorithm for...
OK, It was late in OZ try this instead \\ 'algorithm for finding solutions to the equation -x^4+4*p*y^4= z^2' { input(); forstep(ii=1,50000,1, print(ii); ...
And finally, you can include a forprime loop with with output to a file. The following does all primes < 1000 (limit on ii and jj =1000) cheers Ken \\...
Hello to all, my name is Lorenzo Nencini (from Italy), I made a discovery: I think I have found a sieve more better than "the Sieve of Eratosthenes". I am not...
... Ciao, Lorenzo! Se vuoi mostrarci la tua scoperta e ricevere commenti e cosiderazioni, basta inviarla in mailing list. Hi, Lorenzo! If you want to show your...
Define kv(w) as the number of primes that can be packed into an interval of 'w' consecutive integers. This value is not a maximum because denser patterns are...
Fixed typing errors and fixed links - sorry for repost. Define kv(w) as the number of primes that can be packed into an interval of 'w' consecutive integers....
to anyone, the number of Fermat 'primes' is finite... a subjective conclusion. Fermat 'primes' must satisfy two 'modulo' conditions, simultaneously, to exist. ...
