A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 one year ago
If you want to examine if a integer is a prime number can you try with dividing it by
the prime numbers 2 , 3, 5 etc . What is the largest prime number that there is reason to try ?
Determine if any of the numbers 171, 203 , 211, 567 or 7669 is prime and factorize them otherwise.
anonymous
 one year ago
If you want to examine if a integer is a prime number can you try with dividing it by the prime numbers 2 , 3, 5 etc . What is the largest prime number that there is reason to try ? Determine if any of the numbers 171, 203 , 211, 567 or 7669 is prime and factorize them otherwise.

This Question is Closed

IrishBoy123
 one year ago
Best ResponseYou've already chosen the best response.4the number's square root is a cut off point

welshfella
 one year ago
Best ResponseYou've already chosen the best response.1A short cut to see if a number is divisible 3 is to add the digits up until you have 1 didigte If this digit is 3 , 6 or 9 then t is divisible by 3.

welshfella
 one year ago
Best ResponseYou've already chosen the best response.1so from this you can see that 171 and 567 are not prime

welshfella
 one year ago
Best ResponseYou've already chosen the best response.1square root of 203 is 14.25 so you keep dividing by prime numbers up to and including 13.

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.0It is sort of fun to think about why the square root thing works.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0@@zzr0ck3r could you explain why that works? is it because everything after the squareroot is like testing the dividers all over again?

welshfella
 one year ago
Best ResponseYou've already chosen the best response.1I think it works because if there is an integer quotient you would have found it already when dividing by the lower primes.

welshfella
 one year ago
Best ResponseYou've already chosen the best response.1 yes  it is like testing the dividers all over again

imqwerty
 one year ago
Best ResponseYou've already chosen the best response.0well lets take any number say x the biggest factor of any number can be the square root of the number itself :) when u prime factorize x u will get prime numbers as its factors so the prime factors of any number x are always smaller than or equal to root{x} if x is a prime number then there will be no factors but if x is composite then the factors it will have will always be less than or equal to root(x) so to check if x is prime we find root x nd then try dividing x by all prime numbers less then rootx

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0so if Im gonna see if 7669 is a prime, how do i do? the sqrt of 7669 is 87.6, then still I gotta know the primes upp to that

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0@zzr0ck3r , @welshfella , @imqwerty

welshfella
 one year ago
Best ResponseYou've already chosen the best response.1thats correct because square root of 7669 is 87.57

welshfella
 one year ago
Best ResponseYou've already chosen the best response.1oh you found that already  sorry
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.