Standard Math Algorithms in TypeScript

Welcome to the lesson on Standard Math Algorithms in TypeScript. Many software engineering problems require the understanding and application of standard math algorithms. They form the basis of many complex real-life implementations. As a programmer, your expertise in using math algorithms in TypeScript not only helps you solve complex problems efficiently but also gives you confidence in handling data-intensive tasks. In this lesson, we will specifically delve into the use of prime numbers, an important area of standard math algorithms.

Let's consider a simple use case — identifying if a number is prime or not. A prime number is a number greater than 1 that has no positive divisors other than 1 and itself. Here's a quick and efficient way to check if a number n is prime: we iterate through 2 to the square root of n. If n is divisible by any of these numbers, it's not a prime number. If n is not divisible by any of the numbers in the range, then it's a prime number.

Here is what the solution will look like in TypeScript:

function isPrime(n: number): boolean {
    // Function to check if n is a prime number
    if (n <= 1) {
        return false;
    }
    for (let i = 2; i <= Math.sqrt(n); i++) {
        if (n % i === 0) {
            return false;
        }
    }
    return true;
}

// Example usage
console.log(isPrime(10)); // Outputs: false
console.log(isPrime(11)); // Outputs: true

Notice how the function parameters and return types have been explicitly annotated with types (number and boolean), enhancing clarity and preventing errors.