-
Привет. Вот что я нашёл: https://catalog.lib.kyushu-u.ac.jp/opac_download_md/1434304/p145.pdf
Субэкспоненциальный алгоритм, вроде как. Можешь запрограммировать его?
-
Greetings.
Integer factorization using code such as this:
```
from sympy import primefactors
from timeit import default_timer as timer
start = timer()
print (primefactors(1111111111111111111…
-
- [x] Binary Search
- [x] Quicksort
- [x] Merge Sort
- [ ] Suffix Array
- [ ] Knuth-Morris-Pratt Algorithm (KMP)
- [ ] Rabin-Karp Algorithm
- [ ] Tries
- [ ] Depth First Traversal of a graph
- […
-
Hello, I'm new to writing Circom circuits and was wondering about the security status of this repository versus the [classic elgamal implementation repository](https://github.com/Shigoto-dev19/classic…
-
Hi,
I try to learn and I have to make some connections.
You have in the code below values:
P = 10177
A = 1
B = P-1
G = (1,1)
N = 10331
What should be the values in case of btc when I know th…
OSoup updated
5 years ago
-
```
factorint sometimes hangs forever, because the factors are very large. But it also finds small factors very quickly. If someone is only interested in checking factors for some property, and possib…
-
When computing a solution for a surd within a numerical expression, `solveset` appears to add in factoring of the surd. This can add a lot of time when the argument is large. `solve` does not do so an…
-
Jean-Luc,
At first clap your hands for our French Master!
Thank you for this great app.
An question...how does the multi pub key search work...does it searches sequentially (start searching f…
-
Hello.
I believe that after finding every consecutive prime factor, performing `isprime` on resultant is harmful for performance of such function. Consider such snippet:
```
number = reduce(*, 1, P…
-
From an example reported on the support list:
```
gap> Factors(998582188058818939);
Error, no method found! For debugging hints type ?Recovery from NoMethodFound
Error, no 1st choice method foun…