1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
rodikova [14]
3 years ago
6

A group of friends spent 52.50$ on 6 movie tickets. Write an equation to represent the cost, c, per movie ticket, t.

Mathematics
1 answer:
Dovator [93]3 years ago
5 0

Answer: 8.75t = c

Step-by-step explanation: 52.5/6 = 8.75 so 8.75$ per ticket.

You might be interested in
Four football fans took turns driving the distance from new York to Oklahoma to see a big game
Snezhnost [94]
I'm sorry but what's the full question?
4 0
4 years ago
Find the area of the triangle.<br> 3 cm<br> 11 cm<br> C с<br> 14.5 cm
boyakko [2]

Answer: The answer is 43.5 because when using the formula you get this result.

Step-by-step explanation: Area of triangle is base x height divided by 2. So do our base 14.5 and our height 6 and multiply them together. 14.5 x 6 = 87 / 2 = 43.5

6 0
3 years ago
SOLVE THIS QUESTION<br><br>​
Serga [27]

Answer:

Step-by-step explanation:

dfs

3 0
3 years ago
What are one of the four regions into which a coordinate plane is separated is called
Alexandra [31]

Well, I suppose you could break up the coordinate plane
in millions of different ways.

If you take each region to be all the space that is not crossed
by an axis, then you have the four Quadrants.

6 0
3 years ago
A) Find a recurrence relation for the number of bit strings of length n that contain a pair of consecutive 0s.
Fed [463]

Answer:

A) a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

B) a_{0} = a_{1} = 0

C)   for n = 2

  a_{2} = 1

for n = 3

 a_{3} = 3

for n = 4

a_{4} = 8

for n = 5

a_{5} = 19

Step-by-step explanation:

A) A recurrence relation for the number of bit strings of length n that contain a  pair of consecutive Os can be represented below

if a string (n ) ends with 00 for n-2 positions there are a pair of  consecutive Os therefore there will be : 2^{n-2} strings

therefore for n ≥ 2

The recurrence relation for the number of bit strings of length 'n' that contains consecutive Os

a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

b ) The initial conditions

The initial conditions are : a_{0} = a_{1} = 0

C) The number of bit strings of length seven containing two consecutive 0s

here we apply the re occurrence relation and the initial conditions

a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

for n = 2

  a_{2} = 1

for n = 3

 a_{3} = 3

for n = 4

a_{4} = 8

for n = 5

a_{5} = 19

7 0
3 years ago
Other questions:
  • PLEASE HELP DRAG THE CHOICES INTO THE BOXES TO COMPLETE THE TABLE
    12·1 answer
  • Pleas help I’m in a hurry
    11·1 answer
  • Help me im stuck on this. Please give an explanation.
    8·1 answer
  • 1410 + 0515 =<br><br> military time <br><br> Good Luck!<br><br> Thank you so much
    14·1 answer
  • Please help.<br> Algebra.
    5·2 answers
  • Which of the following values of n will result in a true statement when
    10·2 answers
  • A video game randomly chooses your car color and type. The probability of
    7·1 answer
  • A retail store served 923 customers in October, and there were 45 complaints during that mo
    11·1 answer
  • What is the sum? A, B, C, D
    9·1 answer
  • Lines L and M are parallel
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!