-
https://github.com/vnmakarov/mum-hash/blob/master/mum.h#L312-L320
There is no any guarantee, than `_mum_next_factor` will return prime number.
Neither it is guaranteed to be odd (but it looks like al…
-
I was just testing the app with some random prime numbers, and it literally does not work. I tried 2, 3, 5, and 7, and it detected it as a non prime number.
Does this fall under the 5% pot…
-
- [ ] Problem 1: Multiples of 3 and 5
- [ ] Problem 2: Even Fibonacci Numbers
- [ ] Problem 3: Largest prime factor
- [ ] Problem 4: Largest palindrome product
- [ ] Problem 5: Smallest multiple
…
-
# Feature Branch
Current feature branch for this issue: [not created yet](../tree/feature/issue-12345/projectname-branchversion).
## Progress
- [x] Implement Base58 Encode/Decode.
- [x] Impl…
-
Hola, es posible si nos pueden dar algunos números primos grandes (de 100 dígitos por ejemplo), para comprobar si nuestro algoritmo para el test de primalidad es correcto?
-
Checklist
- [X] Create `prime_numbers.py` ✓ https://github.com/psurabh/build_tools/commit/00c7b501633cedf696954286e71cc62bd551bec1 [Edit](https://github.com/psurabh/build_tools/edit/sweep/create_…
-
```python
In [4]: %time [[prime(n) for i in range(n)] for n in range(1, 10)]
CPU times: user 180 ms, sys: 7.68 ms, total: 187 ms
Wall time: 185 ms
Out[4]:
[[2], [3, 3], [5, 5, 5], [7, 7, 7, 7], …
-
I want to work on this problem for hacktoberfest 2020. Will you label this issue with it?
-
Grab what you want, mark it and make a PR. These exercises need updates:
- [x] allergies (@vaeng, #817)
- [x] anagram (@CadeMichael, #784)
- [x] armstrong-numbers (@ahans, #808)
- [ ] bank-accou…
vaeng updated
3 weeks ago
-