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?

the answer is d. (1.2, -4.7) on edgn

hope this !

logv3(x+2)=1

rewrite in exponential form:

logb(x) = y is equal to b^y =x

b = 3, y = 1

now solve for x:

3^1 = x+2)

x = 3-2

x = 1

see the picture for the graph.

answer: 75°

step-by-step explanation:

∠esk is the supplement of ∠edk, so is 100°. ∠esd = 1/2·arc ed, so is 25°.

since ∠esk = ∠esd + ∠dsk

you have 100° = 25° + ∠dsk . .

fill in known values 75° = ∠dsk . . . . .

subtract 25°

step-by-step explanation: