answersLogoWhite

0

2, 3, and every integer of the form 6n +/- 1 up to the square root of the number, rounded up. This is the simplest way to check a smaller subset of possible divisors, and yet not worry about the primality of the divisors.

User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

RossRoss
Every question is just a happy little opportunity.
Chat with Ross
RafaRafa
There's no fun in playing it safe. Why not try something a little unhinged?
Chat with Rafa
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor

Add your answer:

Earn +20 pts
Q: What do divide a number by to see if its prime?
Write your answer...
Submit
Still have questions?
magnify glass
imp