Atalk show host has just bought 10 new jokes. each night he tells some of the jokes. what is the largest number of nights on which you can tune in so that you never hear on one night at least all the jokes you heard on one of the other nights? (thus, for instance, it is acceptable that you hear jokes 1, 2, and 3 on one night, jokes 3 and 4 on another, and jokes 1, 2, and 4 on a third. it is not acceptable that you hear jokes 1 and 2 on one night and joke 2 on another night.)

Which statement is true 1.the pythagorean theorem can be used to find the missing side of any triangle 2.the pythagorean theorem can be used to find the missing side of any polygon 3. the pythagorean theorem can be used to find the missing side of any right triangle 4.the pythagorean theorem can be used to find the missing side of any isosceles triangle

Question 1(multiple choice worth 1 points)(07.06 mc)a group of students must collect at least $150 to organize a science fair. they have already collected $30. which graph best represents all remaining amounts of money, in dollars, that thestudents should still collect to organize the science fair? -210 -180 -150 - 120 -90-60 -300306090 120 150 180 210-210 -180 -150 - 120 -90 -60 -30 0 30 60 90 120 150 180 210-210 -180-150 - 120 -90-60-300 30 60 90 120 150 180 210-210 -180 -150 - 120.90 -60 -30 0 30 60 90 120 150 180 210

Restrictions on f(x) = 1/x+5 and g(x) = x-2