Prime

Правка en1, от grinding_codexp, 2024-08-01 18:52:24

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!

Теги primes, prime number, number theory, logarithmic time

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский grinding_codexp 2024-08-01 18:52:24 170 Initial revision (published)