0
$\begingroup$

Are there any fast algorithms for multiplying consecutive prime numbers? I found this question about a pattern when multiplying consecutive primes. I was wondering if there is a multiplication algorithm just for prime numbers based on patterns.

$\endgroup$
2
  • 3
    $\begingroup$ For arbitrary prime numbers ("just for prime numbers") it just amounts to the fast multiplication of integers, I think. See here. $\endgroup$ Commented Dec 13, 2021 at 12:03
  • 1
    $\begingroup$ No, the multiplication cannot be accelerated by exploiting the patterns of the prime numbers , in particular because there is no general pattern between consecutive prime numbers. $\endgroup$
    – Peter
    Commented Dec 13, 2021 at 12:24

0

You must log in to answer this question.