Answer:
10000 options
Step-by-step explanation:
There are 10 options of digit from 0 to 9. It means there are 10 options for the first slot, 10 for the 2nd slot, 10 for the 3rd slot, and 10 for the last slot of each of the 4 slots of the password. For all 4 passwords the total amount of choices would be
![10 * 10 * 10 * 10 = 10^4 = 10000 options ranging from 0000 to 9999](https://tex.z-dn.net/?f=%2010%20%2A%2010%20%2A%2010%20%2A%2010%20%3D%2010%5E4%20%3D%2010000%20options%20ranging%20from%200000%20to%209999)
Answer:
4 3/4
Step-by-step explanation:
Answer: Option D is correct. The function equation y= -16x^2 + 9x + 4
is non-linear.
Step-by-step explanation:
It is not linear because it is a quadratic function.
You can see this on the graph in the photo below:
, Hope this helps :)
Have a great day!!
.08x+.05(15000-x)=930
.08x+750-.05=930
.08x-.05x=930-750
.03x=180
X=180/.03=6,000 at 8%
(15000-6000)=9000 at 5%
Answer:
See explanation
Step-by-step explanation:
Let x be the number of simple arrangements and y be the number of grand arrangements.
1. The florist makes at least twice as many of the simple arrangements as the grand arrangements, so
![x\ge 2y](https://tex.z-dn.net/?f=x%5Cge%202y)
2. A florist can make a grand arrangement in 18 minutes
hour, then he can make y arrangements in
hours.
A florist can make a simple arrangement in 10 minutes
hour, so he can make x arrangements in
hours.
The florist can work only 40 hours per week, then
![\dfrac{3}{10}y+\dfrac{1}{6}x\le 40](https://tex.z-dn.net/?f=%5Cdfrac%7B3%7D%7B10%7Dy%2B%5Cdfrac%7B1%7D%7B6%7Dx%5Cle%2040)
3. The profit on the simple arrangement is $10, then the profit on x simple arrangements is $10x.
The profit on the grand arrangement is $25, then the profit on y grand arrangements is $25y.
Total profit: $(10x+25y)
Plot first two inequalities and find the point where the profit is maximum. This point is point of intersection of lines
and ![\dfrac{3}{10}y+\dfrac{1}{6}x=40](https://tex.z-dn.net/?f=%5Cdfrac%7B3%7D%7B10%7Dy%2B%5Cdfrac%7B1%7D%7B6%7Dx%3D40)
But this point has not integer coordinates. The nearest point with two integer coordinates is (126,63), then the maximum profit is
![\$(10\cdot 126+25\cdot 63)=\$2,835](https://tex.z-dn.net/?f=%5C%24%2810%5Ccdot%20126%2B25%5Ccdot%2063%29%3D%5C%242%2C835)