All categories

3 years ago

312 Algebra 1 - 4th Nine Weeks

Mathematics

2 answers:

cestrela7 [59]3 years ago

6 0

Answer:

6x(x+3)(x-2)=6x^3+6x^2-36x

3(x-2)(x +9)=3x^2+21x-54

Step-by-step explanation:

Bogdan [553]3 years ago

5 0

Answer:

6x(x+3)(x-2)=6x^3+6x^2-36x

3(x-2)(x +9)=3x^2+21x-54

Step-by-step explanation:

You might be interested in

Before the distribution of certain statistical software, every fourth compact disk (CD) is tested for accuracy. The testing proc

lilavasa [31]

Answer:

a) For this case we have 4 programs so then if we define the event R that a CD is tested we have the following probability for each test:

$P(R) =\frac{1}{4} =0.25$

The failure probability for each program are given by:

$P(F_1) = 0.01 , P(F_2) = 0.03 , P(F_3) = 0.02 , P(F_4) = 0.01$

For this case we assume that each test is independet form the others.

We can calculate the probability that all 4 programs works properly like this:

$P(4 work) = (1-0.01)*(1-0.03)*(1-0.02)*(1-0.01)= 0.932$

So then the probability that any program fails would be given by:

$P(F) = 1- 0.932= 0.068$

And if we use the fact that we have 4 possible test the true probability of interest would be:

$P(R \cap F) = P(R)*P(F) = 0.25*0.068=0.017$

b) $p= P(F'_1) P(F'_4) *(1- P(F'_2)*P(F'_3))$

And replacing we got:

$p =(1-0.01)*(1-0.01) *[1- (1-0.03)(1-0.02)]= 0.99*0.99*[1- 0.97*0.98]= 0.0484$

c) From part a we now that the probability that any program fails would be given by:

$P(F) = 1- 0.932= 0.068$

So then if we have 100 CDs the expected number of rejected Cd's are:

$100*0.068= 6.8 \approx 7$

Step-by-step explanation:

Part a

For this case we have 4 programs so then if we define the event R that a CD is tested we have the following probability for each test:

$P(R) =\frac{1}{4} =0.25$

The failure probability for each program are given by:

$P(F_1) = 0.01 , P(F_2) = 0.03 , P(F_3) = 0.02 , P(F_4) = 0.01$

For this case we assume that each test is independet form the others.

We can calculate the probability that all 4 programs works properly like this:

$P(4 work) = (1-0.01)*(1-0.03)*(1-0.02)*(1-0.01)= 0.932$

So then the probability that any program fails would be given by:

$P(F) = 1- 0.932= 0.068$

And if we use the fact that we have 4 possible test the true probability of interest would be:

$P(R \cap F) = P(R)*P(F) = 0.25*0.068=0.017$

Part b

For this case we want the probability that it failed program 2 or 3

So then we can find this probability like this:

$p= P(F'_1) P(F'_4) *(1- P(F'_2)*P(F'_3))$

And replacing we got:

$p =(1-0.01)*(1-0.01) *[1- (1-0.03)(1-0.02)]= 0.99*0.99*[1- 0.97*0.98]= 0.0484$

Part c

From part a we now that the probability that any program fails would be given by:

$P(F) = 1- 0.932= 0.068$

So then if we have 100 CDs the expected number of rejected Cd's are:

$100*0.068= 6.8 \approx 7$

3 0

3 years ago

What should be statement 3? Need Quickly please!

Oksi-84 [34.3K]

Answer:

B) $∠1 ≅ ∠3$

Step-by-step explanation:

∠4 and ∠2 are vertical angles as well, but since they are already used, all that are left to use are ∠3 and ∠1, which are the other vertical angles.

I am joyous to assist you anytime.

3 0

4 years ago

A rabbit hopped 11 meters in 6 minutes. At that rate, how far did the rabbit hop in 8 minutes?

ad-work [718]

It hopped 14 meters in 8 minutes.

6 0

3 years ago

Read 2 more answers

Steve is buying a sandwich for lunch and some fresh fruit juice for his friends. The sandwich costs $3.92 and the fruit juice co

Svetradugi [14.3K]

Answer:

Step-by-step explanation

2+2-4

4 0

4 years ago

A contiguous subsequence of a list s is a subsequence made up of consecutive elements of s. for instance, if s is

Olenka [21]

<span>contiguous subsequence of a list S is a subsequence made up of consecutive elements of S. For instance, if S is 5; 15;-30; 10;-5; 40; 10; then 15;-30; 10 is a contiguous subsequence but 5; 15; 40 is not. Give a linear-time algorithm for the following task: Input: A list of numbers, a1; a2; : : : ; an. Output: The contiguous subsequence of maximum sum (a subsequence of length zero has sum zero). For the preceding example, the answer would be 10;-5; 40; 10, with a sum of 55. (Hint: For each j =1; 2; : : : ; ng, consider contiguous subsequences ending exactly at position j.) Here is my solution in Python 3. Notes: * If more than one subset equal the maximum value, only the first is returned. * The manner of inputting the list was not specified. The list is hardcoded. * The output was not formatted exactly to specifications. * The preceding points were not improved upon in order to keep the code simple. ______python 3 -- leading dots are spaces for indentation____ def maxSubSeq(seq): ....max_sum = 0 ....max_subseq = [] ....for start in range(len(seq)): ........for end in range(start+1, len(seq)+1): ............subseq = seq[start:end] ............total = sum(seq[start:end]) ............if total > max_sum: ................max_sum = total ................max_subseq = subseq ....return(max_subseq) seq=[5, 15, -30, 10, -5, 40, 10] print(maxSubSeq(seq)) _____Output:_____ [10, -5, 40, 10] _____</span>

7 0

3 years ago