## Task 1 - 110821
Prove the following statement:
If is a prime number greater than 3, then exactly one of the numbers is divisible by 6.
## Task 1 - 110821
Prove the following statement:
If is a prime number greater than 3, then exactly one of the numbers is divisible by 6.
## Preliminary Considerations:
Definition of Prime Number: A prime number is a number that is only divisible by 1 and itself.
Divisibility Theorem: If a number is divisible by 2 and by 3, then it is also divisible by 6.
Therefore, one must prove that either or is divisible by 2 and by 3 to prove that either or is divisible by 6.
Divisibility by 2:
is a prime number and greater than 3, so it cannot be divisible by 2, as a prime number is only divisible by 1 and itself. Since every second number is divisible by 2, the neighboring numbers of ( and ) must both be divisible by 2.
Divisibility by 3:
cannot be divisible by 3 according to the definition of prime numbers (see above), since is a prime number. If we assume that is not divisible by 3, then must be divisible by 3, as every third number is divisible by 3. This also applies to if is not divisible by 3. Therefore, either or is divisible by 3.
Since and are divisible by 2 and either or is divisible by 3, either or is divisible by 6.