Number Systems - HOT Questions (2)

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/quantitative-ability/number-system-bff2d7/perfect-squares-perfect-cubes-power-square-root-and-patterns/asset-number-systems-hot-questions-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): Introduction to CN, Data Communication, 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, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Yash Jain from Knowledge Gate, is a tutorial on solving a specific type of number system problem. The video begins with an introduction to the topic, followed by a detailed analysis of a question asking for the sum of 'n' and 'p' where the square root of the number 12345678987654321 is expressed as a repeating digit 'n' repeated 'p' times. The instructor uses a step-by-step approach, first demonstrating the pattern by calculating the squares of numbers composed of repeated 1s (e.g., 11, 111, 1111) to show that 111111111 squared equals 12345678987654321. This reveals that the square root is 111111111, which is the digit '1' repeated 9 times. Therefore, 'n' is 1 and 'p' is 9, making their sum 10. The video concludes with a final answer and a thank you message.

Chapters

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

    The video opens with a title card displaying 'NUMBER SYSTEM' in a stylized font against a grey background. It then transitions to a presentation slide with a colorful, patterned background. The slide is titled 'NUMBER SYSTEM' and includes the text 'The mysterious world of numbers...' and 'Basic To Advance'. The instructor, Yash Jain, is visible in a small window in the bottom right corner. The main content area of the slide shows a question: 'q. The square root of 12345678987654321 is nnnnn... upto 'p' times, find sum of n and p ?'. The instructor begins to explain the problem, writing the square root symbol and the number 12345678987654321 on the screen.

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

    The instructor continues to work on the problem, writing the equation '√12345678987654321 = nnnnn... p times' on the screen. He then begins to analyze the pattern of the number 12345678987654321. He writes a series of equations on the left side of the screen to demonstrate the pattern: '(11)^2 = 121', '(111)^2 = 12321', and '(1111)^2 = 1234321'. He then extends this pattern to the full number, writing '(111111111)^2 = 12345678987654321'. This shows that the number is the square of a number composed of nine 1s. He then writes 'n = 1' and 'p = 9' to identify the values of n and p.

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

    The instructor completes the solution by calculating the sum of n and p. He writes 'n + p = 1 + 9 = 10' on the screen. He then circles the number 10 to emphasize the final answer. The video concludes with a black screen displaying a red neon-style text box that says 'THANK YOU FOR WATCHING'. The instructor's voiceover confirms the answer is 10.

The video presents a clear, step-by-step solution to a number theory problem. It begins by identifying the problem: finding the sum of 'n' and 'p' where the square root of a large, palindromic number is a repeating digit. The core of the solution lies in recognizing a mathematical pattern: the square of a number composed of 'k' ones results in a palindrome that increases from 1 to k and then decreases back to 1. By applying this pattern to the given number, the instructor deduces that the square root is 111111111, which is the digit 1 repeated 9 times. This directly gives n=1 and p=9, leading to the final answer of 10. The video effectively uses visual aids and a logical progression to teach a problem-solving technique for a specific class of number system questions.

Loading lesson…