I need help help with this????
1 answer:
You might be interested in
Greetings.
The answer is x = -2.
Explanation:
By solving the Absolute-Value Equation. We give them 2 conditions.
<em>When x ≥ 0 and When x < 0</em>
<em>The different is that When x ≥ 0, |x-a| = x-a as defined.</em>
<em>And when x < 0. |x-a| = -x+a as defined.</em>
( 1 ) - When x ≥ 0 for |x-1| and |x+5|
When x ≥ 0, |x-1| = x-1 and |x+5| = x+5
Therefore, x-1 = x+5
Because the equation is false. Therefore, The condition (1) doesn't apply.
( 2 ) - When x ≥ 0 for |x-1| and x < 0 for |x+5|
This time, we try another condition.
When x ≥ 0, |x-1| = x-1 and When x < 0, |x+5| = -x-5.
And we get the answer, |x-1| = |x+5| when x = -2.
But we haven't tried the last condition.
( 3 ) And that is when x < 0 for both terms.
|x-1| = -x+1 (x < 0)
|x+5| = -x-5 (x < 0)
The equation is not true. Therefore, the answer is x = -2.
Complete question is;
Given n objects are arranged in a row. A subset of these objects is called unfriendly, if no two of its elements are consecutive. Show that the number of unfriendly subsets of a k-element set is ( n−k+1 )
( k )
Answer:
I've been able to prove that the number of unfriendly subsets of a k-element set is;
( n−k+1 )
( k )
Step-by-step explanation:
I've attached the proof that the number of unfriendly subsets of a k-element set is;
( n−k+1 )
( k )
