Count to Fun - (Warning - Spam will be forcibly removed)

Ok, those threads are utterly inane. This one will be better. In this one, we will be multiplying our number by an integer greater than "1", then we will subtract "1" from our result. If the number we now have is prime, we will post it. If the number is not prime, we will not post anything until we have, by this process, found one that is.

2.

3

5

Wonderful, some takers.

19.

Um, let's see...

37

73.

is 28,387,583 a prime number?

28387584 is not a multiple of 73, so it is irrelevant. :notfair:

General Meevious wrote:

28387584 is not a multiple of 73, so it is irrelevant. :notfair:

I don't get you, so, i thought you have to multiply the previous number that the above person posted by that number, and then minusing it by 1. And then repeat that same process until you get a prime number, am I right?

:|

Eg.

(73x2)-1 ≠ prime (divisible by 5) ∴ do not post
(73x3)-1 ≠ prime (divisible by 2) ∴ do not post
(73x4)-1 ≠ prime (divisible by 3) ∴ do not post
(73x5)-1 ≠ prime (divisible by 2) ∴ do not post
(73x6)-1 ≠ prime (divisible by 19) ∴ do not post
(73x7)-1 ≠ prime (divisible by 2) ∴ do not post
(73x8)-1 ≠ prime (divisible by 11) ∴ do not post
(73x9)-1 ≠ prime (divisible by 2) ∴ do not post
(73x10)-1 ≠ prime (divisible by 3) ∴ do not post

... etcetera.

right i get it. I work with examples, without them, explaining it becomes unclear.

1021

8167.

16333