Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Find the largest prime number required to test as a divisor to determine if the following number is a prime number. Also determine if the number is a prime number: 117
Given: The number 117
To find: The largest prime number required to test as a divisor to determine if the following number is a prime number
Solution:
To check if a number is prime, we should divide the number with prime numbers 2,3,5,7,11.... and see if any one of them is divisible.
This process we have to continue till the square root of the given number.
Square root of 117 < square root of 121 = 11.
So we have to check up to 11, to see whether 117 is a prime number or not
Let us start with 2. 117 is not divisible by 2.
Next 3. 117 is divisible by 3, so it is not a prime number
138 Views
