![subject](/tpl/images/cats/mat.png)
Mathematics, 02.02.2021 02:10 live4dramaoy0yf9
Jeff, an electrician, had a job that lasted 4.5 hours, during which time he earns $35 per hour and charges a $26 service fee. The function J(t) represents the amount Jeff earns in t hours. Brendan also works as an electrician. The graph of B(t) shows the amount in dollars that Brendan earns as a function of time t in hours.
![ansver](/tpl/images/cats/User.png)
Answers: 2
![](/tpl/images/ask_question.png)
![](/tpl/images/ask_question_mob.png)
Another question on Mathematics
![question](/tpl/images/cats/mat.png)
Mathematics, 21.06.2019 14:30
Translate the following situation into an inequality statement . lily has $25 to spend on a charm bracelet for her sisters birthday gift the cost of the bracelet is $12 plus $1.50 per charm
Answers: 1
![question](/tpl/images/cats/mat.png)
Mathematics, 21.06.2019 18:00
Yesterday i ran 5 miles. today, i ran 3.7 miles. did my percent increase, decrease or is it a percent error? plz i need
Answers: 2
![question](/tpl/images/cats/mat.png)
Mathematics, 21.06.2019 21:00
Julie buys 2kg of apples and 7kg of pears ? 12.70. the pears cost ? 1.30 per kilogram what is the price per kilogram of the apples? show your working out
Answers: 2
![question](/tpl/images/cats/mat.png)
Mathematics, 21.06.2019 21:00
Asequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. if f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence? (1 point) f(1) = 2 and f(n) = f(n − 1) + 4; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1 f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1 f(1) = 4 and f(n) = f(n − 1) + 2; n > 1 i will award !
Answers: 1
You know the right answer?
Jeff, an electrician, had a job that lasted 4.5 hours, during which time he earns $35 per hour and c...
Questions
![question](/tpl/images/cats/mat.png)
Mathematics, 08.05.2021 02:00
![question](/tpl/images/cats/istoriya.png)
History, 08.05.2021 02:00
![question](/tpl/images/cats/pravo.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 08.05.2021 02:00
![question](/tpl/images/cats/himiya.png)
![question](/tpl/images/cats/biologiya.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 08.05.2021 02:00
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 08.05.2021 02:00
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/ekonomika.png)
![question](/tpl/images/cats/istoriya.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 08.05.2021 02:00
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 08.05.2021 02:00
![question](/tpl/images/cats/istoriya.png)
History, 08.05.2021 02:00