facebook
Become a Tutor
favorite button
1/5
Dimitri
verified badge
star icon
5
2 reviews
super instructor icon
Trusted teacher
This teacher has a fast response time and rate, demonstrating a high quality of service to their students.
member since icon
Since March 2021
Instructor since March 2021
repeat students icon
1 repeat student
Trusted choice for 1 returning student
Translated by GoogleSee original
Microsoft Word Mastery Course - Formatting and Layout with Word
course price icon
From 5.04 £ /h
arrow icon
During this training, you will have the opportunity to acquire advanced skills for optimal and professional use of Microsoft Word software.
In the program,
- Text formatting
- Document layout
- Book design tool (pagination, division into chapters, table of contents, table of illustrations, bibliography, cover page, etc.)
- Impression
- Use of developer tools
- Sharing and collaborative work
- Tips to gain efficiency and speed.

The course begins with a knowledge test that will allow us to assess your skills and focus on the essentials.

Duration: 1 month
Hourly volume: 24 hours

Register now !
Extra information
You must have a computer.
Location
green drop pin icon
|
Use Ctrl + wheel to zoom!
zoom in iconzoom out icon
location type icon
At student's location :
  • Around Douala, Cameroon
location type icon
Online from Cameroon
About Me
Young Cameroonian eager for knowledge, I am passionate about digital, and the automation of tasks. At work, I like to create tools that facilitate my tasks and those of my collaborators.

Teaching makes people autonomous, and I believe that the more you teach, the more you discover.

Patient and explanatory, I also know how to motivate my learners and go back briefly to the prerequisites to help them understand the content of the training.

With me as a teacher, you will acquire practical and technical skills that will help you distinguish yourself, but also theoretical knowledge that will help you to transmit in turn.
Education
- Training in the installation of web servers and the design of websites
- Training in digital marketing on Google, OpenClassroom, Udemy, and Blueprint.
- Training in web programming (HTML, CSS, JavaScript, Laravel) from June 2017 to August 2018
- DEA in physics obtained at the University of Douala, Cameroon in 2017
- License in applied physics, obtained at the University of Douala in 2014
- Baccalaureate series C, obtained in 2010
Experience / Qualifications
- IT teacher (Word, Excel, PowerPoint, Access) - at the Churchill Training Institute - since August 2018
- Assistant manager and digital marketer - at the Churchill Training Institute - since January 2019
Age
Children (7-12 years old)
Teenagers (13-17 years old)
Adults (18-64 years old)
Seniors (65+ years old)
Student level
Beginner
Intermediate
Advanced
Duration
90 minutes
120 minutes
The class is taught in
French
English
Skills
Reviews
Availability of a typical week
(GMT -05:00)
New York
at teacher icon
Online via webcam
at home icon
At student's home
Mon
Tue
Wed
Thu
Fri
Sat
Sun
00-04
04-08
08-12
12-16
16-20
20-24
Data Analysis Course with Microsoft Excel - Mastery of Excel and Dashboard Design
6.73 £ /h
Microsoft Excel is very powerful data analysis software. It is a practical solution in the short to medium and long term to automate your calculations, to have a global and detailed overview on your activities, and to analyze your data.

As an accountant, marketer, commercial agent, secretary, merchant, salesperson or company manager, a good mastery of this software will improve your efficiency, your competitiveness, and will save you a lot of time and money. Whatever your field of activity, this software is designed to help you.

During this training you will learn:
- best practices, functionalities and tools;
- functions and their use;
- handling of Dynamic Cross Tables, dynamic graphics,
- the design of dashboards,
- and you will acquire reflexes that will be useful for your entire career.

Duration of training: 1 month
Number of hours: 24 hours

I am expecting many of you because we have a lot to share.
Read more
Master Microsoft PowerPoint – Create Professional and Impactful Presentations
6.73 £ /h
Do you want to captivate your audience with powerful, clear, and modern presentations? This course is for you!

Objective: To teach you how to master PowerPoint (Microsoft 365) from A to Z to create professional, visual and dynamic presentations, to bring your classes, pitches, conferences, etc. to life.

Whether you are:
- Beginners who have never used PowerPoint,
- Students, teachers, trainers,
- Professionals wishing to improve their presentations,
- or simply wanting to present your ideas effectively with visual aids,
THIS COURSE IS FOR YOU!


What will you learn?

- Getting started with the PowerPoint interface and its key tools
- Creation and formatting of slides (texts, images, graphics, videos)
- Use of themes, templates, slide masters
- Animations, transitions, timing and scripting of a presentation
- Integration of multimedia content to boost your message
- Design tips for a clear, elegant and professional look
- Preparation for the oral presentation and presentation of an impactful slide show


Teaching method:

100% practical course, based on real-life cases, guided exercises, and the gradual creation of a comprehensive presentation. Personalized support tailored to your level and goals.

⏱️ Duration: Adapted to your needs (intensive or spread out training)

Join this course and turn your ideas into impactful presentations!
Read more
Show more
arrow icon
Private lessons
arrow icon
Computer Science
arrow icon
Microsoft Word
arrow icon
Computer Basics
Similar classes
arrow icon previousarrow icon next
verified badge
Léon
Digital suites courses

I - General
A numeric sequence is an application from N to R.
• Bounded sequence
A sequence (Un) is bounded if there exists a real A such that, for all n, Un ≤ A. We say that A is an upper bound of the series.
A sequence (Un) is reduced if there exists a real number B such that, for all n, B ≤ one. One says
that B is a lower bound of the sequence.
A sequence is said to be bounded if it is both increased and reduced, that is to say if it
exists M such that | Un | ≤ M for all n.

• Convergent suite

The sequence (Un) is convergent towards l ∈ R if:
∀ε> 0 ∃n0 ∈ N ∀n ≥ n0 | un − l | ≤ ε.
A sequence which is not convergent is said to be divergent.
When it exists, the limit of a sequence is unique.
The deletion of a finite number of terms does not modify the nature of the sequence, nor its possible limit.
Any convergent sequence is bounded. An unbounded sequence cannot therefore be convergent.

• Infinite limits

We say that the following (un) diverges

Towards + ∞ if: ∀A> 0 ∃n0∈N ∀n ≥ n0 Un≥A
Towards −∞ if: ∀A> 0 ∃n0∈N ∀n≤ n0 Un≤A.

• Known limitations

For k> 1, α> 0, β> 0


II Operations on suites

• Algebraic operations

If (un) and (vn) converge towards l and l ', then the sequences (un + vn), (λun) and (unvn) respectively converge towards l + l', ll and ll '.

If (un) tends to 0 and if (vn) is bounded, then the sequence (unvn) tends to 0.

• Order relation

If (un) and (vn) are convergent sequences such that we have a ≤ vn for n≥n0,
then we have:
Attention, no analogous theorem for strict inequalities.

• Framing theorem

If, from a certain rank, un ≤xn≤ vn and if (un) and (vn) converge towards the
same limit l, then the sequence (xn) is convergent towards l.


III monotonous suites

• Definitions

The sequence (un) is increasing if un + 1≥un for all n;
decreasing if un + 1≤un for all n;
stationary if un + 1 = one for all n.

• Convergence

Any sequence of increasing and increasing reals converges.
Any decreasing and underestimating sequence of reals converges.
If a sequence is increasing and not bounded, it diverges towards + ∞.

• Adjacent suites

The sequences (un) and (vn) are adjacent if:
(a) is increasing; (vn) is decreasing;

If two sequences are adjacent, they converge and have the same limit.

If (un) increasing, (vn) decreasing and un≤vn for all n, then they converge to
l1 and l2. It remains to show that l1 = l2 so that they are adjacent.

IV Extracted suites

• Definition and properties

- The sequence (vn) is said to be extracted from the sequence (un) if there exists a map φ of N
in N, strictly increasing, such that vn = uφ (n).
We also say that (vn) is a subsequence of (un).
- If (un) converges to l, any subsequence also converges to l.

If sequences extracted from (un) all converge to the same limit l, we can conclude that (un) converges to l if all un is a term of one of the extracted sequences studied.
For example, if (u2n) and (u2n + 1) converge to l, then (un) converges to l.

• Bolzano-Weierstrass theorem

From any bounded sequence of reals, we can extract a convergent subsequence.

V Suites de Cauchy

• Definition

A sequence (un) is Cauchy if, for any positive ε, there exists a natural integer n0 for which, whatever the integers p and q greater than or equal to n0, we have | up − uq | <ε.
Be careful, p and q are not related.

• Property

A sequence of real numbers, or of complexes, converges if, and only if, it is
Cauchy




SPECIAL SUITES

I Arithmetic and geometric sequences

• Arithmetic sequences

A sequence (un) is arithmetic of reason r if:

∀ n∈N un + 1 = un + r

General term: un = u0 + nr.

Sum of the first n terms:


• Geometric sequences

A sequence (un) is geometric of reason q ≠ 0 if:

∀ n∈N un + 1 = qun.

General term: un = u0qn

Sum of the first n terms:

II Recurring suites

• Linear recurrent sequences of order 2:

- Such a sequence is determined by a relation of the type:

(1) ∀ n∈N aUn + 2 + bUn + 1 + cUn = 0 with a ≠ 0 and c ≠ 0
and knowledge of the first two terms u0 and u1.
The set of real sequences which satisfy the relation (1) is a vector space
of dimension 2.
We seek a basis by solving the characteristic equation:

ar2 + br + c = 0 (E)
- Complex cases a, b, c
If ∆ ≠ 0, (E) has two distinct roots r1 and r2. Any sequence satisfying (1) is then
like :
where K1 and K2 are constants which we then express as a function of u0 and u1.

If ∆ = 0, (E) has a double root r0 = (- b) / 2a. Any sequence satisfying (1) is then
type:


- Case a, b, c real
If ∆> 0 or ∆ = 0, the form of the solutions is not modified.
If ∆ <0, (E) has two conjugate complex roots r1 = α + iβ and r2 = α − iβ
that we write in trigonometric form r1 = ρeiθ and r2 = ρe-iθ

Any sequence satisfying (1) is then of the type:


• Recurrent sequences un + 1 = f (un)

- To study such a sequence, we first determine an interval I containing all
the following values.
- Possible limit
If (un) converges to l and if f is continuous to l, then f (l) = l.
- Increasing case f
If f is increasing over I, then the sequence (un) is monotonic.
The comparison of u0 and u1 makes it possible to know if it is increasing or decreasing.
- Decreasing case f
If f is decreasing over I, then the sequences (u2n) and (u2n + 1) are monotonic and of
contrary




Made by LEON
verified badge
Ronald
Preparation course for the official Probatory Baccalaureate and BEPC exam also intermediate class on all scientific subjects and in computer bonus.
Knowledge in outdoor classes is a plus but otherwise a brief summary of the course will be made before starting the lesson
verified badge
Garba
I specialize in tutoring math, computer science and physics for ordinary level students and preparing them to obtain excellent result in GCE Ordinary Level exams. My goal is to keep students challenged, but not overwhelmed. I assign homework after every lesson and provide periodic progress reports. I also apply different methods of teaching.
verified badge
Achua
Dedicated, resourceful and goal-driven professional educator with a solid commitment to the social and academic growth and development of every child.
An accommodating and versatile individual with the talent to develop inspiring hands-on lessons that will capture a child's imagination .
verified badge
Bomen
Is your coding class leaving you in the dust? You're not alone. Computer science concepts can be tricky, but they don't have to be.

I specialize in transforming confusion into clarity. With 5+ years of professional coding and 3+ years of dedicated teaching experience, I have a knack for breaking down complex topics into simple, understandable steps.

With me, you will:

· Demystify Tough Topics: Understand the "why" behind algorithms, object-oriented programming, and more.
· Learn at Your Pace: Get patient, one-on-one support tailored to your specific questions and learning style.
· Gain Unshakable Confidence: Turn your weakest subject into your greatest strength and ace your exams.

Don't let one confusing class hold you back. Let's unlock your potential together.
star icon
5
2 reviews
message icon
Contact Dimitri
repeat students icon
1st lesson is backed
by our Good-fit Instructor Guarantee
Private lessons
arrow icon
Computer Science
arrow icon
Microsoft Word
arrow icon
Computer Basics
Similar classes
arrow icon previousarrow icon next
verified badge
Léon
Digital suites courses

I - General
A numeric sequence is an application from N to R.
• Bounded sequence
A sequence (Un) is bounded if there exists a real A such that, for all n, Un ≤ A. We say that A is an upper bound of the series.
A sequence (Un) is reduced if there exists a real number B such that, for all n, B ≤ one. One says
that B is a lower bound of the sequence.
A sequence is said to be bounded if it is both increased and reduced, that is to say if it
exists M such that | Un | ≤ M for all n.

• Convergent suite

The sequence (Un) is convergent towards l ∈ R if:
∀ε> 0 ∃n0 ∈ N ∀n ≥ n0 | un − l | ≤ ε.
A sequence which is not convergent is said to be divergent.
When it exists, the limit of a sequence is unique.
The deletion of a finite number of terms does not modify the nature of the sequence, nor its possible limit.
Any convergent sequence is bounded. An unbounded sequence cannot therefore be convergent.

• Infinite limits

We say that the following (un) diverges

Towards + ∞ if: ∀A> 0 ∃n0∈N ∀n ≥ n0 Un≥A
Towards −∞ if: ∀A> 0 ∃n0∈N ∀n≤ n0 Un≤A.

• Known limitations

For k> 1, α> 0, β> 0


II Operations on suites

• Algebraic operations

If (un) and (vn) converge towards l and l ', then the sequences (un + vn), (λun) and (unvn) respectively converge towards l + l', ll and ll '.

If (un) tends to 0 and if (vn) is bounded, then the sequence (unvn) tends to 0.

• Order relation

If (un) and (vn) are convergent sequences such that we have a ≤ vn for n≥n0,
then we have:
Attention, no analogous theorem for strict inequalities.

• Framing theorem

If, from a certain rank, un ≤xn≤ vn and if (un) and (vn) converge towards the
same limit l, then the sequence (xn) is convergent towards l.


III monotonous suites

• Definitions

The sequence (un) is increasing if un + 1≥un for all n;
decreasing if un + 1≤un for all n;
stationary if un + 1 = one for all n.

• Convergence

Any sequence of increasing and increasing reals converges.
Any decreasing and underestimating sequence of reals converges.
If a sequence is increasing and not bounded, it diverges towards + ∞.

• Adjacent suites

The sequences (un) and (vn) are adjacent if:
(a) is increasing; (vn) is decreasing;

If two sequences are adjacent, they converge and have the same limit.

If (un) increasing, (vn) decreasing and un≤vn for all n, then they converge to
l1 and l2. It remains to show that l1 = l2 so that they are adjacent.

IV Extracted suites

• Definition and properties

- The sequence (vn) is said to be extracted from the sequence (un) if there exists a map φ of N
in N, strictly increasing, such that vn = uφ (n).
We also say that (vn) is a subsequence of (un).
- If (un) converges to l, any subsequence also converges to l.

If sequences extracted from (un) all converge to the same limit l, we can conclude that (un) converges to l if all un is a term of one of the extracted sequences studied.
For example, if (u2n) and (u2n + 1) converge to l, then (un) converges to l.

• Bolzano-Weierstrass theorem

From any bounded sequence of reals, we can extract a convergent subsequence.

V Suites de Cauchy

• Definition

A sequence (un) is Cauchy if, for any positive ε, there exists a natural integer n0 for which, whatever the integers p and q greater than or equal to n0, we have | up − uq | <ε.
Be careful, p and q are not related.

• Property

A sequence of real numbers, or of complexes, converges if, and only if, it is
Cauchy




SPECIAL SUITES

I Arithmetic and geometric sequences

• Arithmetic sequences

A sequence (un) is arithmetic of reason r if:

∀ n∈N un + 1 = un + r

General term: un = u0 + nr.

Sum of the first n terms:


• Geometric sequences

A sequence (un) is geometric of reason q ≠ 0 if:

∀ n∈N un + 1 = qun.

General term: un = u0qn

Sum of the first n terms:

II Recurring suites

• Linear recurrent sequences of order 2:

- Such a sequence is determined by a relation of the type:

(1) ∀ n∈N aUn + 2 + bUn + 1 + cUn = 0 with a ≠ 0 and c ≠ 0
and knowledge of the first two terms u0 and u1.
The set of real sequences which satisfy the relation (1) is a vector space
of dimension 2.
We seek a basis by solving the characteristic equation:

ar2 + br + c = 0 (E)
- Complex cases a, b, c
If ∆ ≠ 0, (E) has two distinct roots r1 and r2. Any sequence satisfying (1) is then
like :
where K1 and K2 are constants which we then express as a function of u0 and u1.

If ∆ = 0, (E) has a double root r0 = (- b) / 2a. Any sequence satisfying (1) is then
type:


- Case a, b, c real
If ∆> 0 or ∆ = 0, the form of the solutions is not modified.
If ∆ <0, (E) has two conjugate complex roots r1 = α + iβ and r2 = α − iβ
that we write in trigonometric form r1 = ρeiθ and r2 = ρe-iθ

Any sequence satisfying (1) is then of the type:


• Recurrent sequences un + 1 = f (un)

- To study such a sequence, we first determine an interval I containing all
the following values.
- Possible limit
If (un) converges to l and if f is continuous to l, then f (l) = l.
- Increasing case f
If f is increasing over I, then the sequence (un) is monotonic.
The comparison of u0 and u1 makes it possible to know if it is increasing or decreasing.
- Decreasing case f
If f is decreasing over I, then the sequences (u2n) and (u2n + 1) are monotonic and of
contrary




Made by LEON
verified badge
Ronald
Preparation course for the official Probatory Baccalaureate and BEPC exam also intermediate class on all scientific subjects and in computer bonus.
Knowledge in outdoor classes is a plus but otherwise a brief summary of the course will be made before starting the lesson
verified badge
Garba
I specialize in tutoring math, computer science and physics for ordinary level students and preparing them to obtain excellent result in GCE Ordinary Level exams. My goal is to keep students challenged, but not overwhelmed. I assign homework after every lesson and provide periodic progress reports. I also apply different methods of teaching.
verified badge
Achua
Dedicated, resourceful and goal-driven professional educator with a solid commitment to the social and academic growth and development of every child.
An accommodating and versatile individual with the talent to develop inspiring hands-on lessons that will capture a child's imagination .
verified badge
Bomen
Is your coding class leaving you in the dust? You're not alone. Computer science concepts can be tricky, but they don't have to be.

I specialize in transforming confusion into clarity. With 5+ years of professional coding and 3+ years of dedicated teaching experience, I have a knack for breaking down complex topics into simple, understandable steps.

With me, you will:

· Demystify Tough Topics: Understand the "why" behind algorithms, object-oriented programming, and more.
· Learn at Your Pace: Get patient, one-on-one support tailored to your specific questions and learning style.
· Gain Unshakable Confidence: Turn your weakest subject into your greatest strength and ace your exams.

Don't let one confusing class hold you back. Let's unlock your potential together.
Good-fit Instructor Guarantee
favorite button
message icon
Contact Dimitri