Le mardi 23 juin 2020 20:33:11 UTC+2, slelievre a écrit :
>
> Not sure why one would want the "first pair" each time.
>
> Below we define a function that produces an iterator
> yielding random prime pairs one after the other,
> with primes picked at random in a range ensuring
> their product will
Thank you.
On Friday, May 8, 2020 at 2:13:57 PM UTC-7, u220e wrote:
>
>
>
> Hi. I'm trying to generate a list of pairs of primes (x,y) within a range
> of values such that the digit length of their products is between 19 and
> 35. I've written a few different code variations that (unfortunatel
Not sure why one would want the "first pair" each time.
Below we define a function that produces an iterator
yielding random prime pairs one after the other,
with primes picked at random in a range ensuring
their product will have the correct number of digits.
```
def prime_pair_for_each_product_