-
I'm using primes on 64bit system, and when it's working on values above 2^32, it generates numbers that are not really primes.
It was reported to ubuntu: https://bugs.launchpad.net/ubuntu/+source/bsd…
ghost updated
7 years ago
-
### Description
When running docker job in isolation mode "process" with new Intel processors (with Performance and Efficiency cores) only efficiency cores are being used.
OS: Windows 11
Processo…
-
```primesieve::iterator```'s performance depends heavily on the ```fillNextPrimes()``` method from ```PrimeGenerator.cpp```. For x64 we have a [vectorized AVX512 algorithm](https://github.com/kimwalis…
-
Use the following naming schema:
```
task-executor-stdout-1.txt
task-executor-stderr-1.txt
task-executor-stdout-2.txt
task-executor-stderr-2.txt
```
Currently, the exec_stdout intersperse…
-
Currently, as far as I can tell there is no way to use externally sourced prime numbers. If I use `primesieve` or some other method to make a bunch of prime numbers, but then I want to call `sqrtsMod…
-
Currently, memory usage of the prime sieve increases linearly with the size of the interval `[lo, hi]`, while the number of primes only grows asymptotically as `(hi) / log (hi)`. Furthermore, L1 memor…
-
I tried putting a barrier after each prime is broadcasted and after all are broadcasted by the generator and the two runs yield different results:
(one barrier at the end, commented code in the source…
-
Here's a list of PRs for new recipes that have been closed as stale, as of 2024-01-26.
These might serve as a good basis for another attempt at adding a recipe for these libraries.
- 3fd #2462
…
-
https://primes.utm.edu/howmany.html
재미로 나도 해봤는데 10억 이하의 소수 개수(50847534) 구하는데 8시간정도 걸렸다 ㅋㅋ
답이라도 맞아서 다행이다 ㅋㅋ
-
I am wondering how the interfaces to the factorization should be provided.
It should be as simple as possible doing only the basic things. Would it be
heavy to do something like in sage, creating a `…