🎓 Top 15 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare — All my Udemy courses are real-time and project oriented courses.
▶️ Subscribe to My YouTube Channel (178K+ subscribers): Java Guides on YouTube
▶️ For AI, ChatGPT, Web, Tech, and Generative AI, subscribe to another channel: Ramesh Fadatare on YouTube
1. Introduction
A prime number is a number greater than 1 that has no positive divisors other than 1 and itself. In this blog post, we will create a TypeScript program to check whether a given number is prime or not.
2. Program Overview
The program defines a function isPrime that checks if a number is prime by testing whether it's divisible by any number less than itself. To optimize this, we only need to test divisibility up to the square root of the number.
3. Code Program
// Function to check if a number is prime
function isPrime(num: number): boolean {
if (num <= 1) return false; // Numbers less than or equal to 1 are not prime
if (num <= 3) return true; // 2 and 3 are prime numbers
// Check divisibility by 2 and 3
if (num % 2 === 0 || num % 3 === 0) return false;
let i = 5;
while (i * i <= num) {
if (num % i === 0 || num % (i + 2) === 0) return false;
i += 6;
}
return true;
}
// Test the function
const numberToCheck = 29;
if (isPrime(numberToCheck)) {
console.log(`${numberToCheck} is a prime number.`);
} else {
console.log(`${numberToCheck} is not a prime number.`);
}
Output:
29 is a prime number.
4. Step By Step Explanation
1. We define the isPrime function to check the primality of a number.
2. First, we check if the number is less than or equal to 1. If so, the function immediately returns false since numbers less than 2 aren't prime.
3. We then verify if the number is 2 or 3. These are prime numbers, so we return true.
4. Next, we check if the number is divisible by 2 or 3, returning false if it is.
5. We then loop through numbers greater than 3, up to the square root of the input number, and check for divisibility. Here, we increment by 6 (since we've already checked for divisibility by 2 and 3) and check divisibility for both i and i + 2.
6. If the number is not divisible by any of these numbers, we conclude it's prime.
7. Finally, we test the function with the number 29 and display the result.
My Top and Bestseller Udemy Courses. The sale is going on with a 70 - 80% discount. The discount coupon has been added to each course below:
Build REST APIs with Spring Boot 4, Spring Security 7, and JWT
![[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25](https://img-c.udemycdn.com/course/750x422/6852721_b512_2.jpg "[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25")
[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25
ChatGPT + Generative AI + Prompt Engineering for Beginners
Spring 7 and Spring Boot 4 for Beginners (Includes 8 Projects)
Available in Udemy for Business
Building Real-Time REST APIs with Spring Boot - Blog App
Available in Udemy for Business
Building Microservices with Spring Boot and Spring Cloud
Available in Udemy for Business
Java Full-Stack Developer Course with Spring Boot and React JS
Available in Udemy for Business
Build 5 Spring Boot Projects with Java: Line-by-Line Coding
Testing Spring Boot Application with JUnit and Mockito
Available in Udemy for Business
Spring Boot Thymeleaf Real-Time Web Application - Blog App
Available in Udemy for Business
Master Spring Data JPA with Hibernate
Available in Udemy for Business
Spring Boot + Apache Kafka Course - The Practical Guide
Available in Udemy for Business
Comments
Post a Comment
Leave Comment