anonymous
  • anonymous
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.
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
IrishBoy123
  • IrishBoy123
the number's square root is a cut off point
welshfella
  • welshfella
A 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
  • welshfella
so from this you can see that 171 and 567 are not prime

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

welshfella
  • welshfella
square root of 203 is 14.25 so you keep dividing by prime numbers up to and including 13.
zzr0ck3r
  • zzr0ck3r
It is sort of fun to think about why the square root thing works.
anonymous
  • anonymous
@@zzr0ck3r could you explain why that works? is it because everything after the squareroot is like testing the dividers all over again?
welshfella
  • welshfella
I think it works because if there is an integer quotient you would have found it already when dividing by the lower primes.
welshfella
  • welshfella
- yes - it is like testing the dividers all over again
imqwerty
  • imqwerty
well 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
  • anonymous
so 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
  • anonymous
@zzr0ck3r , @welshfella , @imqwerty
zzr0ck3r
  • zzr0ck3r
yes
welshfella
  • welshfella
yes 2,3,5,7 etc
anonymous
  • anonymous
up to 83
welshfella
  • welshfella
thats correct because square root of 7669 is 87.57
welshfella
  • welshfella
oh you found that already - sorry
welshfella
  • welshfella
is 211 a prime?
anonymous
  • anonymous
no, 3*3*19
welshfella
  • welshfella
that is 171

Looking for something else?

Not the answer you are looking for? Search for more explanations.