Scribd
Upload
0 views3 pages

Algorithms in Math - Key Notes

An algorithm is a defined step-by-step procedure for solving mathematical problems, characterized by input, output, definiteness, finiteness, and effectiveness. Common mathematical algorithms include the Euclidean Algorithm, Prime Factorization, Sieve of Eratosthenes, Long Division, Binary Search, and Newton-Raphson Method. Algorithms are crucial for problem-solving in mathematics and serve as the foundation for computer algorithms and various applications in proofs and data analysis.

Uploaded by

raphaelvicuna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 views3 pages

Algorithms in Math - Key Notes

An algorithm is a defined step-by-step procedure for solving mathematical problems, characterized by input, output, definiteness, finiteness, and effectiveness. Common mathematical algorithms include the Euclidean Algorithm, Prime Factorization, Sieve of Eratosthenes, Long Division, Binary Search, and Newton-Raphson Method. Algorithms are crucial for problem-solving in mathematics and serve as the foundation for computer algorithms and various applications in proofs and data analysis.

Uploaded by

raphaelvicuna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

📘 Algorithms in Mathematics – Key Notes

🔹 What is an Algorithm?
●​ An algorithm is a step-by-step procedure for solving a mathematical problem or
performing a computation.​

●​ It has a clear starting and ending point, and each step is precisely defined.​

🔹 Characteristics of a Good Algorithm


1.​ Input – Accepts 0 or more inputs.​

2.​ Output – Produces at least 1 output.​

3.​ Definiteness – Each step is clearly and unambiguously defined.​

4.​ Finiteness – Must complete in a finite number of steps.​

5.​ Effectiveness – Basic enough to be carried out with simple tools (e.g., paper and
pencil).​

🔹 Common Mathematical Algorithms


✅ 1. Euclidean Algorithm
●​ Finds the Greatest Common Divisor (GCD) of two integers.​

Steps:​
​
java​
CopyEdit​
while b ≠ 0:
temp = b
b = a % b
a = temp
return a

●​

✅ 2. Prime Factorization
●​ Breaks a number into prime factors using division by primes.​

●​ Example: 60 → 2 × 2 × 3 × 5​

✅ 3. Sieve of Eratosthenes
●​ Finds all prime numbers up to a given number n.​

●​ Eliminates multiples of each prime starting from 2.​

✅ 4. Long Division Algorithm


●​ Step-by-step process to divide large numbers.​

●​ Used in decimals, polynomial division, etc.​

✅ 5. Binary Search Algorithm


●​ Efficiently searches a sorted list by repeatedly dividing the search interval in half.​

●​ Math use: solving equations, locating roots, etc.​

✅ 6. Newton-Raphson Method
●​ Finds roots of real-valued functions numerically.​

●​ Iterative formula:​
xn+1=xn−f(xn)f′(xn)x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}xn+1​=xn​−f′(xn​)f(xn​)​

🔹 Algorithm vs Formula
●​ Algorithm = Process (how to solve)​
●​ Formula = Expression (what to calculate)​

🔹 Why Are Algorithms Important in Math?


●​ Essential for problem-solving​

●​ Forms the foundation of computer algorithms​

●​ Useful in proofs, optimization, number theory, and data analysis​

🔹 Practice Tip:
Try writing your own algorithms for:

●​ Calculating factorials​

●​ Finding Fibonacci numbers​

●​ Determining if a number is prime​

●​ Solving quadratic equations

You might also like