The smallest number is LCM(2, 3, 4, 5, 6) + 1 = 61
The answer is 13. If the remainder was 14 or more, then the quotient could be increased by 1 or more and the remainder reduced by the appropriate multiple of 14.
The greatest whole number is 5, but you could get a value higher than 5 but less that 6 if there are decimal places involved. So you could have a remainder of 5.999999999999999999 for example.
The smallest number of triangles that you could divide a nonagon into is seven.
15.6667
Because if the remainder is greater, then you could "fit" another divisor value into it. if they are equal, then you can divide it easily. Thus, the remainder is always lower than the divisor.
So to do this the number needs to be greater than 13 by at least 8. So an equation could be 13 + 8 = x X = 21
The answer is 13. If the remainder was 14 or more, then the quotient could be increased by 1 or more and the remainder reduced by the appropriate multiple of 14.
The greatest whole number is 5, but you could get a value higher than 5 but less that 6 if there are decimal places involved. So you could have a remainder of 5.999999999999999999 for example.
4
There is no such number. You could divide it by 2/15 = 0.133... to make 27,000, which is 303 Or, you could divide it by a thousandth of that = 0.000133... to make 27,000,000 which is 3003. Or you could divide it by a still smaller number, a thousandth of the above number to make 27 billion - which is 3,0003. Or a thousandth of that ... and so on.
The smallest number of triangles that you could divide a nonagon into is seven.
It must be less else you have not divided properly; you could divide again 1 or more times!If the remainder is equal to the divisor (or equal to a multiple of the divisor) then you could divide again exactly without remainder. If the remainder is greater but not a multiple of the divisor you could divide again resulting in another remainder.E.g. Consider 9/2. This is 4 remainder 1. Let's say our answer was 3 remainder 3; as our remainder "3" is greater than the divisor "2" we can divide again so we have not carried out our original division correctly!
When dividing any integer by 17, the remainder can range from 0 to 16, as the remainder must be less than the divisor. Therefore, the greatest possible remainder when the divisor is 17 is 16. This means that when any integer is divided by 17, the remainder will be less than 17 but could be as high as 16.
15.6667
Because if the remainder is greater, then you could "fit" another divisor value into it. if they are equal, then you can divide it easily. Thus, the remainder is always lower than the divisor.
If you divid 3 by 2 you get 1r1 3 goes into 2 once which is 2. 2-2=1 3 cant go into 1 so its 1 r1 1r1 3) 2 -2 1
5