{"id":87880,"date":"2021-12-15T16:16:38","date_gmt":"2021-12-15T10:46:38","guid":{"rendered":"https:\/\/www.oliveboard.in\/blog\/?p=87880"},"modified":"2021-12-15T16:16:40","modified_gmt":"2021-12-15T10:46:40","slug":"prime-numbers","status":"publish","type":"post","link":"https:\/\/www.oliveboard.in\/blog\/prime-numbers\/","title":{"rendered":"Prime Numbers – Know All About them"},"content":{"rendered":"\n

Prime Numbers<\/strong> are basically positive integers that have just two factors: one and the integer itself. For example, factors of 10 are 1, 2, 5, and 10, for a total of four factors. We may alternatively define prime numbers as numbers that are only divisible by 1 and the number itself, or it may also be deduced as a positive number or integer that is not a product of any other two positive integers. One must keep in mind that 1 is neither prime nor composite. As a result, all prime numbers are bigger than one. We may also state that, with the exception of 1, the remaining numbers are classed as prime and composite numbers.<\/p>\n\n\n\n

\n
Prepare for UPSC Exam Now<\/a><\/div>\n<\/div>\n\n\n\n

What Are <\/strong>Prime Numbers<\/strong>?<\/strong><\/h2>\n\n\n\n

A Prime Numbers<\/strong> is defined as a positive integer with exactly two factors. If p is a prime, its only factors must be 1 and p itself. Any number that does not fall into this category is said to as a composite number, which signifies that it may be factored into other positive integers.<\/p>\n\n\n\n

How To Find <\/strong>Prime Numbers<\/strong>?<\/strong><\/h3>\n\n\n\n

According to the definition of Prime Numbers<\/strong>, these have just two factors. The original number and 1 would be the two components. As a result, we must determine the integers that have only two factors. This is feasible thanks to a simple procedure known as prime factorisation.<\/p>\n\n\n\n

It is simple to find the primes for lower numbers, but for greater numbers, we must devise a new method. As a result, we have demonstrated how to assess prime numbers not only for smaller digits but also for larger integers.<\/p>\n\n\n\n

Steps Involved To Find <\/strong>Prime Numbers<\/strong> Via Factorization Method<\/strong><\/h3>\n\n\n\n

Factorisation is the most effective method for discovering prime numbers. The following stages are involved in adopting the factorisation method:<\/p>\n\n\n\n

Step 1: To begin, determine the factors of the given integer.<\/p>\n\n\n\n

Step 2: Determine the number of factors that make up that number.<\/p>\n\n\n\n

Step 3: If there are more than two factors, the number is not a prime number.<\/p>\n\n\n\n

Demonstration To Find <\/strong>Prime Numbers<\/strong> Via Factorization Method<\/strong><\/h4>\n\n\n\n

Let the number be 21<\/strong><\/h4>\n\n\n\n

Now, 21 can be written as 7 \u00d7 3. So, the factors of 21 here are 1, 3, 7  and 21. Since the number of factors of 21 is more than 2, it is not a prime number but a composite number.<\/p>\n\n\n\n

Let the number be 36<\/strong><\/h4>\n\n\n\n

Now, 36 can be written as 2 \u00d7 3 \u00d7 2 \u00d7 3.  So, the factors of 36 here are 1, 2, 3, 4, 6, 9, 12, 18, and 36. Since the number of factors of 36 is more than 2, it is not a prime number but a composite number.<\/p>\n\n\n\n

Let the number be 13<\/strong><\/h4>\n\n\n\n

Now, 13 can be written as 1 x 13.  So, the factors of 13 here are 1 and 13. Since the number of factors of 13 is not more than 2, it is a Prime Number<\/p>\n\n\n\n

How To Know Whether A Large Integer Is Prime Or Not<\/strong><\/h3>\n\n\n\n

There are various Prime Number Formulas that may be used to determine the primes. Follow the procedures below to determine if a big number is a prime number or not:<\/p>\n\n\n\n

Step 1: Look at the number’s units location. It is not a prime number if it ends with 0, 2, 4, 6, or 8.<\/p>\n\n\n\n

“Numbers that finish in 0, 2, 4, 6, and 8 are never prime numbers since they would always have 2 as their factor.”<\/em><\/p>\n\n\n\n

Step 2: Add the digits of that number together. If the total is divisible by three, the integer is not prime.<\/p>\n\n\n\n

“Numbers whose sum of digits is divisible by three are never prime numbers,” says the rule.<\/em><\/p>\n\n\n\n

Step 3: Once the falsehood of steps 1 and 2 have been established, find the square root of the provided integer.<\/p>\n\n\n\n

Step 4: Divide the provided integer by the prime numbers that are less than its square root value.<\/p>\n\n\n\n

Step 5: If the number is divided by any of the prime numbers less than its square root, it is not prime; otherwise, it is.<\/p>\n\n\n\n

The exception is that if a huge number ends in 5, it is always divisible by 5. As a result, it is not a prime number.<\/em><\/p>\n\n\n\n\n\n

Illustration For Better Understanding<\/strong><\/h3>\n\n\n\n

Illustration 1<\/strong><\/h4>\n\n\n\n