Hello, Group. modifying the theorem... choose a odd 'n' such that 2^k +1 < n < 2*(2^k +1) for some k -- notice that this is different from Proth's notion that...
18375
leavemsg1
Sep 22, 2006 5:38 pm
... as ... 15) ! ... Oddly enough, 121 is a psuedoprime base 3 according to Sloane's list. ... when ... to ... classical 'p- ... 561 and ... theorem? ... be ...
18376
Paul Underwood
paulunderwooduk
Sep 22, 2006 6:17 pm
... Bill, is the 771st (?) Carmichael number a counterexample?: ? N=1657700353 1657700353 ? factor(N-1) [2 15] [3 2] [7 1] [11 1] [73 1] ? n=(N-1)/(2^15) 50589...
18377
Phil Carmody
thefatphil
Sep 23, 2006 8:55 am
There is a serious side to this, skip to the end if you don't want the silly story. 91 is not the only carmody prime - I've found a new one! 299. Like 91 it's...
18378
leavemsg1
Sep 24, 2006 9:15 pm
... No. The idea for testing any Proth-like number would be to subtract 1 and divide out 2 until only other prime factors existed, and then to compute the...
18379
Sebastian Martin
sebi_sebi
Oct 1, 2006 2:03 am
Hello all: Prove: (2^(2^(2^n))-1)/(2^(2^(n+1))-1) Is integer for all n positive integer. More general: Is true? (k^(k^(k^n))-1)/(k^(k^(n+1))-1) Is integer for...
18380
Phil Carmody
thefatphil
Oct 1, 2006 8:12 am
... Proof: n+1<=2^n QED. ... Proof: n+1<=2^n QED. Phil () ASCII ribbon campaign () Hopeless ribbon campaign /\ against HTML mail /\ against...
18381
Patrick Capelle
conjectureprime
Oct 1, 2006 6:36 pm
Hi all, You can find here two new conjectures : http://www.primepuzzles.net/conjectures/conj_049.htm The comments/proofs/counterexamples can be sent to Carlos...
18382
okyanusruhu
Oct 4, 2006 11:29 am
any aproaching answer to this question?...
18383
Patrick Capelle
conjectureprime
Oct 8, 2006 3:37 pm
Dear List, A few days ago i proposed two conjectures. Conjecture A : Every natural number n > 1 can be written as n = pq + rs, where p, q, r, s are primes or...
18384
danterosati
Oct 10, 2006 1:10 pm
Hi- I am a musician studying properties of the overtone, or harmonic series, and the question of the appearance of prime numbered partials in each octave of...
18385
Joshua Zucker
zucker
Oct 10, 2006 1:32 pm
... It seems to me that this conjecture is true, and your proof is valid, if you assume that primes are equally likely to consist of any digit? But while we...
18386
Patrick Capelle
conjectureprime
Oct 15, 2006 3:22 pm
... I added some comments to the following address : http://www.primepuzzles.net/conjectures/conj_049.htm Best regards, Patrick Capelle...
18387
Kaveh
kaveh_vejdani
Oct 16, 2006 8:18 am
Hi Everybody, There are roughly 2.4 x 10^17 primes in the range [10^18,10^19] and I need to find a random 5.5 x 10^10 of them. 1. Knowing that sieving is...
18388
Phil Carmody
thefatphil
Oct 16, 2006 9:39 am
... How do you know that sieving is prohibitively slow? Can you show me your comparison of the time it takes to generate a sequence of prime numbers using a ...
18389
Roahn Wynar
hahahahastay...
Oct 17, 2006 4:13 am
For those of you that are still interested: I know it has been a while, but I have updated the Integer-to-Image applet at https://home.comcast.net/~rwynar/. I...
18390
Phil Carmody
thefatphil
Oct 17, 2006 6:56 am
Brought back on-list with permission. ... Good - you've done your research - that sieve is a smart design. The C GPL code is not brilliant, but it's so simple...
18391
overlord_77520
Oct 17, 2006 11:51 pm
I have found a way to reduce RSA to polynomial time. Anyone Interested?...
18392
Robin Garcia
sopadeajo2001
Oct 17, 2006 11:52 pm
Here is a Pari program to find all the primes of the form a^2-2 ...
18393
Phil Carmody
thefatphil
Oct 18, 2006 12:56 am
... You've made a mistake; so no. Unless you're talking about encrypting or decrypting with knowledge of the appropriate key, in which case it's always been...
18394
Phil Carmody
thefatphil
Oct 18, 2006 1:17 am
... {u=3;m=4000;v=u+m;forstep(a=u,v,2,t=a^2-2;c=ceil(sqrt(t/2));for(n=c,a-2,s=2*n^2-t;if(issquare(s),next(2)));print(t))} ... This is not instantly obvious,...
18395
miltbrown@...
Oct 18, 2006 8:23 am
Yes, I am interested. I also have a method. You can see my messages to this list. However, I am sure that the "moderators" will not allow your messages. You...
18396
Sebastian Martin
sebi_sebi
Oct 18, 2006 5:42 pm
Hello all: Let z(n)=Sqrt[Product[Prime[i]^2-1,{i,1,n}]] I have found ONLY ONE integer value for z(n): z(3)=24 Can someone found other integer value for z(n)? ...
18397
Phil Carmody
thefatphil
Oct 21, 2006 12:21 am
I know this is good - as I actually understood much of it! /Elementary Number Theory/ - Uspensky and Heaslet. McGraw-Hill 1939 1) Elementary Properties of...
18398
Roger Lee Bagula
rlbagulatftn
Oct 23, 2006 10:43 pm
This procedure connects matrix representations to combinatorial trangular sequences in a direct manner! %I A000001 %S A000001 1, -1, 1, 0, -2, 1, 2, 2, -4, 1,...
18399
Phil Carmody
thefatphil
Oct 28, 2006 1:52 pm
Reservations and ranges at: http://83.143.57.194:16384/Factorial/ I've covered most of the historical reservations with a pseudo-id. There are some known...
18400
Patrick Capelle
conjectureprime
Nov 4, 2006 2:30 pm
Dear List, Three new conjectures are proposed here : http://www.primepuzzles.net/conjectures/conj_050.htm You can send your comments/proofs/counterexamples to...
18401
maartenvanthiel
Nov 6, 2006 7:36 pm
Hi all; Maarten van Thiel, northern Netherlands, but born in the south. I am not at all a mathematic, on the contrary, I worked as a chef for years, got...
18402
Phil Carmody
thefatphil
Nov 6, 2006 8:22 pm
... Welcome. ... A situation very similar to what you mention has already been met. Back in the days of only few prime hunter at universities with batch-jobs...
18403
Robin Garcia
sopadeajo2001
Nov 6, 2006 8:35 pm
A Pari program to find all primes 1 or 7 mod 8. For any k=1,2,3,4,5,....Choose the k value and the range u and m you want. Slow algorithm, though. Hope Phil...
