9. prove by induction on vertices that any graph g which contains at least one vertex of degree less than a(g) (the maximal degree of all vertices in g) has chromatic number at most a(g)

Brian, chris, and damien took a math test that had 20 questions. the number of questions brian got right is 14 more than the number of questions chris got right. damien correctly answered 2 less than the number of questions chris answered correctly. if brian and damien have the same score, which statement is true?

Aefg - almn. find the ratio of aefg to almn. a)1: 4 b)1: 2 c)2.1 d)4: 1

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.