Forum: FactorDB
2017-11-14, 04:16
|
|
Replies: 1
Views: 1,391
bugreport: duplicate entries
These two entries seem to correspond to the same number:
http://factordb.com/index.php?showid=1100000000900935563
http://factordb.com/index.php?showid=1100000000902314000
Also, while this number...
|
|
Forum: Factoring
2013-12-09, 16:43
|
|
Replies: 10
Views: 2,510
|
|
Forum: Puzzles
2013-10-10, 04:17
|
|
Replies: 10
Views: 2,572
|
|
Forum: Wagstaff PRP Search
2013-10-10, 01:23
|
|
Replies: 7
Views: 8,073
|
|
Forum: Factoring
2013-10-09, 17:48
|
|
Replies: 507
Views: 71,427
|
|
Forum: Factoring
2013-10-07, 01:24
|
|
Replies: 10
Views: 2,510
|
|
Forum: FactorDB
2012-02-13, 04:06
|
|
Replies: 1,616
Views: 133,026
|
|
Forum: FactorDB
2012-02-13, 02:22
|
|
Replies: 1,616
Views: 133,026
|
|
Forum: Computer Science & Computational Number Theory
2012-01-31, 16:09
|
|
Replies: 138
Views: 13,817
should be ((p-1)!+1)/p \equiv H_{n-1} \pmod{p}...
should be ((p-1)!+1)/p \equiv H_{n-1} \pmod{p} for the order n generalized Wilson prime. So order 1 generalized Wilson primes are conventional Wilson primes, order 2 generalized Wilson primes are...
|
|
Forum: Computer Science & Computational Number Theory
2012-01-31, 12:48
|
|
Replies: 138
Views: 13,817
This is a nice search project. Do you maintain...
This is a nice search project. Do you maintain database of Wilson quotients modulo p in the search?
They would be helpful in finding other related primes such as generalized Wilson primes p of order...
|
|
Forum: FactorDB
2011-09-10, 19:22
|
|
Replies: 1,616
Views: 133,026
|
|
Forum: Math
2011-03-14, 11:41
|
|
Replies: 43
Views: 3,314
That's easy to prove.
Assume that...
That's easy to prove.
Assume that q=\gcd(2^a+2^b,n)>1. Since p is an odd prime and 2^p \equiv 1\pmod{q}, we have that 2^k \not\equiv -1\pmod{q} for all k. On the other hand, 2^a+2^b\equiv 0\pmod{q}...
|
|
Forum: Math
2010-10-13, 20:07
|
|
Replies: 44
Views: 4,329
Here are some more terms:
5, 29, 2045, 40133,...
Here are some more terms:
5, 29, 2045, 40133, 971837, 5063357, 7354397, 16554917, 17786525, 42244637, 52717277, 79704029, 84896957, 153424637, 262984997, 288644957, 328721213, 350252957, 353294757,...
|
|
Forum: Software
2010-10-04, 17:11
|
|
Replies: 18
Views: 1,139
|
|
Forum: Software
2010-10-04, 16:30
|
|
Replies: 18
Views: 1,139
In general we can assume L=1. The order of U/A...
In general we can assume L=1. The order of U/A (notice that the "step" A may be large, making it possible to reach larger U) is reasonable - 10^20 or so, as you mentioned. And, indeed, the sieve may...
|
|
Forum: Software
2010-10-03, 17:38
|
|
Replies: 18
Views: 1,139
|
|
Forum: Software
2010-10-03, 17:13
|
|
Replies: 18
Views: 1,139
AP26 is irrelevant. I'm not looking for primes...
AP26 is irrelevant. I'm not looking for primes forming an arithmetic progression, but primes in the given arithmetic progression (possibly with gaps between them). The latter problem is much simpler...
|
|
Forum: Software
2010-10-02, 17:23
|
|
Replies: 18
Views: 1,139
|
|
Forum: Software
2010-10-02, 16:40
|
|
Replies: 18
Views: 1,139
|
|
Forum: Software
2010-10-02, 14:14
|
|
Replies: 18
Views: 1,139
sieving primes in arithmetic progressions
Does there exist a fast optimized siever for finding primes in a given arithmetic progression?
That is, for given the parameters A, B along with the range [L,U], such siever should find and report...
|
|
Forum: FactorDB
2010-09-21, 01:06
|
|
Replies: 1,616
Views: 133,026
|
|
Forum: FactorDB
2010-09-20, 21:54
|
|
Replies: 1,616
Views: 133,026
|
|
Forum: FactorDB
2010-09-20, 21:44
|
|
Replies: 1,616
Views: 133,026
|
|
Forum: FactorDB
2010-09-20, 21:27
|
|
Replies: 1,616
Views: 133,026
Thanks, that's helpful
But n=100 seems to...
Thanks, that's helpful
But n=100 seems to produce only a couple of dozens id's ;(
Also, parameter maxdig would be helpful to avoid factorization of monsters.
On a different topic, could you...
|
|
Forum: FactorDB
2010-09-20, 17:41
|
|
Replies: 1,616
Views: 133,026
|
