121.
5
0.0261
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.
15
41
234568
41
5
The integer is 157. 157/3 = 52 remainder 1 157/5 = 31 remainder 2 157/7 = 22 remainder 3
36
71
2^30
127 is the least prime number greater than 25 that will have a remainder of 2 when divided by 25.
The smallest number that leaves a remainder of 2 when divided by 3, 4, 5 or 6 is 62. This can be found by analyzing the multiples of the greatest common divisor (GCD) of 3, 4, 5, and 6, which is 60. Adding 2 to this number gives us the smallest number with the specified remainder.
0.0261
104.
24 is answer.