discrete math ppt on how to solve maths easily

math ppt on discrete mathematics

1. NAME - RANJAN DAS STUDENT CODE- BWU/BTA/22/508 DEPT- B.TECH CSE (AIML) SEC – I  SEM- 4th COURSE NAME- DISCRETE MATHEMATICS COURSE CODE- PCC-CSM405 TOPIC –    DIVISON ALGORITHM

2. DESCRIPTION EXAMPLE  ADVANTAGES APPLICATIONS CONCLUSION INDEX

3. Euclid's DIVISON ALGORITHM Division algorithm states that given any two integers a & b with b > 0; There exist unique integers q & r such that a = bq +r, 0<= r<b, q ∈Z .   If  r=0 then  "b" is the HCF/GCD of "a & b . Ex- a = 50, b = 8              50 = 8 * 6 + 2 q = 6 , r = 2 a= bq+r    8)50( 6        48        2 If r  ≠ 0 ,  then apply Euclid'sdivision lemma to b and r. b = (r*m) + n For some integers m and n, 0 <= n < r  Continue this process till the remainder is zero.  The divisor which gives you the remainder as 0 is your HCF/GCD

4. ADVANTAGES Efficiency : The algorithm is highly efficient in finding the greatest common divisor (GCD) of two numbers. Its time complexity is proportional to the number of digits in the smaller number, making it suitable for large integers. Simplicity : The algorithm is straightforward and easy to understand. It consists of a few basic steps, making it accessible even to those with limited mathematical background. Applicability : It has broad applicability across different fields, including mathematics, computer science, and cryptography. Many algorithms and mathematical procedures rely on the Euclidean Division Algorithm as a fundamental step. Deterministic : The algorithm follows a deterministic process, meaning it will always produce the same result for the same input. This property is crucial for its reliability and predictability in various applications

5. APPLICATION Computer science (e.g., finding modular inverses, cryptographic algorithms) Mathematics (e.g., simplifying fractions, finding factors) ALGORITHM ANALYSIS (EG: SOLVING TIME COMPLEXITY FOR AN ALGORITHM) Architecture and Construction. Computer Graphics and Animation. Mechanical Engineering. Robotics and Automation.

6. CONCLUSION Euclidean Division Algorithm provides a systematic way to find the GCD of two numbers. It is fundamental in various fields, including mathematics and computer science. its deterministic nature and ability to handle large numbers make it indispensable in algorithm design and analysis, serving as a fundamental example in understanding computational complexity and algorithmic efficiency.

7. THANK YOU