There are 17 trees along the road from Basil's home to a swimming pool. On his way way to and from a swim Basil marks some trees with a red stripe. On his way to the pool he marks the first, the third, the fifth tree and so on. On his way back again, he marks the first tree he comes to, the fourth tree, the seventh tree and so on, missing out two trees each time. By the time he gets home how many trees have no mark?

Number of trees not marked is 6

Step-by-step explanation:

Base on the scenario been described in the question, we can find the solution in the file attached

answer with step-by-step explanation:

a. ∠j is supplementary to ∠k - true:

(opposite angles of a trapezoid are supplementary which means that they add up to 180 degrees)

b. kl is parallel to jm - true:

(opposite sides are parallel to each other in a trapezoid)

c. jk is perpendicular to kl - false:

(clearly, jk does not make a right angle with kl)

d. jk is parallel to lm - false:

(jk and lm are two lines opposite in direction to each other so they cannot be parallel)

e. ∠j is congruent to ∠m - true:

(the angles on each side of the base are congruent)

f. ∠j is congruent to ∠k - false:

(the angles on the same side but opposite side of the base are not congruent)