Posts by None • 23 points
1 post
-
2
votes2
answers427
viewsQ: python 3, exercise with prime numbers
The smallest m such that n · m + 1 don’t be a cousin. Example: For the first example, 3 · 1 + 1 = 4, the exit will be 1. For the second example, 4 · 1 + 1 = 5, we can’t print 1 because 5 is cousin.…