Answer:
-j, 0, j-k
Step-by-step explanation:
j is a positive number, so -j will be less than 0.
j is a number greater than k, so j - k will be greater than 0.
From least to greatest, the order is ...
-j, 0, j-k
Answer:
60
Step-by-step explanation:
since its a square, and has four sides then you would divide total length by four to find the length of each side
Answer:
the least integer for n is 2
Step-by-step explanation:
We are given;
f(x) = ln(1+x)
centered at x=0
Pn(0.2)
Error < 0.01
We will use the format;
[[Max(f^(n+1) (c))]/(n + 1)!] × 0.2^(n+1) < 0.01
So;
f(x) = ln(1+x)
First derivative: f'(x) = 1/(x + 1) < 0! = 1
2nd derivative: f"(x) = -1/(x + 1)² < 1! = 1
3rd derivative: f"'(x) = 2/(x + 1)³ < 2! = 2
4th derivative: f""(x) = -6/(x + 1)⁴ < 3! = 6
This follows that;
Max|f^(n+1) (c)| < n!
Thus, error is;
(n!/(n + 1)!) × 0.2^(n + 1) < 0.01
This gives;
(1/(n + 1)) × 0.2^(n + 1) < 0.01
Let's try n = 1
(1/(1 + 1)) × 0.2^(1 + 1) = 0.02
This is greater than 0.01 and so it will not work.
Let's try n = 2
(1/(2 + 1)) × 0.2^(2 + 1) = 0.00267
This is less than 0.01.
So,the least integer for n is 2
The opposite of 12 is -12 . To add negative<span> numbers to </span>positive<span> numbers count backwards, as if you were subtracting. We have the problem: 1+ (-12). This can be read as “one </span>plus negative<span> twelve.” This can also be read as 12-1 which is 11 so the answer is 11.</span>
We know that
<span>When two chords intersect each other inside a circle, the products of their segments are equal (</span>Intersecting Chord Theorem)<span>
</span>so
in this problem
AE*EB=DE*EF----> EB=DE*EF/AE
AE=4 in
DE=12 in
EF=8 in
EB=?
EB=DE*EF/AE-----> EB=12*8/4----> EB=24 in
the answer is
EB=24 in
