1

If m = 1, n = 1.
Then 3m + 5 n = 8 12

If m = 2, n= 1.
Then 3m + 5n = 11 12

If m = 1, n=2
3m + 5n = 13 12

Furthermore, (m 2) (n 2) [3m+5n 16 > 12]

Therefore, there doesn't exist an m and an n N such that 3m + 5n = 12

2
For any integer n, the sum of the five consecutive integers starting from n is :

n+ (n+1) + (n+2) + (n+3) + (n+4) = 5n + 10 = 5 (n+2)

Therefore, the sum of any five consecutive integers is divisible by 5.

n + n + 1 = n (n + 1) +1

1) If n is even, then integer m, nm is even. Taking m = n+1, we have n (n+1) is even and therefore n
(n+1) + 1 is odd.

2) If n is odd, (n+1) is even. By the same reasoning as 1), n (n+1) is even and therefore n (n+1) + 1 is
odd.

In any case, n (n+1) +1 is odd.

1. Initial case - First odd natural number 1 is of the form 4n + 1 with n = 0

2. Let m be an odd natural number and m' the following odd natural.

(m = 4n + 1) => m' = 4n + 1 + 2 = 4n + 3

(m = 4n + 3) => m' = 4n + 3 + 2 = 4n + 4 + 1 = 4k + 1 (where k is the integer = n + 1)

As a result, (m = 4n + 1) v (m = 4n + 3) => (m' = 4n + 3) v (m' = 4k + 1) where n, k are integers

By mathematical induction, the property holds for all odd natural numbers

5
Every integer n is of one of these forms :
3m
3m + 1
3m + 2

(the remainder of an integer divided by 3 is either 0, 1 or 2)

if n = 3m, then n | 3
if n = 3m + 1, then n + 2 = 3 m + 3 = 3 (m + 1), divisible by 3
if n = 3m + 2 then n + 4 = 3m + 6 = 3 (m+2), divisible by 3

So at least one of n, n+2, n+4 is divisible by 3

6.
Triples are sets of the form { n, n+2, n+4 }. From question 5, we know that at least one of { n, n+2,
n+4 } is divisible by 3.

However, the only prime number divisible by 3 is 3 itself. So a triple, in order to be prime, has to
contain 3.

Incidentally, the only prime triple with 3 in it is { 3, 5, 9 }

Therefore, the only prime triple is { 3, 5, 9 }.

7.
By mathematical induction :

Initial step : n = 1
22 2 = 2 = 2 1

Assume 2+22+23++2n = 2n+12

Then for n+1, 2+22+23++2n + 2n+1 = 2n+12 + 2n+1

= 2(2n+1)-2

= 2n+2 2 = 2(n+1)+1 - 2

Which is the identity with n+1 in place of n.

Hence the identity holds for all n

8.
Since {an}n=1 tends to limit L as n, for any > 0 we pick, ( n) (m n) [ | am - L | < ]

Let be given. We can also state that for any fixed number M > 0, ( n) (m n) [ | am - L | < / M] ,
since / M > 0

Therefore

| M . am - M.L | = M . | am - L | < M . / M =

Showing that {M an}n=1 tends to limit M.L

9.

One such example is the family of intervals A n = [ n, )

This family satisfies An+1 An for all n

In addition, An = means that

((x) (n)[ x An])

i.e.
(x)(n)[x An]

There exists such an n. Indeed, suffices to take any n > x.

Therefore, An = is true.

10.

One such example is the family of intervals An = [ 0, 1/n]

This family satisfies An+1 An for all n

In addition, An = { 0 } since lim n 1/n = 0