2-2 practice solving two step equations
1 answer:
You might be interested in
Answer:
2730
Step-by-step explanation:
We want to determine the greatest common divisor of the elements of the set
We apply the Fermat's little theorem which states that if p is a prime number, then for any integer a, the number aᵖ − a is an integer multiple of p.
Now, if p-1 divides 12.
Since the of 12 are 1,2,3,4, 6, 12, the corresponding primes are 2, 3, 5, 7, 13.
Therefore, the gcd of the elements in and
2*3*5*7*13=2730
Therefore, the gcd of the elements in set S is 2730.
<u>Given</u><u> </u><u>:</u><u>-</u>
- The roots of the function are 5 and -3 .
<u>To</u><u> </u><u>Find</u><u> </u><u>:</u><u>-</u>
- The Quadratic function .
<u>Answer</u><u> </u><u>:</u><u>-</u>
The roots of the function are 5 and -3 . In general we can write the Quadratic function with roots π and ∆ as ,
f(x) = ( x - π )(x-∆)
So on using this we have ,
f(x) = ( x -5)( x -(-3))
f(x) = (x-5)(x+3)
f(x) = x(x-5)+3(x-5)
f(x) = x² -5x +3x -15
f(x) = x² -2x -15
<u>Hence </u><u>the</u><u> required</u><u> </u><u>answer</u><u> </u><u>is </u><u>x²</u><u> </u><u>-2x </u><u>-</u><u>1</u><u>5</u><u>.</u>