Trusted teacher

1Students

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 !

Trusted teacher

1. Introduction to Computer Science: - Discovery of the computer: Hardware and Software - Basic knowledge of computing and computer use - Exploring the user interface: desktop, taskbar, icons, etc. 2. Learning Navigation Skills: - How to browse the Internet safely - Discovery of search engines and web browsers - How to create and manage favorites 3. Introduction to programming: - Understand the concept of programming - Learn the basics of programming with simple languages - Use visual programming blocks to create simple programs - Understand programming variables, loops and conditions and their use 4. Discovery of software suites: - Use of Microsoft Office suites and Google Apps to create documents, presentations and spreadsheets - Introduction to graphic design software such as GIMP, Canva, etc. 5. Computer Security: - Basic security rules to protect their digital environment - How to avoid online scams and computer viruses 6. Conclusion: - Training summary - Professional opportunities in IT This study program can be adapted to meet the individual needs of children, based on their skill level and interest.

Trusted teacher

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

Trusted teacher

15Students

Python is the most in-demand programming language in the world right now — and one of the easiest to learn with the right guidance. Whether you've never written a line of code or you're a student who needs to pass a programming course, this is a practical, no-fluff introduction that gets you writing real code from session one. What we can cover depending on your goals: Python fundamentals: variables, loops, functions, data structures - Object-oriented programming (OOP) - Data manipulation with pandas and NumPy - Introduction to machine learning with scikit-learn - Database management with SQL - C and Java upon request - MATLAB and R available for engineering/science students Why learn with me? I'm not a student teaching on the side — I'm a professional engineer who uses Python daily for data analysis, modeling, and automation. I know exactly which concepts matter in the real world and which ones you can skip for now. Sessions are 100% personalized: I adapt the pace, the examples, and the exercises to your background and your goal — whether that's passing your university exam, building a project, or landing a job.

Trusted teacher

6Students

If you’ve ever felt that science and math are difficult, it’s probably because no one showed you how to think like a problem solver. In my classes, you’ll learn not just formulas or code but how to truly understand concepts, apply them, and build strong logical intuition. I teach: • 🔢 Mathematics: From algebra and calculus to applied problem-solving for real-world use. • 💻 Computer Science: Coding fundamentals (Python, C++), algorithms, and logical thinking for beginners and intermediate learners. • ⚛️ Physics: Mechanics, thermodynamics, and practical examples that make abstract ideas simple and visual. As a Software Engineer and Master’s student in Engineering at Nagoya University, I bring both academic knowledge and hands-on experience from real projects. My teaching approach is interactive, visual, and deeply focused on understanding over memorization. Let’s turn complex problems into clear, step-by-step insights — and make learning something you genuinely enjoy.

Trusted teacher

8Students

You will learn Systematic Reasoning & Logical Thinking which is a requirement for entering Computer Science program in many universities. The book “Delftse Foundations of Computation” especially its second chapter will be the main source of our lesson, but other more in-depth books will be also covered if you want to improve even further on logical thinking. The topics in our lesson include: • Propositional Logic: Logical operators; Precedence rules; Logical equivalence; Implications in English; Exclusive or; Universal operators; Classifying propositions • Boolean Algebra: Substitution laws • Logic Circuits: Logic gates; Combining gates to create circuits; From circuits to propositions; Disjunctive Normal Form; Binary addition. • Predicate Logic: Predicates; Quantifiers; Tarski’s world and formal structures; • Deduction: Valid arguments and proofs; Proofs in predicate logic If you have any additional questions before starting a class, please feel free to ask me. I am here to assist! :)