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
wolverine [178]
3 years ago
12

Maghan works at an ice cream truck and makes $8.25 per hour.lucas works for a ladscape and makes $6.50 per hour.how much more do

es meghan make each hour?
Mathematics
1 answer:
natita [175]3 years ago
7 0

Meghan makes 1.75$ more per hour compared to Lucas. As 8.25 $ - 6.50 $ = 1.75 $.

You might be interested in
The area of a triangle with base 10in and height 4 in is<br> 20in^2<br> 40in^2<br> 15in^2<br> 60in^2
natta225 [31]

1/2(BH)

=1/2(10*4)

=1/2(40)

=20


5 0
3 years ago
help please, I have to do it before my class starts its at 10:25 and its 6:21 rn so :) I'm trying to get it done tyyyy
Radda [10]
Ii is the top left and iv is bottom right
7 0
2 years ago
Read 2 more answers
Janna is measuring the dimensions of her bedroom to determine how much paint she should buy for the walls. If her measuring tape
Otrada [13]

3.8907. y0.01 length wanna

7 0
2 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
SOLVE THE EQUATION!!!!!!!!
ololo11 [35]
C: 2,6 and d: 0,26 i hope it helped :)
8 0
2 years ago
Read 2 more answers
Other questions:
  • Need help with this geometry
    7·1 answer
  • (Had to re-upload - Chose the wrong picture and couldn't edit.
    7·1 answer
  • So, I need someone to help show me the steps for solving the equation after equal sign. It is supposed to = 729, and I am pretty
    8·1 answer
  • Find the value of the expression 2x3 + 3y2 − 17 when x = 3 and y = 4. A)26 B)85 C)943 D)1,927
    15·1 answer
  • Help me some one plz (only part b)
    10·1 answer
  • -3/5=d- 5/6 is??<br><br>what is the answer?? plz help
    15·2 answers
  • Given the directrix of y = 4 and focus of (0, 2), which is the equation of the parabola?
    9·1 answer
  • Is the equation x^3 - 2x^2 + 1 = 0 a quadratic equation?​
    6·1 answer
  • The picture is above I’ll mark as brainliest.
    6·2 answers
  • Factor 3y2 + 21y - 24
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!