Tutorials  Articles  Notifications  Login  Signup


Tutorials > Mathematics for Programmers


Introduction What is binary number system Convert a number from decimal to binary Verify a Prime number - Trial division method Sieve of Eratosthenes - Finding prime numbers Finding all factors of a number Prime factorization of a number GCD using Euclid's algorithm Area of polygon Direction of a point from a line segment
Introduction What is binary number system Convert a number from decimal to binary Verify a Prime number - Trial division method Sieve of Eratosthenes - Finding prime numbers Finding all factors of a number Prime factorization of a number GCD using Euclid's algorithm Area of polygon Direction of a point from a line segment


Mathematics for Programmers - Verify a Prime number - Trial division method


Previous Next





Video credits : mycodeshool

Prime numbers are very important for competitive programming. Verifying wheather a number is prime or not is an important task. In this tutorial, we'llVerify a Prime number using Trial division method.

 


No problems available for this topic.

Previous Next


HackerFriend Logo

Join the community of 1 Lakh+ Developers

Create a free account and get access to tutorials, jobs, hackathons, developer events and neatly written articles.


Create a free account