I'm posing the question: Does this criteria always expose 2-pseudoprimes ??? (sorry if I'm not using the maths totally correctly) let 2^(Q-1) mod Q == 1 where...
This is an investigation of complex Lucas-type sequences, i.e. those with "P" and "Q" both Gaussian integers, with small P and Q, and in particular, of the...
... Hello Ali. Someone else, in a previous post, pointed out one way in which 1, the positive integral unit, is not primelike. Suppose b and c are two...
Hi All 452558752*2459#+n*359463429*2459#+1 (n=0-7) describes an AP8 of 1056-1057 digit primes. sieved n=0-2,000,000,000 538,430,975 prp tests 11,482,783 prps ...
my proofs... they just want me to use an alternate function instead of the *simga* so I can work around the 'monotonic' confusion. I especially like the...
This is an investigation of Lehmer sequences with small "R", and with "Q" = 1, and in particular, of the terms which are primes (or probable primes). Lehmer...
Having verified the first digits of 576 and 640, I am posting the first digits of the factors of the remaining RSA Numbers RSA 704 804457 920341 RSA 768 305380...
Dear All, Please advise me if there is an already names for following two groups of prime categrories. I would like to call primes that have digit sums...
From: jbrennen Date: 12/19/05 18:39:46 To: primenumbers@yahoogroups.com Subject: [PrimeNumbers] Re: Some philosophy about prime numbers To the best of my...
Hello Ali. It is futile to argue what a mathematical definition should be. The meaning of any word is determined by how that word is used. The number 1 is not...
Let n = 12*k+m, k >= 0, m <= 0 < 12. (1) Define A(n) = (4^n+1)/5. Prove that A(n) is never prime for n odd, n > 3. (2) Define B(n) = 2^n-(-1)^k*2^((n+1)/2) + 1...
(Generalised) Lucas sequences are described e.g. at http://mathworld.wolfram.com/LucasSequence.html Specifically, if P and Q are integers, and x is the more...
this probably isn't a mainstream topic and I'm sure someone will find something wrong with it, but... I don't know if a quasi-perfect number will ever be...
Enter your vote today! A new poll has been created for the primenumbers group: How hard is factoring - for instance, is it solvable with a polynomial time...
The following primenumbers poll is now closed. Here are the final results: POLL QUESTION: Which thread of prime number theory will solve the mystery of Prime...
Is there any quicker way of searching for Carmichael numbers other then testing with Fermat's little theorem for every b and then testing for primality through...
5. a general formula for the following Posted by: "san_tan1"; san_tan1@... san_tan1 Date: Thu Apr 2, 2009 5:15 am ((PDT)) is there any general formula...
5. a general formula for the following Posted by: "san_tan1"; san_tan1@... san_tan1 Date: Thu Apr 2, 2009 5:15 am ((PDT)) is there any general formula...
is there any general formula for triples (a,b,c) such that a,b are mutually prime and both odd and also a^2-b^2=c^2. ....(1)? also can this be extended to...
