Donovan is going to add many numbers. each number will use only the digit 1. what is the greatest number of addends donovan can use without having to regroup?

1+1+1+1+1+1+1+1+1=9 . Adding 1 together 9 times gives you the highest possible sum without having to regroup.

Adding 1 together 10 times gives you a product of 10 which would make you have to regroup.

goodluck and count your change the next time you go buy something

answer: the answer is (b) amie should have multiplied

step-by-step explanation: given a sphere and a cylinder with same radius and height.

let, 'r' be the radius of the cylinder and sphere and 'h' be the height of the cylinder. according to the question,

r = h.

now, the volume of the sphere will be

and the volume of the cylinder will be

therefore, we have

thus, ammie should have multiplied the volume of the sphere