Trusted teacher

Want to create impactful visuals and professional videos without using complex software? This comprehensive Canva course is for you! 🔹 Course objective: To teach you how to easily design dynamic visuals and videos for your personal, professional, or school projects, using the Canva tool, accessible to all. ✅ What you will learn: Graphic design: - Getting started with the Canva interface (free or Pro version) - Creation of visuals: social media publications, flyers, logos, CVs, posters, presentations, etc. - Mastery of models, typography, colors, effects, layers and backgrounds - Design of brand kits for consistent communication - Layout tips for a professional look Video editing on Canva: - Create videos from templates or from scratch - Adding and editing video clips, images, animations and effects - Integration of music, voice-over and subtitles - Using the timeline, cutting, transitions and rhythm - High quality export for YouTube, Instagram, TikTok, etc. 🧑‍🎓 This course is ideal for: - Content creators, community managers, self-employed - Students, teachers, trainers - Freelancers and small businesses - Anyone who wants to easily produce quality visual and video content 🛠️ Methodology: Interactive and 100% practical training. Each participant creates their own visuals and videos from the very first sessions. The program can be adapted to your goals. 📍 Format: Online or in person (to be agreed) ⏱️ Duration: Flexible according to your needs (beginner or advanced) 💬 Language: French 🚀 Create your own visuals and videos with Canva – no complicated software, no hassle. Join this course and develop your creative superpowers!

Trusted teacher

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

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

Computer networking engineering is a vital field that underpins the modern world. It is the process of designing, building, and maintaining computer networks. Computer networking engineers apply their knowledge of computer science and engineering principles to create networks that are reliable, efficient, and secure. You will learn how to design computer networks from scratch and how to program protocols, security categories, OSPF, RIP, LAN, VLAN etc.....

Trusted teacher

19Students

I'm a working MEP engineer, currently building Python automation for Revit workflows daily - plan checks, model coordination, and repetitive drafting tasks. I teach other engineers, architects, and BIM professionals how to do the same, using pyRevit and real project workflows, not toy examples. Topics include: pyRevit fundamentals and setup Automating repetitive Revit tasks (model checks, plan generation, data extraction) Writing custom scripts for your firm's specific workflows Applying Python automation to real MEP/BIM projects

Trusted teacher

6Students

Are you looking for efficiency, creativity and productivity in your daily tasks? Do not look any further. Microsoft Office is there to meet all your expectations. Why choose Microsoft Office? Create with Power: Word, Excel, PowerPoint and many other applications give you powerful tools to bring your ideas to life, whether it's for a professional document, a financial dashboard or a stunning presentation. Collaborate with ease: OneDrive and Teams allow you to collaborate with your colleagues or friends, no matter where you are. Work together in real time, share files and communicate easily. Save Time with Automation: Excel simplifies complex tasks with smart formulas, while Outlook organizes your emails and calendar so you can focus on what matters. Advanced Security: Protect your data and privacy with advanced security features, such as two-step verification and access management. Advanced Programming: As a specialist, I master programming in VBA (Visual Basic for Applications) to automate your tasks and personalize your Office applications. Additionally, in the latest version of Microsoft Office you also have the option to program in Python, a language that I also master. Available Everywhere: Whether you're in the office, on the road, or at home, Microsoft Office is accessible on all your devices, allowing you to work wherever and whenever you want. Join the Microsoft Office Revolution! Don't let everyday challenges slow you down. Invest in the power of Microsoft Office and unlock your potential. Transform the way you work, create with ease, and reach new heights with Microsoft Office.

Trusted teacher

1Students

I offer one-to-one Programming tuition in Python, C, and C++, for GCSE Computer Science, A-Level Computing, and university students studying engineering, computer science, or related subjects. Lessons are available online or in person around Birmingham. What I cover: Python for beginners and intermediate learners C and C++ programming GCSE and A-Level Computer Science (all exam boards) University coursework support, debugging help, and project guidance Core concepts: variables, loops, functions, data structures, object-oriented programming, file handling, basic algorithms How I teach: I start by understanding exactly where you are — whether that's "I've never coded before" or "I'm stuck on a specific assignment." Then I build lessons around small, practical examples you can actually run and modify yourself. I'm patient with errors (everyone gets them), and I make sure you understand the why behind the code, not just how to copy it. For university students, I can also help with debugging, code reviews, and explaining tricky concepts in plain English. If you or your child is preparing for exams, working on coursework, or just wants to finally feel comfortable with coding, I'd love to help.