answersLogoWhite

0


Best Answer

There is no simple answer because there is no known pattern to prime numbers. You could try dividing the each number by all the prime numbers less than or equal to its square root. If none of the go into the number then it is a prime.

User Avatar

Wiki User

7y ago

Still curious? Ask our experts.

Chat with our AI personalities

ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
ReneRene
Change my mind. I dare you.
Chat with Rene
JudyJudy
Simplicity is my specialty.
Chat with Judy
More answers
User Avatar

fateme ansari

Lvl 5
5y ago

I think it is not simple by just a calculator. You can try dividing the each number by all the prime numbers less than or equal to its square root. But there is a site which has calculator for prime numbers that can tell you a number is prime or not. You can use it: prime-calculator dot com.

User Avatar

Add your answer:

Earn +20 pts
Q: How do you get the prime numbers with calculator?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

How do you factor prime numbers on ti-83 calculator?

It hardly seems necessary. Prime numbers only have two factors, one and themselves.


What are the prime numbers that are factors of 1620?

1,2,3,5 (Hint google "factor calculator")


How do you use your calculator to find prime numbers?

I suppose the calculator has no prime number-related function Suppose you want to know if x is a prime If x is not a prime then the greatest factor that can be in x is sqrt(x) So you can try to divide x by all prime numbers between 2 and sqrt(x), if none of this calculation returns an integer then x is prime.


When doing prime factorization of a number how would you know if your answer is already prime?

I researched this. Then I used a calculator to divide many numbers by any prime number and the also was a prime number. Verify this on your own calculator. Hope this helps, -Michael


Why is the calculator important?

Without it you wouldn't be able to find the square roots of prime numbers.


Is 41 prime or composite and explain?

41 is prime because you can only multiply 41 and itself to get 41, wich makes a number prime. You can check if a number is prime by dividing it by the numbers 2 to 9 and if you don't get a whole number from any of the numbers you divided them with, then the number is prime. It's easier if you use a calculator for dividing all the numbers unless you are good at math.


Is the number 41 a prime or composite number?

I think it is prime. but try this online calculator to understand a number is prime or not: prime-calculator dot com. It has lots of other abilities. enjoy it.


Is one number in the nineties a prime number?

Yes I believe, if my calculator is correct, 97 is one.


How do you find a prime number on a calculator?

actually I'm not sure that you can do it on a calculator or not. I think the only way is deviding untill the half of the number. But I recently have found a great site that works as calculator and it can help you to understand a number is prime or not. Go to prime-calculator dot com.


How do mathematicians determine whether or not really large numbers are prime?

A primality test is an algorithm for determining whether an input number is prime, but I'm willing to bet that a lot of mathematicians type "prime number calculator" into their web browsers.


Is 15 divisible by 7?

Try dividing it with a calculator. If you get numbers after the decimal point, it is NOT divisible.Try dividing it with a calculator. If you get numbers after the decimal point, it is NOT divisible.Try dividing it with a calculator. If you get numbers after the decimal point, it is NOT divisible.Try dividing it with a calculator. If you get numbers after the decimal point, it is NOT divisible.


How many prime numbers between 1 and 8888888888888888888888888888888888888888888888?

To determine the number of prime numbers between 1 and 8888888888888888888888888888888888888888888888, we can use the Prime Number Theorem. This theorem states that the density of prime numbers around a large number n is approximately 1/ln(n). Therefore, the number of prime numbers between 1 and 8888888888888888888888888888888888888888888888 can be estimated by dividing ln(8888888888888888888888888888888888888888888888) by ln(2), which gives approximately 1.33 x 10^27 prime numbers.