there is no remainder. the product is a whole number.
2006-06-11 17:32:29
·
answer #1
·
answered by jake41784 3
·
0⤊
0⤋
In an aptitude kind of way:
A number is evenly divisible by 33 if it is evenly divisible by all of the prime factors of 33. These are 3 and 11.
All of the numbers are 3 apart, so if any one is divisible by 3 they all are.
1050 is divisible by three because its digits add up to a multiple of 3: 1 + 0 + 5 + 0 = 6. Therefore, all are divisible by three. Let's divide it out and then see if anything is divisible by 11.
349 * 350 * 351 * 352
352 fits the mold: the tens digit = the hundreds digit + the ones digit.
Therefore, 1056 is divisible by both 11 and 3, and the remainder of the entire operation is zero.
You should learn how to identify if a number is divisible by the first few prime numbers (2, 3, 5, 7, 11, 13) for these kinds of questions.
2006-06-12 15:30:15
·
answer #2
·
answered by bequalming 5
·
0⤊
0⤋
1047*1050*1053*1056 = 1,222,442,020,800. That number divided by 33 = 37,043,697,600. This is an even division, so the remainder is zero.
2006-06-12 00:33:47
·
answer #3
·
answered by Mysti1000 1
·
0⤊
0⤋
1056 divided by 33 = 32, therefore the product is 33 x 32 x (other numbers).
That means that the remainder is zero.
2006-06-12 02:09:30
·
answer #4
·
answered by Polymath 5
·
0⤊
0⤋
You can use a calculator to figure this out. The * means to multiply. You divide the answer by 33 and whatever is left that is less than 33 in your answer is the remainder. Since it's an aptitude test, I shouldn't even be giving you this much help.
Good luck.
2006-06-12 00:37:05
·
answer #5
·
answered by quietwalker 5
·
0⤊
0⤋
0!
2006-06-12 04:37:37
·
answer #6
·
answered by Anonymous
·
0⤊
0⤋