Oh, dude, so, like, when you divide 400 by 6, you get 66 with a remainder of 4. It's like when you're sharing a Pizza with your friends, and you're left with those last few slices that no one wants. So, yeah, the answer is 66 with a remainder of 4.
I added A & B to your question for clarity. If a number (A) is divided by number (B) with no remainder, then A isdivisible by B. Also, it can be stated that B is a factor of A.
2.5
9.1429
B/5 = 6 means that 6 x 5 = B 6 x 5 = 30 Therefore, B = 30
There is no such number. For suppose x was a number such that it keft the same remainder r, when divided by 99 and 204. Then x = 99a + r and x = 204b +r for some integers a and b. Consider y = x + 99*204 then y > x Now y = (99a + r) + 99*204 = 99*(a+204) + r so y leaves a remainder of r when divided by 99. Also y = (204b + r) + 99*204 = 204*(b+99) + r so y leaves a remainder of r when divided by 204. This contradicts the proposition that x is the maximum such number.
The remainder is 0.If A has a remainder of 1 when divided by 3, then A = 3m + 1 for some integer mIf B has a remainder of 2 when divided by 3, then B = 3n + 1 for some integer n→ A + B = (3m + 1) + (3n + 2)= 3m + 3n + 1 + 2= 3m + 3n + 3= 3(m + n + 1)= 3k where k = m + n + 1 and is an integer→ A + B = 3k + 0→ remainder when A + B divided by 3 is 0-------------------------------------------------------------------------From this, you may be able to see that:if A when divided by C has remainder Ra; andif B when divided by C has remainder Rb; then(A + B) divided by C will have remainder equal to the remainder of (Ra + Rb) divided by C
I added A & B to your question for clarity. If a number (A) is divided by number (B) with no remainder, then A isdivisible by B. Also, it can be stated that B is a factor of A.
11.625
6.9677
Suppose you want to find the gcf of 5040 and 1274. Make a list or a "ladder" starting with 5040 and 1274. Each item after that is the remainder of dividing the two numbers above. 5040 1274 1218 (5040 divided by 1274 leaves a remainder of 1218) 56 (1274 divided by 1218 leaves a remainder of 56) 42 (1218 divided by 56 leaves a remainder of 42) 14 (56 divided by 42 leaves a remainder of 14) 0 (42 divided by 14 leaves a remainder of 0). When you reach zero, the number before it (in this case 14) is the gcf. The gcf of 5040 and 1274 is 14. In general: Let a and b be the two numbers. repeat while (b >0) Let c = the remainder of a divided by b Let a=b Let b=c The gcf is a.
2.5
2.5
9.1429
B/5 = 6 means that 6 x 5 = B 6 x 5 = 30 Therefore, B = 30
5
2.5
2.5