How many unique graphs are there on n = 4 vertices? draw all graphs that are not isomorphic to each other (hint: there are 11 such graphs); indicate how many graphs on n = 4 vertices are isomorphic to each one of these?

Given: hf || jk; hg ? jg prove: fhg ? kjg to prove that the triangles are congruent by asa, which statement and reason could be used as part of the proof? fgh ? kgj because vertical angles are congruent. jkg ? hfg because vertical angles are congruent. fhg ? jkg because right angles are congruent. hfg ? kjg because alternate interior angles are congruent.

David estimated he had about 20 fish in his pond. a year later, there were about 1.5 times as many fish. the year after that, the number of fish increased by a factor of 1.5 again. the number of fish is modeled by f(x)=20(1.5)^x. create a question you could ask that could be answered only by graphing or using a logarithm.

You are standing next to a really big circular lake. you want to measure the diameter of the lake, but you don't want to have to swim across with a measuring tape! you decide to walk around the perimeter of the lake and measure its circumference, and find that it's 400\pi\text{ m}400? m. what is the diameter dd of the lake?