Scribd
Upload
10 views3 pages

Tutorial 1 Mathematical Logic

The document outlines exercises related to mathematical logic and functions, including predicate syntax, logical propositions, and function properties. It covers topics such as proving equivalences, negating statements, and verifying the truth of various mathematical assertions. Additionally, it includes exercises on sequences, induction, and properties of numbers, specifically focusing on functions and their characteristics.

Uploaded by

Mouiz Edd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views3 pages

Tutorial 1 Mathematical Logic

The document outlines exercises related to mathematical logic and functions, including predicate syntax, logical propositions, and function properties. It covers topics such as proving equivalences, negating statements, and verifying the truth of various mathematical assertions. Additionally, it includes exercises on sequences, induction, and properties of numbers, specifically focusing on functions and their characteristics.

Uploaded by

Mouiz Edd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

2024/2025 Basic Training Cycle

Lecturer: H. MOUFEK Algebra 1 - Tutorial 1 Mathematical Logic

Exercise 1
Using the syntax of the predicates write the following sentences ( f and g denote real functions):
1 g is not a constant function.
2 f is even.
3 g is periodic of period 2π.
4 g is periodic.
5 f is an increasing function on [0, +∞[.
6 The curves representing f and g intersect at least once.
7 f is strictly less than g.
8 f is not strictly less than g.
9 g is not bounded from above by any real number (we say that g is bounded from above by a real number
M if all the values taken by the function g are less than M).

Exercise 2
Let P, Q, R three logical propositions.
1 Show that P ⇒ Q is equivalent to ¬P ∨ Q. Write the negation of P ⇒ Q.
2 Show that the following assertions are equivalent:
(a) (P ∨ Q) ⇒ R and (P ⇒ R) ∧ (Q ⇒ R).
(b) (P ⇒ (Q ⇒ R)) and ((P ∧ Q) ⇒ R).

Exercise 3
Let f : R → R be a function. Write the negation of the following statements:
1 ∃M ∈ R, ∀x ∈ R, f (x) ≤ M.
2 ∀x ∈ R, ( f (x) ≥ 0 =⇒ x ≥ 0).
3 ∀x ∈ R, f (x) ≥ 1 or f (x) ≤ −1.
4 ∃` ∈ R, ∀ε > 0, ∃A > 0, ∀x ≥ A, | f (x) − `| ≤ ε
5 ∀x ∈ R, ( f (x) < 0 ⇐⇒ x ∈ [0, 1]).

1
Exercise 4
Say if the following statements are true or false. Carefully justify each answer (demonstrate true results, give
counterexamples when false, optionally cite a hypothesis to add for making the statement true):
1 ∃n ∈ Z, ∀p ∈ Z, n ≤ p.
2 ∀x ∈ R, ∃y > 0, x = ey .
3 ∀a ∈ R, ∃x ∈ R, ln x < a.
4 ∀x ∈ R, ∀y ∈ R, ∃z ∈ R, x < y < z.
√ √
5 ∀a > 0, ∃q ∈ Q, 2 ≤ q ≤ 2 + a.

Exercise 5
For each of the statements P(·) below, determine if the proposition Q(·) is necessary, sufficient, both at the
same time or nothing at all (justify your answer).
1 Parameter: x ∈ R.
Propositions: P(x) : (x ≥ 0) and Q(x) : (x ≥ 1).

2 Parameter: (a, b) ∈ R2 .
Propositions: P(a, b) : (a + b)2 = a2 + b2 and Q(a, b) : (a = b = 0).


3 Parameter: (a, b, c) ∈ R3 .
Propositions: P(a, b, c) : (|a + b + c| = 0) and Q(a, b, c) : (|a + b| + |c| = 0).

4 Parameter: (un )n∈N ∈ RN .


Propositions : P (un )n∈N : (∀N ∈ N∗ , (u1 − u0 ) (u2 − u1 ) · · · (uN − uN−1 ) > 0) and Q (un )n∈N : (the se-
 

quence (un )n∈N is strictly increasing).

Exercise 6
For any n > 1, we set:
n
An = ∑ (−1)k−1k
k=1

1 Compute An for 1 6 n 6 6 and report the results in a table.


2 Prove using induction the following property:

(−1)n−1 (2n + 1) + 1
∀n ∈ N∗ , An =
4

3 Check that:
 
∗ n−1 n+1
∀n ∈ N , An = (−1)
2

Exercise 7
Prove by induction that for all n ∈ N∗ , there exist natural integers p and q such that n = 2 p (2q + 1).

2
Exercise 8
Consider the Fibonacci sequence {Fn }n∈N , defined by the relations F1 = 1, F2 = 1, and Fn = Fn−1 + Fn−2 for
n ≥ 3.
1 Compute F20 .
2 Use an extended Principle of Mathematical Induction in order to show that for n ≥ 1,
" √ !n √ !n #
1 1+ 5 1− 5
Fn = √ −
5 2 2

3 Use the result of part (2) to compute F20 .

Exercise 9
Prove the following statements:
1 ∀n ∈ N∗ , 6 divides 5n3 + n.
2 Two positive integers are multiples of each other if and only if they are equal.

Exercise 10
√
1 Show that : 3 ∈/ Q.
2 Let n ∈ N. We admit:
√
(2 + 3)n ∈ Q ⇔ n=0
√
Deduce a necessary and sufficient condition on n so that (2 − 3)n ∈ Q.

Exercise 11
Let x ∈ R\Q. Show that: ∀n ∈ Z∗ , nx ∈ R\Q.

Exercise 12
Show that any function from R to R can be written as the sum of a constant function and a function whose
image of 0 is 0.

You might also like