NUMBERTHEORY-EXERCISESONPRIMENUMBERS

01–Find the five smallest primes of the form n2-2.

Solution:
The only pair that can take is two because 22-2 = 2 (2 is prime).
Any other even value for n, n2-2 will be even because
2
n is even.⇒ it is even and, consequently, not
it will be first.
Thus, we must to test for > 2, os values odd.
For = 3 ⇒ n2 – 2 = 32 – 2 = 9 – 2 = 7 (é first)
For n = 5 ⇒ n2 – 2 = 52 – 2 = 25 – 2 = 23 (é first)
For n = 7 ⇒ n2 – 2 = 72 – 2 = 49 – 2 = 47 (é first)
For n = 9 ⇒ n2 – 2 = 92 – 2 = 79 – 2 = 79 (é cousin
Resposta:2, 7, 23, 47 e 79.

Find three odd primes whose sum is:

(a) 81.
Solution: Since they are odd primes, we cannot use 2. By consulting the table we find:
17, 41, 23), (13, 31, 37), (3, 37, 41), (11, 23, 47), (3, 7, 71), (3, 61, 17).
(b) 125
Solution: Consulting the table: (97, 11, 17), (97, 5, 23), (89, 23, 53), (89, 71, 5). There are
several others. To make the search easier, calculate 125 - the prime number less than 125.
Then two more cousins are sought whose sum equals the obtained difference.

03 – Pickle all us couples of cousins p e q, such what p – q = 3.

Solution:
Since p–q is odd, p and q must have different parities. That is: one of them is even and the other is odd.
odd. Since the only even prime is 2, the unique solution is 5–2 = 3, that is, p = 5 and q = 2.

04 - Find all the primes that are equal to a perfect square minus 1.
Solution:n2-1 = (n + 1)(n - 1). (n + 1) and (n - 1) are two integers whose difference is 2. In order for
2
-1 is a multiple of two integers and is prime, one of the integers can only be 1. As n + 1
For n–1, we must have n–1 = 1⇒ n = 2. Thus, n2-1 = (2 + 1)(2–1) = 3.1 = 3.

05 - Find all the primes that are equal to a perfect cube minus 1.
Solution:n3-1 = (n-1)(n2(n + 1). Following the same previous reasoning, n - 1 = 1⇒ n = 2.
Therefore: n3-1 = 23 - 1 = 7. Answer: 7.

06–Determine all positive integers n such that n, n + 2, and n + 4 are all prime.
Solution: n cannot be even because n = 2k, we would have n + 2 = 2k + 2 = 2(k + 1) which is even, therefore, no.
é first. Thus, n n + 2 e n + 4 are three odd consecutives.
For n = 3, n + 2 = 5 and n + 4 = 7. 3, 5, and 7 are three consecutive primes.
For n > 3, we have n = 3k or n = 3k + 1 or n = 3k + 2, with k > 1.
If n = 3k n no it would be
cousin then would be multiple of 3.
If n = 3k + 1, then n + 2 = 3k + 1 + 2 = 3k + 3 = 3(k + 1), we would have n + 2 not prime because it is
multiple of 3. If n = 3k + 2, then n + 4 = 3k + 2 + 4 = 3.(k + 2), we would have n + 4 not prime because it is
multiple of 3. Therefore, the only value of n is 3. Answer: 3.

07–Determine all primes p such that 3p + 1 is a perfect square.

Solution: For p = 2, we have 3p + 1 = 3.2 + 1 = 7 which is not a perfect square.
The other primes are odd, so 3p + 1 is even because 3p is odd.
We have (2k)2= 4k2= 3p + 1⇒ 4k2-1 = 3p. Now, 4k2-1 = (2k + 1)(2k - 1) = 3p
As p is prime, (2k + 1)(2k–1) only has 3 and p as factors. Therefore, 2k + 1 = 3.⇒ p
= 2k–1 = 1, solution that is not valid because 1 is not prime, or 2k–1 = 3⇒ p = 5.
08–Determine if the numbers are prime.
(a) 169
Solution: To check if a number n is prime, we must divide it by all the smaller primes or
equal to √n, or then divide it by the primes until the quotient becomes greater than the divisor.
√169 = 13. Therefore, 169 is not prime as it has 13 as a divisor.

(b) 197
Solution: 14 < √197 < 15. We should divide 197 by all primes less than or equal to 13.
Since 197 is not divisible by 2, 3, 5, 7, 11, 13, and 17. Therefore, 197 is prime.

(c) 239
239 is not divisible by 2, 3, 5, 7, 11, 13, and 17 (172 = 289). 239 is prime.

(d) 473
Solution: 473 is not divisible by 2, 3, 5, or 7. But it is divisible by 11. Therefore, 473 is not prime.

09 – Pickle a decomposition canonical do whole 5040

Solution:

5040 2
2520 2
1260 2
630 2
315 3
105 3
35 5
7 7

5040 = 24 x 32 x 5 x 7

To find the gcd(a, b) and lcm(a, b) knowing a = 230 . 521 . 19 . 233 and b = 26 . 3 . 74 . 112 . 195 . 237
Solution: The gcd(a,b) is the product of the common factors with their lowest exponents.
Therefore, GCD(a, b) = 26 . 19 . 233. And the LCM(a, b) is the product of all the factors with their
highest exponents. Therefore, lcm(a, b) = 230.3.521.74.112.195.237 Answer: gcd(a, b) = 26.
19. 233 and lcm(a, b) = 230.3.521.74.112.195.237.

11–Show that they are twin primes:

1949 and 1951
Solution: Primes twins are two cousins what are odds consecutive.
1st condition: 1949 e 1951 are two odd consecutive.
2nd condition: We must verify himself both they are cousins.

452 > 1949 e 452 > 1951

As both are not divisible by 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, and 43, both are
cousins.
Therefore, they are twin primes.

1997 and 1999

Solution:
1st condition: are odds consecutives.
2nd condition: They are not divisible by 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, and 43.
Therefore, they are twin primes.
13–Find a sequence of four consecutive positive composite integers.
Solution: The easiest way to find sequences with this is to use the factorial added to
integers successive a to leave of 2 then no factorial will containthis factor.
For example, in 10! The factor 4 appears. Therefore, 10! + 4 is a multiple of 4 because 10! + 4 = (10!/4 +
1).4. Thus, for what was requested we can take 5! + 2, 5! + 3, 5! + 4, 5! + 5 or any
outro factorial added a integers consecutive.
Note that in n! + a, a < n. Answer: 5! + 2, 5! + 3, 5! + 4, 5! + 5.

14 - Find a sequence of 100 consecutive positive composite integers.

Solution: Using o even reasoning anterior we would have:
101! + 2, 101! + 3, 101! + 4 . . . 101! + 100 101! + 101.
From 2 to 101 we have 100 numbers. Answer: - 101! + 2, 101! + 3, 101! + 4 . . . 101! + 100, 101!
+ 101.

15 – Verify a conjecture of Goldbach for os following integers pairs

Solution: Goldbach's conjecture states that every integer greater than 4 can be expressed as
a sum of two odd primes.

16–Verify that every pair between 4 and 100 is the sum of two primes:
Solution:

6=3+3 8=2+5 10 = 7 + 3 12 = 5 + 7 14 = 3 + 11
16 = 5 + 11 18 = 7 + 11 20 = 7 + 13 22 = 3 + 19 24 = 19 + 5
26 = 19 + 7 28 = 5 + 23 30 = 7 + 23 32 = 19 + 1334 = 29 + 5
36 = 29 + 7 38 = 31 + 7 40 = 29 + 1142 = 29 + 1344 = 13 + 31
46 = 29 + 1748 = 29 + 1950 = 19 + 3152 = 29 + 2354 = 23 + 31
56 = 53 + 3 68 = 61 + 7 60 = 53 + 7 62 = 19 + 4364 = 53 + 11
66 = 53 + 1358 = 53 + 5 70 = 47 + 2372 = 61 + 1174 = 61 + 13
76 = 53 + 2378 = 47 + 3180 = 61 + 1982 = 59 + 2384 = 71 + 13
86 = 83 + 3 88 = 83 + 5 90 = 83 + 7 92 = 61 + 3194 = 47 + 47

96 = 83 + 1398 = 61 + 37

17–Find the smallest positive integer n such that 2n2+ 29 is a composite integer.
Solution: it can be guaranteed that for n = 29, 2n2+ 29 is a composite number because: 2,292 + 29 =
29.(2.29 +1) = 29.59. It remains to verify if there exists any compound of the form 2n. 2+ 29 for n < 29.
The table below shows the values of 2n2+ 29 for 1 < n < 29.

1 2 3 4 5 6 7 8 9
2n2+29 31 33 35 37 39 41 43 45 47
n 10 11 12 13 14 15 16 17 18
2n2+29 49 51 53 55 57 59 61 63 65
n 19 20 21 22 23 24 25 26 27
2n2+29 751 829 911 997 1087 1181 1279 1381 1487
n 28 - - - - - - - -
2n2+29 1597 - - - - - - - -
Checking, through the process of division by primes, it is observed that all values of 2n2+ 1 is
cousins. Therefore, the smallest value of n for which 2n2+29 is prime and n = 29.

18–Show that the sum of consecutive odd positive integers is always a composite integer.
Solution: If the two are consecutive odd numbers, then they have the forms 2k + 1 and 2k + 3.
Thus, 2k + 1 + 2k + 3 = 4k + 4 = 4(k + 1). 4(k + 1) is a multiple of 4.
Therefore, the sum is a composite integer. Q.E.D.

19–Usando a decomposição canônica dos inteiros 507 e 1287, achar o mdc(507, 1287) e o mm(507, 1287).
Solution: The gcd is equal to the product of common factors with their lowest exponents and the lcm is the
product of all os factors with yours greater exponents.
Na decomposition we have: 507 = 3.132 e 1287 = 32.11.13
Resposta: mdc(507, 1287) = 3.13 = 39 e mmc(507, 1289) = 32.11.132 = 16731

20–Demonstrate that every prime, except 2 and 3, is of the form 6k–1 or 6k + 1, where k is a positive integer.
Solution: According to the division algorithm, any number when divided by 6 is one of the
ways:
6k 6k + 1 6k + 2 6k + 3 6k + 4 6k + 5.
For n = 6k , n é multiple of 6. No é cousin.
For n = 6k + 1, can be first.
For n = 6k + 2, n = 2(3k + 1)⇒ n is not a multiple of 2. 6k + 2 is not prime.
For n = 6k + 3, n = 3(2k + 1)⇒ n is a multiple of 3. 6k + 3 is not prime.
For n = 6k + 4, n = 2(3k + 2)⇒ n is not a multiple of 2. 6k + 4 is not prime.
For n = 6k + 5, n = 6k + 6–1 = 6(k + 1)– 1 = 6k’ –1. It can be prime.
Therefore, if n is not prime, it cannot be of the forms 6k, 6k + 2, 6k + 3, and 6k + 4.
Thus, n is prime for 6k–1 or 6k + 1. Q.E.D.

21–Find the smallest positive integer by which 3720 must be divided to obtain a perfect square.
Solution: Every perfect square has its prime factors raised to even exponents.
Decomposing 3720 we have: 3720 = 2^3 . 3 . 5 . 31. For the exponents of the factors to be
even numbers we must eliminate two, three, five, and thirty-one. Therefore, 3720 must be divided by
2.3.5.31 = 930.
22–Find all the prime divisors of 50!.
Solution: All integers from 1 to 50 appear in 50!, since 50! = 1.2.3.4.5....48.49.50!
Therefore, all os cousins inferior a 50 are divisors do 50!
2, 3, 5, 7, 9, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47.

23–Show that the only prime of the form n³–1 is 7.

Solution: Decomposing n3 – 1 we have: 3– 1 = (n – 1)(n2+ +
For what n -1 is prime and (n-1)(n (n + 1) are its factors, (n - 1) must be equal to 1.
3 2

Thus, n–1 = 1⇒ n = 2. In this case, n2+ n + 1 = 22 + 2 + 1 = 7 and n3-1 = 23-1 = 8-1 = 7.

Answer: the only n3-1 cousin is 7.

24–Show that every integer of the form n4+ 4, with n > 1 is composite.
Solution:
(1) If n is even, we have n = 2k⇒ (2k)4+ 4 = 16k4 + 4 = 4(4k4+ 1)⇒ n4+ 4 is a multiple of 4.
Therefore, it is composed.

If n is odd, we have n = 2k + 1⇒ (2k + 1)4 + 4 = (2k)4+ 4(2k)3+ 6(2k)2+ 4(2k) + 1 + 5 =

16k^4 + 32k^3 + 24k^2 + 8k + 6 = 2(8k^4 + 16k^3 + 12k^2 + 4k + 3)⇒ n4 + 4 is a multiple of 2.
Therefore, it is composite. Therefore n4 + 4 is composite, whatever n may be. QED.
Lucas Ribeiro found an error in this question, because instead of using n4- 4 the author of
book used n4- 5 in part (2). So, correcting we have the following solution:
Note that:
(n²+2)² - 4n²=n44
(n²+2-2n) (n²+2+2n)= n4+ 2n2+ 2n3+ 2n2+ 4 + 4n - 2n3-4n-4n2=n4- 4
Now let's go to the response sent by Lucas,
(n²+2)² - 4n² => (n²+2-2n)(n²+2+2n) at this point you have reached a product of two numbers, where n>1
(given) characterizing a compound.

25–Show that if n > 4, it is composite, then n divides (n–1)!.

Solution: If n is composite, n can be expressed in the form n = ab, with a > 1 and b > 1. Let us consider
Initially b > a. We then have: n = ab > a² since b > a. But a² > 2a for a > 2.
Therefore, n > 2a⇒ n–1 > 2a–1 = a + a–1 > a + 1–1 = a. It then follows that n–1 > a.
We also have that n = ab > 2b since a > 2. Thus, n–1 > b + b–1 > b + 1–1 = b⇒ n–1 > b
Thus, a and b are two different integers, less than n–1. Therefore, they are contained in (n
– 1)! of this form, ab = divide (n – 1)!
They a = b we will have: = ab = b2 > 2b then a > b.
As a consequence n–1 > 2b–1 > b + b–1 > b + 1–1 ⇒ n–1 > b.
Therefore, o factor b is even in 1)!. ( n –
We prove that at least one multiple of b is also contained in (n–1)!
Now, n = b2 and n > 4 implies that b > 2 or b > 3. Therefore, n > 3b⇒ n - 1 > 3b - 1 = 2b + b - 1 >
2b + 1 - 1⇒ (n–1) > 2b, from which it is concluded that 2b is included in (n–1)!. If b and 2b are
included in (n–1)!, 2b2 = 2n2 divides (n–1)!⇒ n divide (n–1)!. Cqd.

26–Show that every integer of the form 8n + 1, with n > 1, is composite.

Solution: Let's do it 8n = (23)n
(2n)3 = = a.
Thus, 8n + 1 = a3 + 1. Now (a3 + 1)
1)(a2–a + 1). = (a +
Since 2n > 2 it follows that a > 1, from which a + 1 > 3 is derived. Also, a2 > a.⇒ a2–a + 1 > 1 and
integer. Thus, 8n + 1 has two factors greater than 1. Therefore, 8n + 1 is composite. Q.E.D.

27–Show that if n² + 2 is prime, then 3 | n.

Solution: All number whole é yes form 3k 3k + 1 e 3k + 2.
If n is of the form 3k + 1, we will have: n² + 2 = (3k + 1)² + 2 = 3k² + 6k + 1 + 2 = 3.(k² + 2k +
for numbers
⇒ of the form (3k 1), n2 composed.
+ + 2 é
If n is of the form 3k + 2, we will have: n2 + 2 = (3k + 2)2 + 2 = 9k2 + 12k + 4 + 2 = 3.(3k2 + 4k +
⇒ for numbers yes shape (3k + 2), n2 + 2 no é cousin.
Thus, n2 + 2 can only be prime if n is of the form 3k.⇒ 3 | n. Cqd.

28 – Show, by means of um example what a following conjecture é false

Every positive integer can be expressed in the form a2 + p, where the integer a > 0 and p is either a prime integer or 1.
Solution: After testing all integers from 1 to 25, it is found that 25 does not have the indicated form.
because; 25 = 1 + 24 or 25 = 4 + 21 or 25 = 9 + 16 or 25 = 16 + 9. Note that 24, 21, 16 and 9
they are not prime and 1, 4, 9, and 16 are the only squares less than 25.

29–Demonstrate the following properties:

(a) All cousin yes shape 3n + 1 é also yes shape 6m + 1.
Solution: If 3n + 1 is prime, then 3n + 1 is odd. Thus, n is an even number. Therefore, for any
value of m exists n such what n + 2m.
We can then write 3(2m) + 1 = 6m + 1.

(b) All whole yes form 3n + 2 they um factor cousin this shape.
If 3n + 2 is prime, its decomposition into prime factors is 3n + 2 = (3n + 2).1⇒ 3n + 2
there is a prime factor of the form 3n 2. +
If 3n + 2 is not prime, let 3n + 2 = a1.a2.a3...an its canonical decomposition into factors.
cousins. Since every integer has one of the forms 3k, 3k + 1, or 3k + 2, the factors ai of 3n
+ 2 cannot be in the form of 3k because 3k is a multiple of 3, therefore it will not be prime.
Thus, each ai can only take one of the forms 3k + 2 or 3k + 1.
If all forum yes form 3k + 1 we would have:
(3k + 1)(3k' + 1) = 9kk' + 3k + 3k' + 1 = 3.(3kk' + k + k') + 1 which is of the form 3n + 1. Therefore,
3n + 2 must admit at least 1 factor of the form 3n + 2.

(c) If p > 5 é um cousin, so p2 + 2 é composed.

Solution: Every integer can be represented in one of the forms 3k, 3k + 1, or 3k + 2.
For p = 3k, p is not prime. Therefore, if p is prime and greater than or equal to 5, p is of the form 3k + 1 or
3k + 2, with k > 1.
If p = 3k + 1, we have p2 + 2 = (3k + 1)2 + 2 = 9k2 + 6k + 1 + 2 = 9k2 + 6k + 3 = 3.(9k2 + 6k
+ multipleéfrom 3, greater than then 1. 3 k >
If p = 3k + 2, we have p2 + 2 = (3k + 2)2 + 2 = 9k2 + 12k + 4 + 2 = 9k2 + 12k + 6 = 3.(3k2 +
4k + 2) é multiple of 3, greater what 3 then k >
Thus, whatever p > 5, p prime, p2 + 2 is composite. QED

(d) If p é um cousin e himselfp | an , so pn | one.

Solution: Let a = a1.a2.a3...an be the canonical decomposition of a into prime factors. Thus we will have:
an = a1n.a2n.a3n...ann. All the prime factors of an are of the form ain.
If p | an, then p is a prime factor of an, which allows, as indicated above, that pn is
factor of an. Therefore, pn | an. Qed

Every integer n > 11 can be expressed as a sum of two composite integers.

Solution: If n is even, we have n = 2k, with k greater than 5. Thus, n = 2k = 2.(k–2) + 4 where 2.(k–
2) it is a number greater than 2 because from k > 5 it follows that k–2 > 3 and 2.(k–2) is a larger pair
what 6 e 4 é um composed.
If n is odd, we have n = 2k + 1 with k > 5. Thus, n = 2k + 1 = 2.(k–4) + 1 + 8 = 2.(k–4) +
9. Since k > 5, k - 4 > ⇒1 2(k–4) is a pair greater than 4 and 9 is a multiple of 3.
Thus, for n > 11, n can be expressed as 2(k–2) + 4 if n is even and 2(k–4) + 9 if n is odd.
odd.

(f) If p > q > 5 e himself p e q they are both cousins, so 24 | p2 – q2.

Solution: For p = q, the property is evident, since p = q.⇒ p2–q2 = 0 and 24 | 0.
We must prove that multiple
p22é of multiple of 8. 3 e
For p > q, let us do p. –q = (p + q)(p–q). Thus, if p + q or p–q is a multiple of 3p 2–
2 2

q2it will be multiple of 3. O same occurring with 8 e p 2– q2.

We try initially what p2 – q2 é multiple of 3.
If p and q are prime, then p = 3k + 1 or 3k + 2 and q = 3k' + 1 or 3k' + 2.
For p = 3k + 1 and q = 3k’ + 1 we have p - q = (3k + 1) - (3k’ + 1) = 3k - 3k’ = 3.(k - k’)⇒ (p–
q) é multiple of 3.
For p = 3k + 2 and q = 3k' + 2 we will have p - q = (3k + 2) - (3k' + 2) = 3k - 3k' = 3.(k - k')⇒ (p–
multiple of é 3.
For p = 3k + 1 and q = 3k’ + 2 we have p + q = (3k + 1) + (3k’ + 2) = 3.(k + k’ + 1)⇒ (p + q) is
multiple of 3.
For p = 3k + 2 and q = 3k' + 1 we have p + q = (3k + 2) + (3k' + 1) = 3.(k + k' + 1)⇒ (p + q) is
multiple of 3.
Therefore, p2 – q2 é multiple of 3, in all as situations possible.
We try now what p2 – q2 é multiple of 8.
Since p and q are primes greater than or equal to 5, then p = 4k + 1 or 4k + 3 and q = 4k’ + 1 or 4k’ + 3,
with k greater than or equal to 1. Note that 4k and 4k + 2 are not primes as they are multiples of 2.

Therefore, whatever the forms of prime p and q, (p + q)(p - q) = p² - q² is a multiple of

8
Since p2–q2 is a multiple of 3 and a multiple of 8, and gcd(3, 8) = 1, p2–q2 is a multiple of 24, or
24 | p2–q2.

(g) If p ≠ 5 é an odd cousin, then p2 – 1 or p2 + 1 é divisible by 10.

Solution: Let p be a prime number different from 5. Since p ≠ 5, an integer prime, then p can have a
the forms: 10k p = 1, 10k + 3, 10k + 7 10k 9.
+ +
Note that for p = 10k, 10k + 2, 10k + 4, 10k + 6, and 10k + 8, p is an even number, therefore not
odd prime) 10k e p = um multiple
+ 5 of é 5.
In the case of k = 0 we have p = 5, which does not work. Thus, we confirm that p = 10k + 1, 10k + 3,
10k + 7 or 10k + 9. The table below shows the squares of these forms:

Observing the table, either one of the forms p2 + 1 or p2 - 1 is always a multiple of 10. Q.E.D.

30–Verify that every integer can be written in the form 2^k*m, where the integer k > 0 and m is an odd integer.
Solution: If n é um whole odd it is done m = n e n = 20.m.
If n is an integer, then in its canonical decomposition we have, n = 2^k * a1^k1 * a2^k2 * a3^k3 .... * an^kn.
Only the factor 2 is an even prime. Thus, the product of all factors, except 2, is a number.
odd. Therefore, it is concluded: n = 2k.m. Q.E.D.

31 - Demonstrate that the positive integer a > 1 is a perfect square if and only if all the exponents of the factors
the prime factors of its canonical decomposition are even integers.
Solution: Let a be a perfect square then it has the form n². If n = n₁k₁.n₂k₂.n₃k₃. ... nₙkₙ,
where n1k1.n2k2.n3k3. ... nnkn is the canonical decomposition into prime factors of n, we will have n2 =
(n1k1.n2k2.n3k3. ... nnkn)2 = n12k1.n22k2.n32k3. ... nn2kn. As all the exponents are from
form 2k it is concluded that everyone os exponents they are pairs.
Let ni be a prime factor of n whose exponent is not even. In this case, the factor would have exponent
in the form 2k + 1. Now, ni2k + 1 = ni2k . ni. ni2k has an exponent, therefore it is in accordance with
What was said before. In order to be a square, it should have two equal prime factors.
Since neither is prime, this is not possible. Therefore, every number is a perfect square if and only if,
all the exponents of the prime factors in the canonical decomposition are even.

32 - Demonstrate that if the integer n is composite, then 2n - 1 is also composite.

Solution: Clearly it is a positive n, because if n < 0, n - 1 is negative and 2n - 1 will not be.
an integer. Thus, for n > 0 and n composite, n > 3. We will then have n–1 > 2⇒ 2n–1 = 2k, k = n
-1 > 2 integer⇒ k–2 > 0⇒ (k–1) > 0. Now, 2n–1 = 2k = 2.(2k–1) which is a multiple of 2 (not
forget that k–1 > 0)⇒ 2n–1 is composite.

33–Demonstrate that if the integer n > 2, then there exists a prime p such that n < p < n!
Solution: We have 2.(n–1) = n + n–2 > n + 2–2 > n. Therefore, 2.(n–1) > n (1).
Since n!/[2(n–1)] = n(n–2)(n–3).....3, it follows that n! > 2.(n–1)(2).
From (1) and (2) we conclude that n! > 2.(n–1) > n. Now, for every n > 3, there exists something between n and 2(n–1).
at least one prime, according to Tschebischeff's proposition, we conclude that between n and n!
There exists a prime p. For n = 2, we have 2! = 4. We have 3 which is prime. Therefore, for n > 2, there exists
p is prime, such that n < p < n!. Q.E.D.

34–Demonstrate that every odd prime is of the form 4k + 1 or 4k - 1, where k is a positive integer.
Whatever integer n is, n = 4k, 4k + 1, 4k + 2 or 4k + 3.
If n is an odd prime, n cannot take one of the forms 4k and 4k + 2 because these are forms of
pairs. Thus, n can only be 4k + 1 or 4k + 4. For n = 4k + 3, we have n = 4k + 3 + 1 - 1 = 4(k +
-1 is of the form 4k - 1. Q.E.D.