Answer:
6 pieces of candy
Step-by-step explanation:
Since an equal number of pieces of candy were given to children on Halloween, and obviously, a different amount of boys and girls were present on Halloween. Since 30 pieces of candy were given out to boys and 48 were given out to girls, a certain amount of candy was given to some amount of boys to equal 30, and that same amount of candy was given to another amount of girls to equal 48. Since we are looking for the greatest number of pieces given to each child, we are looking for the greatest common divisor of 30 and 48, which is 6.
The answer is the last one !
Answer: 6x^3 is the greatest common factor of 12x^7 and 18x^3.
Step-by-step explanation:
Naturally, any integer

larger than 127 will return

, and of course

, so we restrict the possible solutions to

.
Now,

is the same as saying there exists some integer

such that

We have

which means that any

that satisfies the modular equivalence must be a divisor of 120, of which there are 16:

.
In the cases where the modulus is smaller than the remainder 7, we can see that the equivalence still holds. For instance,

(If we're allowing

, then I see no reason we shouldn't also allow 2, 3, 4, 5, 6.)