mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 260
Search took 0.05 seconds.
Search: Posts Made By: maxal
Forum: Msieve 2022-09-28, 02:18
Replies: 4
Views: 482
Posted By maxal
Then in my case they are waiting forever as the...

Then in my case they are waiting forever as the load never goes above 16 threads.
Forum: Msieve 2022-09-27, 15:30
Replies: 4
Views: 482
Posted By maxal
Not really. I have 20 cores, 2 threads per core,...

Not really. I have 20 cores, 2 threads per core, and so 40 (hyper)threads overall. Msieve utilizes only 16 threads while the other 24 are idling.
Forum: Msieve 2022-09-27, 14:29
Replies: 4
Views: 482
Posted By maxal
msieve claims to use 32 threads but uses only 16

I've noticed that while msieve 1.54 claims commencing Lanczos iteration (32 threads), in reality it uses only 16 threads (as system monitoring shows). What could be wrong?
Forum: Msieve 2022-09-20, 20:38
Replies: 0
Views: 532
Posted By maxal
factmsieve.py does not wait for completion of polynomial selection by msieve

I'm using factmsieve.py version 0.86, which for large enough numbers (with > 98 digits) performs polynomial selection with msieve. However, there must a bug, since while it runs a given number...
Forum: FactorDB 2022-09-20, 15:30
Replies: 49
Views: 5,223
Posted By maxal
I agree. Perhaps, it would be safe enough to...

I agree. Perhaps, it would be safe enough to provide an option to download just all big enough primes from the database, or maybe multiple options with varying lower bound for prime lengths.
Forum: FactorDB 2022-09-16, 22:14
Replies: 49
Views: 5,223
Posted By maxal
Thanks for the correction. Yes, I worry mostly...

Thanks for the correction. Yes, I worry mostly about the loss of data ("whole database") than about the domain or software. Although I'd not mind if the server software will go open source some day ;)
Forum: FactorDB 2022-09-16, 19:17
Replies: 49
Views: 5,223
Posted By maxal
long-term sustainability

I'm sorry if this was discussed before, but I have a concern about long-term sustainability of factordb.com
Some time ago I tried to find an option to download the whose database and did not find...
Forum: And now for something completely different 2021-12-16, 00:43
Replies: 151
Views: 41,541
Posted By maxal
Btw, a general formula of this kind is given in...

Btw, a general formula of this kind is given in Theorem 4.4 a recent preprint (https://arxiv.org/abs/2004.14000). It also shows how to efficiently compute the constant ala [$]C_6[/$] modulo a given...
Forum: FactorDB 2017-11-14, 04:16
Replies: 1
Views: 3,064
Posted By maxal
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: 3,232
Posted By maxal
To eliminate obvious cases with no solutions, I...

To eliminate obvious cases with no solutions, I suggest first to compute the multiplicative order $q$ (by factoring p-1 and eliminating its prime divisors as needed) of \alpha and test whether...
Forum: Puzzles 2013-10-10, 04:17
Replies: 10
Views: 3,669
Posted By maxal
If anybody still cares, here is a preprint about...

If anybody still cares, here is a preprint about solving Tower of Hanoi with random moves:
http://arxiv.org/abs/1304.3780
Forum: Wagstaff PRP Search 2013-10-10, 01:23
Replies: 7
Views: 11,904
Posted By maxal
It may be worth to point out the previous...

It may be worth to point out the previous discussion on this topic inspired by Anton Vrba's proposed proof: http://www.mersenneforum.org/showthread.php?t=10737
Forum: Factoring 2013-10-09, 17:48
Replies: 531
Views: 128,243
Posted By maxal
I've just got factorization of 102^103 + 1 =...

I've just got factorization of 102^103 + 1 = 103^2 * prp74 * prp130 with SNFS:
prp74 factor: 16577923085747542727498881886756397313868752518022676502052070512564532587
prp130 factor:...
Forum: Factoring 2013-10-07, 01:24
Replies: 10
Views: 3,232
Posted By maxal
See also http://www.cs.toronto.edu/~cvs/dlog/

See also http://www.cs.toronto.edu/~cvs/dlog/
Forum: FactorDB 2012-02-13, 04:06
Replies: 1,627
Views: 210,375
Posted By maxal
It would be nice if the engine was able to figure...

It would be nice if the engine was able to figure that out automatically. If I use it for factoring, I do not want to care about relationship of the input number to other numbers in the database, I...
Forum: FactorDB 2012-02-13, 02:22
Replies: 1,627
Views: 210,375
Posted By maxal
factordb may return incomplete factorization of a...

factordb may return incomplete factorization of a proper factor of a completely factored number.

E.g., for 10^486 - 1 it returns complete factorization (FF status), while for (10^486-1)/487 it...
Forum: Computer Science & Computational Number Theory 2012-01-31, 16:09
Replies: 138
Views: 22,876
Posted By maxal
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: 22,876
Posted By maxal
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,627
Views: 210,375
Posted By maxal
Is there a way to get the factorization of a...

Is there a way to get the factorization of a given number from factordb.com in plain text format to simplify parsing the result by a script?
Forum: Math 2011-03-14, 11:41
Replies: 43
Views: 4,886
Posted By maxal
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: 7,288
Posted By maxal
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: 2,642
Posted By maxal
I don't, the arithmetic progression (that is, the...

I don't, the arithmetic progression (that is, the constants A and B) is given.
Forum: Software 2010-10-04, 16:30
Replies: 18
Views: 2,642
Posted By maxal
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: 2,642
Posted By maxal
That may be a good idea, if there is no...

That may be a good idea, if there is no ready-to-use tool.
Another option is to adapt the PrimeGen tool http://cr.yp.to/primegen.html that uses sieve of Atkin.
Forum: Software 2010-10-03, 17:13
Replies: 18
Views: 2,642
Posted By maxal
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...
Showing results 1 to 25 of 260

 
All times are UTC. The time now is 09:20.


Thu Dec 8 09:20:38 UTC 2022 up 112 days, 6:49, 0 users, load averages: 1.00, 1.03, 1.06

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔