what is the greatest remainder you can when you divide by 2?

Answer 1

The greatest remainder you can have when divised by 2 is 1 providing they are whole numbers not integer. If it was in this case, an integer then the answer would be 1.9 recurring

Answer 2

1

Answer 3

1

Answer 4

If you're dealing with integers, then the greatest remainder will be 1.

Think of it like this: Any integer will either be even or odd (but not both). If a number is even, then it can be written as 2m, where m is another integer. Thus, if you divide by 2, then you will have no remainder. However, if a number is odd, then it can be written as 2k+1, where k is another integer. That is, 1 is the remainder.

So, all integers will either have remainder 0 or remainder 1 when divided by 2.

Hope this is helpful! If you are interested in this sort of thing, you might enjoy looking up "modular arithmetic".

Answer 5

it's 1

Answer 6

1.

When an odd number is divided by 2, you will always have a remainder of 1.

Answer 7

Darren, I've just answered your other question and seen this.

Please do not believe the people who have written 1.9recurring. They are simply wrong. 1.9recurring IS 2.

To reiterate previous answer:

If dividing whole numbers the answer is 1
If not, the answer is that there IS no greatest remainder!

Hope this is clear.

Answer 8

1.

or 1.9999....if youre being terribly accurate

if you divide by any number N, then the greatest remainder you can ever have is (N-1)

Answer 9

1. 9 (recurring)

Answer 10

Half of the original.