π Example 6.1.1. πA number is called prime if its only divisors are 1 and itself. πThis definition has some hidden parts: a more complete definition would be as follows. π πA number is called prime if πit is an integer, πit is strictly greater than ,1, and πthere does not exist any other number greater than 1 which divides it.
π Worked Example 6.1.2. πDemonstrate that, according to the technical definition of prime, 17 is prime but 21 is not. Solution. Let us test .17. Yes, 17 is an integer. Yes, .17>1. None of the numbers in the following list is an integer: .172,173,174,β¦,1716,1718,1719,β¦. So 17 is prime since it passes the technical tests that define the concept of prime. Now let us test .21. Yes, 21 is an integer. Yes, .21>1. However, clearly 21/3=7 is an integer, so 3 divides .21. So 21 is not prime, since it fails at least one of the technical tests that define the concept of prime.
π Proposition 6.1.3. πSuppose n is an integer with .nβ₯2. Then n is prime if and only if n/m is not an integer for every integer m with .2β€m<n2.
π Worked Example 6.1.4. πDemonstrate that 17 is prime. Solution. (Sketch) By the proposition, to check that 17 is prime we now only need to note that none of the numbers in the following shorter list is an integer: .172,173,174,β¦178.