answersLogoWhite

0


Want this question answered?

Be notified when an answer is posted

Add your answer:

Earn +20 pts
Q: Why can you not get a remainder of 2 when dividing a square number by 3?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the greatest remainder you can get when you divide by 2?

If you're dividing a whole number by 2, then the greatest possible remainder is 1.


If any number is divided by 3 and 5 then remainder comes 2 and 1. If the same number is divided by 15. what would be the remainder?

Dividing by 3 and then by 5 is equivalent to to dividing by 15; therefore, the remainder will be the same.


What is the largest remainder when dividing by 2?

The largest remainder, when dividing by any integer, n is n-1. So, when dividing by 2, the largest remainder is 1.


Why 9 is a odd number?

Because dividing it by 2 leaves a remainder of 1.


When dividing a 3 digit number by a 1 digit number for what divisors can you get a remainder of 8?

2


The number you divide by?

In a division such as 7 divided by 3 = 2 + 1 The number you are dividing - 7 - is the dividend The number you are dividing by - 3 - is the divisor The number you get - 2 - is the quotient The number left over - 1 - is the remainder.


How do you write the remainder 2 as a fraction?

The numerator of the fraction is '2'. The denominator of the fraction is the divisor (the number you were dividing by).


Are 3 and 9 odd numbers?

Yes they are. Any number that leaves a remainder when dividing by 2 is an odd number.


Is the remainder of a negative number divided by a positive number negative?

A subtle point is that the remainder is always a positive number. So -7 divided by 3 is -3, remainder 2 (rather than -2, remainder -1). This is important for the date of Easter because we must often calculate the remainder when dividing into a negative number. Since in that case we are not interested in the quotient it is sufficient to calculate the negative remainder and then simply add to it the number we were dividing by. So -11 mod 3 may be calculated as: -11 divided by 3 is -3, remainder -2, so the number required is -2 + 3 = 1.


How do you make a program to check remainder is zero or not inGW-BASIC?

So you have a number - "Number" and you need to find if the remainder of dividing it by a number is 0. Number = 3 If Number Mod 2 = 0 then Msgbox("Remainder of 0") End If This function divides by 2 then gives the remainder, this let's you check if a number is odd or even.


how do you work out prime factorization of 140?

It is: 2*2*5*7 = 140 by dividing it by each prime number that has no remainder


What is the answer of 19 remainder 2 divided by 3?

You can't divide something as a remainder, you must forst put it into decimal form. You can do this by dividing two by whatever the number you divided by in the equation that resulted in the answer '19 remainder 2.'