How can you drop two eggs the fewest amount of times, without them breaking?

Possible

Step-by-step explanation:

This is done on any floor, the highest or the lowest. Simply drop the egg from one inch above your foot and it will not break. every answer above is wrong. The only way, having 2 eggs, is to starts from the 2º floor.

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.

m∠cdf = 43° , m∠gdf = 114°, m∠gde = 23°, m∠edh = 23° , m∠cdh = 157°

step-by-step explanation:

since, it is given that de bisects the angle gdh ⇒ de divides the angle gdh into two equal angles.

⇒ m∠gde = m∠edh

⇒ 8·x   - 1 = 6·x + 5

⇒ x = 3

so, m∠gde = 8·x - 1 = 23°

and m∠edh = 23°

now, it is given ∠cde is an straight angle so, m∠cde = 180°

⇒ m∠cdf + m∠fdg + m∠gde = 180°

⇒ 43° + m∠fdg + 23° = 180°

⇒ m∠fdg = 114°

again, m∠cde = m∠cdh + m∠edh = 180°

m∠cdh + 23° = 180°

⇒ m∠cdh = 157°