answersLogoWhite

0


Best Answer

Yes, unless you divide the number by itself, then the answer would be one. Also, you can divide it by one, and the answer would be that number.

User Avatar

Wiki User

13y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Is there a remainder when you divide a prime number?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

How do you check if a large number is prime or a composite number?

You divide the number by 2. If the number is able to divide WITHOUT a remainder, then it is a prime number. If you divide a number by 1, you will get the same number. That is not a prime number.


How many ways can you find the prime factorization of a number?

Divide it by each prime number which does not have remainder.


Will you have a remainder if you divide an even number by a prime number?

Not always. 8 ÷ 2 = 4 14 ÷ 7 = 2


How can you tell that 187 is not a prime number?

A prime number is a number that is only evenly divisible by 1 and itself, since 11 and 17 both divide equally (no remainder) into 187 - it is not prime.


Prime factor of 9?

To find a prime factor of a number, divide by 2 and see if you get no remainder. Then divide by 3, 4, 5, and so on, until one of the numbers you try gets you no remainder. If no such numbers work below the number you chose, it is prime. In the case of the number 9, 2 does not go into 9, but 3 does.


Suggest two different methods of knowing if a given integer is prime and analyze them?

With exception of '2' all prime numbers are odd. Any odd number that ends in '5' is not a prime. Any number that ends in 0,2,4,6,8 are even and not primes. '9' is a composite number and not a prime. So you are left with 3 or 7 , which are primes. So taking a number , say '23' divide by '3' leaves a remainder of '2' so it is a prime. Similarly '23' divided by '7' leaves a remainder of '2' so 23 is a prime. If No remainder is left then the number is composite and not a prime. e.g. 4567 is it a prime ? Its odd so could be a prime Does it divide by '3' answer 1522 remainder '1' so it is a prime. Try '7' answer 652 remainder '3' it is a prime. Hence 4567 is a definite prime number.


Find the smallest number that meets all of these conditions divide the number by 5 remainder 3 divide the number by 8 remainder 2 divide the number by 9 remainder 4?

58


What divides into 5?

Since 5 is a prime number only the numbers 1 and 5 divide it without a remainder.


How do you find the prime factorization of 95?

try to divide it by the lowest prime number (2). If it leaves a remainder, try the next highest prime. In this case the lowest prime to divide 95 evenly is 5 and 5 x 19 is your answer as 19 is also a prime.


What does it mean when a number is divisible by two?

It means that when you divide the number by two, there's no remainder. Also, it means that 2 is one of its prime factors.


How do you make a remainder into a decimal?

you have to divide the remainder by the number you are dividing


What is the whole number remainder you can divide by 5?

Your question's meaning eludes me. You can divide any number by 5, whether or not it is a remainder, and why would you want to divide a remainder by 5 anyway?