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
musickatia [10]
3 years ago
8

Consider the following functions

Mathematics
1 answer:
TiliK225 [7]3 years ago
5 0

Step-by-step explanation:

g(5)=3(5)-11

=15-11

=4

f(g(5))=2(4)²+4(4)+10

=2(16)+16+10

=32+26

=58

You might be interested in
Given the function f(x) = 1/2x-3 and the domain {-4, 4, 10} what is the range of the function?
AlexFokin [52]

<h3><em>This is the range of y , Ry=R−{0}</em></h3>
3 0
3 years ago
What do I do in the right side column
KIM [24]
The same thing to the other side
8 0
3 years ago
Read 2 more answers
Memory module consists of 9 chips. The device is designed with redundancy so that it works even if one of its chips is defective
soldier1979 [14.2K]

Answer:

a) P[C]=p^n

b) P[M]=p^{8n}(9-8p^n)

c) n=62

d) n=138

Step-by-step explanation:

Note: "Each chip contains n transistors"

a) A chip needs all n transistor working to function correctly. If p is the probability that a transistor is working ok, then:

P[C]=p^n

b) The memory module works with when even one of the chips is defective. It means it works either if 8 chips or 9 chips are ok. The probability of the chips failing is independent of each other.

We can calculate this as a binomial distribution problem, with n=9 and k≥8:

P[M]=P[C_9]+P[C_8]\\\\P[M]=\binom{9}{9}P[C]^9(1-P[C])^0+\binom{9}{8}P[C]^8(1-P[C])^1\\\\P[M]=P[C]^9+9P[C]^8(1-P[C])\\\\P[M]=p^{9n}+9p^{8n}(1-p^n)\\\\P[M]=p^{8n}(p^{n}+9(1-p^n))\\\\P[M]=p^{8n}(9-8p^n)

c)

P[M]=(0.999)^{8n}(9-8(0.999)^n)=0.9

This equation was solved graphically and the result is that the maximum number of chips to have a reliability of the memory module equal or bigger than 0.9 is 62 transistors per chip. See picture attached.

d) If the memoty module tolerates 2 defective chips:

P[M]=P[C_9]+P[C_8]+P[C_7]\\\\P[M]=\binom{9}{9}P[C]^9(1-P[C])^0+\binom{9}{8}P[C]^8(1-P[C])^1+\binom{9}{7}P[C]^7(1-P[C])^2\\\\P[M]=P[C]^9+9P[C]^8(1-P[C])+36P[C]^7(1-P[C])^2\\\\P[M]=p^{9n}+9p^{8n}(1-p^n)+36p^{7n}(1-p^n)^2

We again calculate numerically and graphically and determine that the maximum number of transistor per chip in this conditions is n=138. See graph attached.

6 0
3 years ago
For the graph y = 1 find the slope of a line that is perpendicular to it and the slope of a line parallel to it. Explain your an
MakcuM [25]
 y = 1 is a horizontal line which has a slope of 0.
A line perpendicular to it, a vertical line, has an undefined slope. A line parallel to it, also a horizontal line, has a slope of 0.

Learn this, it helps..
HOY -- horizontal line, 0 slope, represented by y = a number
VUX -- vertical line, undefined slope, represented by x = a number.
8 0
3 years ago
What if any are the solutions to the equation 3(0.5x-4)=3/2x-1.2
TEA [102]
-6 = 1.8 hope this helps
5 0
3 years ago
Other questions:
  • The longest side of an acute triangle measures 30 inches. The two remaining sides are congruent, but their length is unknown.
    13·1 answer
  • Hi I need help please, picture is below
    9·1 answer
  • 1. Tanner collected 360 cans and bottles while fundraising for his baseball team. This was 40% of what Reggie collected. How man
    13·1 answer
  • Consider the following cumulative relative frequency distribution.
    11·1 answer
  • Find the product. (3p–2)(2p^2–p+3)
    6·1 answer
  • A candle is in the shape of a cylinder with a diameter of 3.5 in and height of 8.5 in. The weight of the candle is 1400 grams.
    6·1 answer
  • Please help!!<br> (Question in the picture)
    13·1 answer
  • Find the 8th term for the sequence a(n)=6-1n
    6·1 answer
  • Help pls and quick thanks
    15·1 answer
  • 3. Avery's dog has a mass of 6 kilograms. What is the mass of the dog in
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!