Short Tricks to Find Unit Digit of an Expression (2)

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/number-system-bff2d7/unit-digit-last-digit-concepts/asset-short-tricks-to-find-unit-digit-of-an-expression-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive tutorial on finding the unit digit of large exponential numbers, a common problem in competitive exams. The instructor begins by introducing the concept of unit digit cyclicity, explaining that the unit digit of a number raised to a power follows a repeating pattern. The lesson systematically breaks down the behavior of digits 0 through 9. It first establishes that digits 0, 1, 5, and 6 have a cyclicity of 1, meaning their unit digit remains unchanged regardless of the power. Next, it covers digits 4 and 9, which have a cyclicity of 2, with their unit digits alternating between two values based on whether the exponent is odd or even. The core of the lesson focuses on digits 2, 3, 7, and 8, which all have a cyclicity of 4, meaning their unit digits cycle through four different values. The instructor demonstrates this by calculating the first few powers of each digit (e.g., 2^1=2, 2^2=4, 2^3=8, 2^4=16) to identify the repeating cycle. The video concludes by presenting a summary table that consolidates the cyclicity and power cycles for all digits 0-9, providing a quick reference for students. The entire explanation is supported by on-screen text, handwritten calculations, and a clear, step-by-step teaching approach.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title slide for a lesson on the 'NUMBER SYSTEM' by Yash Jain of Knowledge Gate Eduventures. The instructor introduces the topic, which is to find the unit digit of large exponential numbers. The first concept presented is that digits 0, 1, 5, and 6 have a cyclicity of 1, meaning their unit digit remains the same when raised to any power. For example, the text on screen states: '0^n = 0, 1^n = 1, 5^n = 5, 6^n = 6.' This establishes the foundation for the lesson.

  2. 2:00 – 5:00 02:00-05:00

    The instructor explains the cyclicity of digits 4 and 9, which have a cycle of 2. The on-screen text states: 'Digits 4 & 9: Both these numbers have a cyclicity of only two different digits as their unit digit.' The instructor demonstrates this by calculating the powers of 4: 4^1 = 4 (unit digit 4), 4^2 = 16 (unit digit 6), 4^3 = 64 (unit digit 4), and 4^4 = 256 (unit digit 6). This shows a repeating pattern of 4 and 6. The same logic is applied to 9, where 9^1 = 9, 9^2 = 81, 9^3 = 729, etc., showing a cycle of 9 and 1. The key takeaway is that for these digits, the unit digit depends on whether the exponent is odd or even.

  3. 5:00 – 10:00 05:00-10:00

    The lesson progresses to the most complex case: digits 2, 3, 7, and 8, which have a cyclicity of 4. The on-screen text states: 'Digits 2, 3, 7 & 8: These numbers have a power cycle of 4 different numbers.' The instructor demonstrates this by showing the power cycles. For digit 2: 2^1 = 2, 2^2 = 4, 2^3 = 8, 2^4 = 16, and then the cycle repeats (2, 4, 8, 6). For digit 3: 3^1 = 3, 3^2 = 9, 3^3 = 27, 3^4 = 81, and then the cycle repeats (3, 9, 7, 1). The same pattern is shown for 7 and 8. The method to solve a problem is to find the remainder when the exponent is divided by 4, which determines the position in the 4-step cycle.

  4. 10:00 – 15:00 10:00-15:00

    The instructor applies the learned concepts to solve a specific problem: finding the unit digit of 287^562581. The on-screen text shows the problem statement. The solution involves identifying the unit digit of the base, which is 7. The instructor then refers to the previously established rule that the unit digit of 7 follows a cycle of 4: 7, 9, 3, 1. To find the unit digit of 7^562581, the exponent 562581 is divided by 4. The remainder is 1 (since 562581 = 4*140645 + 1). This means the unit digit corresponds to the first number in the cycle, which is 7. The instructor also shows a list of other problems for practice, such as 185^563 and 271^6987, to reinforce the method.

  5. 15:00 – 18:33 15:00-18:33

    The video concludes with a summary table that consolidates all the concepts. The table, titled 'Cyclicity Table', lists the digits 0-9, their cyclicity (1, 2, or 4), and their power cycle. For example, it shows that digit 2 has a cyclicity of 4 and a power cycle of 2, 4, 8, 6. The instructor reviews the table, circling the key values. The final frame is a 'Thank You for Watching' message, indicating the end of the lesson.

The video presents a structured and logical progression for solving unit digit problems. It begins with the simplest cases (digits with cyclicity 1) and builds complexity by introducing digits with cyclicity 2 and then the most common case (cyclicity 4). The core method is to identify the unit digit of the base, determine its cyclicity, and then use the remainder of the exponent divided by the cyclicity to find the corresponding digit in the cycle. This systematic approach, reinforced by a summary table, provides students with a reliable and efficient strategy for tackling these types of questions in exams.

Loading lesson…