Proof of induction that a polygon win n sides will have n vertices where n is a natural number with n>2 plss help

The polygon tool to draw a rectangle with a length of 5 units and a height of 3 units. one of the sides of the rectangle falls on line ab , and the rectangle has a vertex of a. each segment on the grid represents 1 unit.

The variable z is directly proportional to x, and inversely proportional to y. when x is 4 and y is 13, z has the value 1.2307692307692. what is the value of z when x= 9, and y= 20

Ben wants to play a carnival game that costs $2. in his pocket he has 5 red tickets worth 35 cents each, and 15 blue tickets worth 10 cents each. which of the following systems of inequalities correctly represents the constraints on the variables in this problem? let represent the red tickets and b represent the blue tickets.