Peyton already has 15 dollars. Every hour (x) that she works at the corner store, she earns another 3 dollars (y). How many total dollars will Peyton have after 15 hours of work?

Answers

Answer 1
Answer:

Answer:

$60 dollars

Step-by-step explanation:

x axis is hours spent and y axis is $3 + dollars earned so 15*3 =45 +15 = 60

Answer 2
Answer: i believe the answer is $60

Related Questions

The number of minutes that Samantha waits to catch the bus is uniformly distributed between 0 and 15 minutes. What is the probability that Samantha has to wait less than 4.5 minutes to catch the bus? a. 10% b. 3% c. 20% d. 30%
The ordered pairs in the table below represent a linear function. x y 6 2 9 8 What is the slope of the function? One-fourth One-half 2 4
Consider the following functions. f(x) = x − 3, g(x) = x2 Find (f + g)(x). Find the domain of (f + g)(x). (Enter your answer using interval notation.) Find (f − g)(x). Find the domain of (f − g)(x). (Enter your answer using interval notation.) Find (fg)(x). Find the domain of (fg)(x). (Enter your answer using interval notation.) Find f g (x). Find the domain of f g (x). (Enter your answer using interval notation.)
George, a musician, works 35 hours in a week. If he earns $18.15 per hour, how much does he earn each week?
The distance d of a particle moving in a straight line is given by d(t) = 2t3 + 5t – 2, where t is given in seconds and d is measured in meters. Find an expression for the instantaneous velocity v(t) of the particle at any given point in time.

Suppose f(x,y)=xy, P=(−4,−4) and v=2i+3j. A. Find the gradient of f. ∇f= i+ j Note: Your answers should be expressions of x and y; e.g. "3x - 4y" B. Find the gradient of f at the point P. (∇f)(P)= i+ j Note: Your answers should be numbers C. Find the directional derivative of f at P in the direction of v. Duf= Note: Your answer should be a number D. Find the maximum rate of change of f at P. Note: Your answer should be a number E. Find the (unit) direction vector in which the maximum rate of change occurs at P. u= i+ j Note: Your answers should be numbers

Answers

Answers:

  • Gradient of f:    \nabla f =  y\hat{i} + x\hat{j}
  • Gradient of f at point p: \nabla f = -4\hat{i} -4\hat{j}
  • Directional derivative of f and P in direction of v: \nabla f(P)v = -20\n
  • The maximum rate of change of f at P:  | \nabla f(P)| =  4√(2)
  • The (unit) direction vector in which the maximum rate of change occurs at P is:  v =  -(1)/(√(2))\hat{i}-(1)/(√(2))\hat{j}

Step by step solutions:

Given that:

  • f(x,y) = xy
  • P = (-4,4)\n
  • v = 2i + 3j

A: Gradient of f

\nabla f = ((\partial f)/(\partial x), (\partial f)/(\partial y)) = (y,x) = y\hat{i} + x\hat{j}

B: Gradient of f at point P:

Just put the coordinates of p in above formula:

\nabla f = -4\hat{i} -4\hat{j}

C: The directional derivative of f and P in direction of v:

The directional derivative is found by dot product of \nabla f(P) \: \rm and \: \rm  v:

\nabla f(P)v = [-4,4][2,3]^T = -20\n

D: The maximum rate of change of f at P is calculated by evaluating the magnitude of gradient vector at P:

| \nabla f(P)| = √((-4)^2 + (-4)^2) = 4√(2)

E: The (unit) direction vector in which the maximum rate of change occurs at P is:

v = ((-4)/(4√(2)), (-4)/(4√(2))) = -(1)/(√(2))\hat{i}-(1)/(√(2))\hat{j}

That vector v is the needed unit vector in this case.

we divided by 4√(2) to make that vector as of unit length.

Learn more about vectors here:

brainly.com/question/12969462

Answer:

a) The gradient of a function is the vector of partial derivatives. Then

\nabla f=((\partial f)/(\partial x), (\partial f)/(\partial y))=(y,x)=y\hat{i} + x\hat{j}

b) It's enough evaluate P in the gradient.

\nabla f(P)=(-4,-4)=-4\hat{i} - 4 \hat{j}

c) The directional derivative of f at P in direction of V is the dot produtc of \nabla f(P) and v.

\nabla f(P) v=(-4,-4)\left[\begin{array}{ccc}2\n3\end{array}\right] =(-4)2+(-4)3=-20

d) The maximum rate of change of f at P is the magnitude of the gradient vector at P.

||\nabla f(P)||=√((-4)^2+(-4)^2)=√(32)=4√(2)

e) The maximum rate of change occurs in the direction of the gradient. Then

v=(1)/(4√(2))(-4,-4)=((-1)/(√(2)),(-1)/(√(2)))= (-1)/(√(2))\hat{i}-(1)/(√(2))\hat{j}

is the direction vector in which the maximum rate of change occurs at P.

Given: 44 - 2(3x + 4) = -18Prove: x = 9

Answers

Substitute 9 as x in the given function:
44-2(3(9)+4)=-18
Now check and see if the statement it true and simplify.
44-2(27+4)=-18
44-2(31)=-18
44-62=-18
-18=-18
You can see this is true !!
Show my work to answer this question .

you need to solve a system of equations. You decide to use the elimination method. Which of these is not allowed? 2x-3y=12 and -2x+y=8

Answers

Sorry this is so late.

The answer is "Add the left side of equation 2 to the left side of equation 1"

Answer:

bro!! I'm on the same question on ap3x!!

lol

Step-by-step explanation:

Each of these extreme value problems has a solution with both a maximum value and a minimum value. Use Lagrange multipliers to find the extreme values of the function subject to the given constraint. ln(x^2+1)

Answers

Answer:

The minimum value of the given function is f(0) = 0

Step-by-step explanation:

Explanation:-

Extreme value :-  f(a, b) is said to be an extreme value of given function 'f' , if it is a maximum or minimum value.

i) the necessary and sufficient condition for f(x)  to have a maximum or minimum at given point.

ii)  find first derivative f^(l) (x) and equating zero

iii) solve and find 'x' values

iv) Find second derivative f^(ll)(x) >0 then find the minimum value at x=a

v) Find second derivative f^(ll)(x) <0 then find the maximum value at x=a

Problem:-

Given function is f(x) = log ( x^2 +1)

step1:- find first derivative f^(l) (x) and equating zero

  f^(l)(x) = (1)/(x^2+1) (d)/(dx)(x^2+1)

f^(l)(x) = (1)/(x^2+1) (2x)  ……………(1)

f^(l)(x) = (1)/(x^2+1) (2x)=0

the point is x=0

step2:-

Again differentiating with respective to 'x', we get

f^(ll)(x)=(x^2+1(2)-2x(2x))/((x^2+1)^2)

on simplification , we get

f^(ll)(x) = (-2x^2+2)/((x^2+1)^2)

put x= 0 we get f^(ll)(0) = (2)/((1)^2)   > 0

f^(ll)(x) >0 then find the minimum value at x=0

Final answer:-

The minimum value of the given function is f(0) = 0

Apple introduced the first iPod in October 2001. Sales of the portable music player grew slowly in the early years but began to grow rapidly after 2005. But the iPod era is coming to a close. Smartphones with music and video Apple introduced the first iPod in October 2001. Sales of the portable music player grew slowly in the
END OF THE IPOD ERA
players are replacing the iPod, along with the category of device it helped to create. Sales of the iPod worldwide from 2007
through 2011 (in millions) were
approximately
N(0= -165t2 + 13.13t+ 39.9 (0 < t< 4)
in year t, where t= 0 corresponds to 2007. Show that the worldwide sales of the iPod peaked sometime in 2009. What was the approximate largest number of iPods sold worldwide from 2007 through 2011?

Answers

Answer:

a. t = 2.48 will be a period within 2009.

b. 56.16 million

Step-by-step explanation:

Here is the complete question

Apple introduced the first iPod in October 2001. Sales of the portable music player grew slowly in the early years but began to grow rapidly after 2005. But the iPod era is coming to a close. Smartphones with music and video

Apple introduced the first iPod in October 2001. Sales of the portable music player grew slowly in the

END OF THE IPOD ERA

players are replacing the iPod, along with the category of device it helped to create. Sales of the iPod worldwide from 2007

through 2011 (in millions) were

approximately

N(0= -2.65t2 + 13.13t+ 39.9 (0 < t< 4)

in year t, where t= 0 corresponds to 2007. Show that the worldwide sales of the iPod peaked sometime in 2009. What was the approximate largest number of iPods sold worldwide from 2007 through 2011?

a. Show that the worldwide sales of the iPod peaked sometime in 2009

N(t) = -2.65t² + 13.13t + 39.9

To find the maximum value of N(t), we find dN(t)/dt and equate it to zero

dN(t)/dt = d[-2.65t² + 13.13t + 39.9]/dt

dN(t)/dt = -5.3t + 13.13 = 0

-5.3t = - 13.13

t = -13.13/(-5.3)

t = 2.477

t ≅ 2.48

d²N(t)/dt² =d[-5.3t + 13.13]/dt = -5.3 < 0. So, t = 2.48 is a maximum point

Since t = 2 is 2009 and t = 3 is 2010, t = 2.48 will be a period within 2009.

b. What was the approximate largest number of iPods sold worldwide from 2007 through 2011?

The approximate largest number of ipods sold is when t = 2.48

N(2.48) = -2.65(2.48)² + 13.13(2.48) + 39.9

N(2.48) = -16.29856 + 32.5624 + 39.9

N(2.48) = 56.16384

N(2.48) ≅ 56.16 million

Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reachvertex 'H' starting from vertex 'A'>

Answers

Answer:

The algorithm is given below.

#include <iostream>

#include <vector>

#include <utility>

#include <algorithm>

using namespace std;

const int MAX = 1e4 + 5;

int id[MAX], nodes, edges;

pair <long long, pair<int, int> > p[MAX];

void initialize()

{

   for(int i = 0;i < MAX;++i)

       id[i] = i;

}

int root(int x)

{

   while(id[x] != x)

   {

       id[x] = id[id[x]];

       x = id[x];

   }

   return x;

}

void union1(int x, int y)

{

   int p = root(x);

   int q = root(y);

   id[p] = id[q];

}

long long kruskal(pair<long long, pair<int, int> > p[])

{

   int x, y;

   long long cost, minimumCost = 0;

   for(int i = 0;i < edges;++i)

   {

       // Selecting edges one by one in increasing order from the beginning

       x = p[i].second.first;

       y = p[i].second.second;

       cost = p[i].first;

       // Check if the selected edge is creating a cycle or not

       if(root(x) != root(y))

       {

           minimumCost += cost;

           union1(x, y);

       }    

   }

   return minimumCost;

}

int main()

{

   int x, y;

   long long weight, cost, minimumCost;

   initialize();

   cin >> nodes >> edges;

   for(int i = 0;i < edges;++i)

   {

       cin >> x >> y >> weight;

       p[i] = make_pair(weight, make_pair(x, y));

   }

   // Sort the edges in the ascending order

   sort(p, p + edges);

   minimumCost = kruskal(p);

   cout << minimumCost << endl;

   return 0;

}