Hello codeforces!
I have a question about prime numbers. Is there a way to determine whether an integer is a prime or not in O(log(n)) time complexity?
Thanks!
Prime
Hello codeforces!
I have a question about prime numbers. Is there a way to determine whether an integer is a prime or not in O(log(n)) time complexity?
Thanks!
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
grinding_codexp | 2024-08-01 18:52:24 | 170 | Initial revision (published) |