15
The largest remainder, when dividing by any integer, n is n-1. So, when dividing by 2, the largest remainder is 1.
9
The greatest common factor
If the remainder must be an integer value, then the largest remainder you can have from any equation when dividing by 12 is a remainder of 11. Example: (23 / 12 = 1 R11) 12 goes into 23 one time, and there's 11 left over. If there was more than 11, such as (24 / 12), then the answer would be 2 with no remainder.
5
The largest [integer] remainder is 10. If the remainder was any more you would get one (or more) lots of 11.
The largest integer remainder is 6.
The largest remainder, when dividing by any integer, n is n-1. So, when dividing by 2, the largest remainder is 1.
8
9
The greatest common factor
14. The largest possible number for a remainder is 1 less than the divisor.
If the remainder must be an integer value, then the largest remainder you can have from any equation when dividing by 12 is a remainder of 11. Example: (23 / 12 = 1 R11) 12 goes into 23 one time, and there's 11 left over. If there was more than 11, such as (24 / 12), then the answer would be 2 with no remainder.
The largest possible remainder when dividing by any number N is N-1.
5
799
The remainder is the number that is left over after the initial value has been divided as much as it can. If any numbers greater than 48 were present as a remainder, then these could be divided further into 48. If 48 is present as the remainder, then this can be divided by 48 to give 1, leaving no remainder. Thus, the largest possible remainder if the divisor is 48 is 47.