Answer:
1083 seats
Step-by-step explanation:
this is an arithmetic sequence :
an = an-1 + c
in our case
a1 = 10 (10 seats in the first row)
a2 = a1 + 1 = 10 + 1 = 11
a3 = a2 + 1 = a1 + 1 + 1 = 10 + 1 + 1 = 12
an = an-1 + 1 = a1 + (n-1)×1 = a1 + n - 1 = 10 + n - 1 = 9 + n
a38 = a1 + 37 = 10 + 37 = 47 seats.
altogether this means the sum of the arithmetic sequence of a1 to a38.
the general sum of an arithmetic sequence from a1 to an is
n×(a1 + an)/2
in our case
38×(10 + 47)/2 = 19×57 = 1083 seats
Answer:
n < 3
Step-by-step explanation:
6n + 9n < 50
15n < 50
n < 50/15
n < 3.33
Approximately
n < 3
The greatest Number of tickets penny can buy is children 3 tickets; adults 3 tickets making a total of 6 tickets
Answer:
-2
Step-by-step explanation:
4 + 3p < p + 1
3p - p < 1 - 4
2p < -3
p < -3/2 (or - 1 1/2)
so the largest integer that p can be is -2
Maybe the answer is b try it
