Factor the numerator and factor the denominator.

Then you divide the numerator and the denominator by the common factor to reduce the fraction.
Problem 7)
The answer is choice B. Only graph 2 contains an Euler circuit.
-----------------
To have a Euler circuit, each vertex must have an even number of paths connecting to it. This does not happen with graph 1 since vertex A and vertex D have an odd number of vertices (3 each). The odd vertex count makes it impossible to travel back to the starting point, while making sure to only use each edge one time only.
With graph 2, each vertex has exactly two edges attached to it. So an Euler circuit is possible here.
================================================
Problem 8)
The answer is choice B) 5
-----------------
Work Shown:
abc base 2 = (a*2^2 + b*2^1 + c*2^0) base 10
101 base 2 = (1*2^2 + 0*2^1 + 1*2^0) base 10
101 base 2 = (1*4 + 0*2 + 1*1) base 10
101 base 2 = (4 + 0 + 1) base 10
101 base 2 = 5 base 10
Answer:
6u77vhy46yvt g vgj v6. hy
Step-by-step explanation:
guv yg
Answer:
h= 12.98 metres
Explanation:
The tree is leaning over so, the triangle is no longer right-angled.
Answer:
272 c
Step-by-step explanation:
Roses by 4 every hour
10 to 1 can be represented in 24 hour time as 10 to 13
13 subtract 10 is 3
3 multiplied by 4 is 12
260 add 12 is 272 c