12 is the smallest whole number that gives a remainder of 4 when it is divided by 8.
3 divided by 2 goes once, remainder one.
To determine if 65483 is divisible by a certain number, you would typically divide 65483 by that number and check if the remainder is zero. 65483 divided by 2 has a remainder, so it is not divisible by 2. 65483 divided by 3 also has a remainder, so it is not divisible by 3. However, 65483 divided by 7 gives a remainder of 0, so it is divisible by 7.
To find the Highest Common Factor (HCF) of 1020 and 11594 using the division method, we first divide the larger number, 11594, by the smaller number, 1020. 11594 divided by 1020 gives a quotient of 11 with a remainder of 554. Next, we divide the divisor, 1020, by the remainder, 554. 1020 divided by 554 gives a quotient of 1 with a remainder of 466. Continuing this process, we divide 554 by 466, which gives a quotient of 1 with a remainder of 88. Finally, we divide 466 by 88, which gives a quotient of 5 with a remainder of 46. Since the remainder is not zero, we continue the process. Dividing 88 by 46 gives a quotient of 1 with a remainder of 42. Continuing, we divide 46 by 42, which gives a quotient of 1 with a remainder of 4. Finally, dividing 42 by 4 gives a quotient of 10 with a remainder of 2. Since the remainder is not zero, we continue. Dividing 4 by 2 gives a quotient of 2 with a remainder of 0. Therefore, the HCF of 1020 and 11594 is 2.
403÷8 gives 50 as quotient and 3 as remainder. Dividend- remainder=divisor ×quotient 403-3=8*50 which is 400. our value is 403 So increase divisor 8*51=408. 403+5 gives 408. So 5 must be added to 403 to get a no divisible by 8.
165
0.6667
221 is the smallest number which when divided by 24 36 and 54 gives a remainder of 5 each time
42
0.4444
124
The smallest number is 9361. 9361 = 40*234 + 1 9361 = 1872*5 + 1 9361 = 11*851
169 is the smallest such number.
0.6154
3, when divided by 2.
8
8.
12*1 + 3 = 15 12*2 + 3 = 27 12*4 + 3 = 51 when 51 divided by 15 gives the remainder as 6.