Problem Statement

Write a boolean function that tells whether a given integer is prime.

Remember that   1   and all non-positive numbers are not prime. Use trial division. Even numbers greater than   2   may be eliminated right away. A loop from   3   to   √ n    will suffice,   but other loops are allowed.

Let's start with the solution:

П0	1	-	x#0	34	2	-	/-/	x<0	32
ИП0	2	/	{x}	x#0	34
3	П4	ИП0	ИП4	/	{x}	x#0	34	КИП4	КИП4
ИП0	КвКор	ИП4	-	x<0	16	1	С/П	0	С/П