An Euler path, in a graph or multi graph, is a walk through the graph which uses every edge exactly once. An Euler circuit is an Euler path which starts and stops at the same vertex. Our goal is to find a quick way to check whether a graph (or multi graph) has an Euler path or circuit.
hope it helps
Answer:
y = 0
Step-by-step explanation:
It is always a good idea to look at the question and make some observations about it. Here, you might observe ...
- all of the bases are powers of 3: 243 = 3^5; 9 = 3^2
- y is a factor of every exponent
The latter observation is important, because it means that when y=0, every exponential expression has a value of 1. Hence y = 0 is a solution.
__
To solve the equation, you can write it in terms of powers of 3.
(3^5)^(-y) = (3^-5)^(3y)·(3^2)^(-2y)
3^(-5y) = 3^(-15y)·3^(-4y)
3^(-5y) = 3^(-19y)
-5y = -19y . . . . . . . . equating exponents; equivalent to taking log base 3
14y = 0 . . . . . . . . . . add 19y
y = 0 . . . . . . . . . . . one solution
______
The rules of exponents we used are ...
(a^b)(a^c) = a^(b+c)
(a^b)^c = a^(bc)
1/a^b = a^-b
5 5/16 is greater.
You can find that out by dividing 5/16 and 7/24
So that gives .31 and .29
Thus, 5 5/16 are greater
Answer:
a diagram in which the numerical values of variables are represented by the height or length of lines or rectangles of equal width.
Step-by-step explanation:
