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
timama [110]
3 years ago
15

Please help me with this question

Mathematics
1 answer:
goblinko [34]3 years ago
6 0

Answer:

First question is 109

Second question is 45, but I guess it's a typo with 145.

You might be interested in
HELP WILL GIVE 50+ POINTS TO THE FIRST PERSON TO ANSWER PLZ HELP EXPLAIN IT ALL!!!!!!!!
Bogdan [553]
No picture of the question
3 0
3 years ago
In a manufacturing plant that produces new computers, a 0.15 probability exists that a computer will be defective. if five compu
Sindrei [870]

The probability that all of them will be defective is 0.0000759375

<em><u>Explanation</u></em>

The general <u>Binomial Probability</u> formula is....

P= ^nC_{r}*p^r*(1-p)^n^-^r, where p is the probability of success, n is the total number of trials and r is the desired numbers of trials.

Given, the probability that a computer will be defective is 0.15 , so p = 0.15

Five computers are manufactured and we need to find the probability that all of them will be defective. That means, n = 5 and r = 5

Now according to the above formula....

P= ^5C_{5}*(0.15)^5*(1-0.15)^5^-^5 \\ \\ P= 1*(0.15)^5* (0.85)^0\\ \\ P=(0.15)^5 =0.0000759375

So, the probability that all of them will be defective is 0.0000759375

7 0
3 years ago
Jeremy makes $4.70 every time he mows a lawn but it costs him $6.80 to refill his lawn mower with gas. If Jeremy mows 5 lawns us
MrRa [10]
ANSWER: he would make a profit of $3.1
4 0
3 years ago
Read 2 more answers
What is 2 1/4 + 3 2/4​
Daniel [21]

Answer:

5 7/12

Step-by-step explanation:

have a great day :)

7 0
3 years ago
Without using a division or multiplication operator and without using iteration , define a recursive method named product that a
Fantom [35]

I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression 
 f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k 
 If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is. 
 If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.   
 So here's the function   
 int product(int m, int k) 
 { 
  if (m == 0) return 0; 
  return product(m-1,k) + k;  
}
8 0
3 years ago
Other questions:
  • Complete the patterns 0.02 0.2 blank 20 blank blank
    14·2 answers
  • Two dice are tossed 432 times. How many times would you expect to get a sum of 4?
    15·2 answers
  • What is the answer to 6/4 fraction
    5·2 answers
  • Simplify the expression 2.75j + 2.25 - 1.5j + 3
    7·1 answer
  • Write the least common multiple of 120 and 80
    11·1 answer
  • Translate (11, 3) 8 units up and 14 units left<br> What’s the answer
    6·2 answers
  • HELPPP IM ALMOST DONE WITH THIS CLASS
    7·1 answer
  • Evaluate the expression when b=3 and c=-6<br><br> 4b-c
    12·1 answer
  • Mr. Grant made a bar graph with student scores on a test. He noted an overall distribution shape skewed to the right. Based on t
    13·1 answer
  • 4. The water level in a swimming pool increased by 25% to 7.5 feet. What was the original height of
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!