All categories

2 years ago

Which sequence of transformations will verify that EFGH and quadrilateral EFGH and quadrilateral E'F'G'H are congruent?

Mathematics

1 answer:

levacccp [35]2 years ago

5 0

D) EFGH moved onto E'F'G'H after rotating 180 counterclockwise around the origin and the reflecting across the y-axis.

<h3>How to carry out transformations?</h3>

From online resources gotten about this question, for quadrilateral EFGH and quadrilateral E'F'G'H to be congruent, what we must do first is to rotate 180° counterclockwise around the origin and then move EFGH onto E'F'G'H'.

The last step to get this proof of congruency is to reflect across the y-axis.

Read more about transformations at; brainly.com/question/4289712

#SPJ1

You might be interested in

How to solve this problem?<br> -3 d +7 > 25

sp2606 [1]

Answer to your question:

D = d < -6

8 0

3 years ago

Read 2 more answers

What is the equivalent fraction for 0.3333

lorasvet [3.4K]

0.3333 = 1/3

Answer would be: 1/3

6 0

3 years ago

Prove that

Pani-rosa [81]

Let's start from what we know.

$(1)\qquad\sum\limits_{k=1}^n1=\underbrace{1+1+\ldots+1}_{n}=n\cdot 1=n\\\\\\
(2)\qquad\sum\limits_{k=1}^nk=1+2+3+\ldots+n=\dfrac{n(n+1)}{2}\quad\text{(arithmetic series)}\\\\\\
(3)\qquad\sum\limits_{k=1}^nk\ \textgreater \ 0\quad\implies\quad\left|\sum\limits_{k=1}^nk\right|=\sum\limits_{k=1}^nk$

Note that:

$\sum\limits_{k=1}^n(-1)^k\cdot k^2=(-1)^1\cdot1^2+(-1)^2\cdot2^2+(-1)^3\cdot3^2+\dots+(-1)^n\cdot n^2=\\\\\\=-1^2+2^2-3^2+4^2-5^2+\dots\pm n^2$

(sign of last term will be + when n is even and - when n is odd).
Sum is finite so we can split it into two sums, first $S_n^+$ with only positive trems (squares of even numbers) and second $S_n^-$ with negative (squares of odd numbers). So:

$\sum\limits_{k=1}^n(-1)^k\cdot k^2=S_n^+-S_n^-$

And now the proof.

1) n is even.

In this case, both $S_n^+$ and $S_n^-$ have $\dfrac{n}{2}$ terms. For example if n=8 then:

$S_8^+=\underbrace{2^2+4^2+6^2+8^2}_{\frac{8}{2}=4}\qquad\text{(even numbers)}\\\\\\
S_8^-=\underbrace{1^2+3^2+5^2+7^2}_{\frac{8}{2}=4}\qquad\text{(odd numbers)}\\\\\\$

Generally, there will be:

$S_n^+=\sum\limits_{k=1}^\frac{n}{2}(2k)^2\\\\\\S_n^-=\sum\limits_{k=1}^\frac{n}{2}(2k-1)^2\\\\\\$

Now, calculate our sum:

$\left|\sum\limits_{k=1}^n(-1)^k\cdot k^2\right|=\left|S_n^+-S_n^-\right|=
\left|\sum\limits_{k=1}^\frac{n}{2}(2k)^2-\sum\limits_{k=1}^\frac{n}{2}(2k-1)^2\right|=\\\\\\=
\left|\sum\limits_{k=1}^\frac{n}{2}4k^2-\sum\limits_{k=1}^\frac{n}{2}\left(4k^2-4k+1\right)\right|=\\\\\\$

$=\left|4\sum\limits_{k=1}^\frac{n}{2}k^2-4\sum\limits_{k=1}^\frac{n}{2}k^2+4\sum\limits_{k=1}^\frac{n}{2}k-\sum\limits_{k=1}^\frac{n}{2}1\right|=\left|4\sum\limits_{k=1}^\frac{n}{2}k-\sum\limits_{k=1}^\frac{n}{2}1\right|\stackrel{(1),(2)}{=}\\\\\\=
\left|4\dfrac{\frac{n}{2}(\frac{n}{2}+1)}{2}-\dfrac{n}{2}\right|=\left|2\cdot\dfrac{n}{2}\left(\dfrac{n}{2}+1\right)-\dfrac{n}{2}\right|=\left|n\left(\dfrac{n}{2}+1\right)-\dfrac{n}{2}\right|=\\\\\\
$

$=\left|\dfrac{n^2}{2}+n-\dfrac{n}{2}\right|=\left|\dfrac{n^2}{2}+\dfrac{n}{2}\right|=\left|\dfrac{n^2+n}{2}\right|=\left|\dfrac{n(n+1)}{2}\right|\stackrel{(2)}{=}\\\\\\\stackrel{(2)}{=}
\left|\sum\limits_{k=1}^nk\right|\stackrel{(3)}{=}\sum\limits_{k=1}^nk$

So in this case we prove, that:

$\left|\sum\limits_{k=1}^n(-1)^k\cdot k^2\right|=\sum\limits_{k=1}^nk$

2) n is odd.

Here, $S_n^-$ has more terms than $S_n^+$ . For example if n=7 then:

$S_7^-=\underbrace{1^2+3^2+5^2+7^2}_{\frac{n+1}{2}=\frac{7+1}{2}=4}\\\\\\
S_7^+=\underbrace{2^2+4^4+6^2}_{\frac{n+1}{2}-1=\frac{7+1}{2}-1=3}\\\\\\$

So there is $\dfrac{n+1}{2}$ terms in $S_n^-$ , $\dfrac{n+1}{2}-1$ terms in $S_n^+$ and:

$S_n^+=\sum\limits_{k=1}^{\frac{n+1}{2}-1}(2k)^2\\\\\\
S_n^-=\sum\limits_{k=1}^{\frac{n+1}{2}}(2k-1)^2$

Now, we can calculate our sum:

$\left|\sum\limits_{k=1}^n(-1)^k\cdot k^2\right|=\left|S_n^+-S_n^-\right|=
\left|\sum\limits_{k=1}^{\frac{n+1}{2}-1}(2k)^2-\sum\limits_{k=1}^{\frac{n+1}{2}}(2k-1)^2\right|=\\\\\\=
\left|\sum\limits_{k=1}^{\frac{n+1}{2}-1}4k^2-\sum\limits_{k=1}^{\frac{n+1}{2}}\left(4k^2-4k+1\right)\right|=\\\\\\=
\left|\sum\limits_{k=1}^{\frac{n-1}{2}-1}4k^2-\sum\limits_{k=1}^{\frac{n+1}{2}}4k^2+\sum\limits_{k=1}^{\frac{n+1}{2}}4k-\sum\limits_{k=1}^{\frac{n+1}{2}}1\right|=\\\\\\$

$=\left|\sum\limits_{k=1}^{\frac{n-1}{2}-1}4k^2-\sum\limits_{k=1}^{\frac{n+1}{2}-1}4k^2-4\left(\dfrac{n+1}{2}\right)^2+\sum\limits_{k=1}^{\frac{n+1}{2}}4k-\sum\limits_{k=1}^{\frac{n+1}{2}}1\right|=\\\\\\=
\left|-4\left(\dfrac{n+1}{2}\right)^2+4\sum\limits_{k=1}^{\frac{n+1}{2}}k-\sum\limits_{k=1}^{\frac{n+1}{2}}1\right|\stackrel{(1),(2)}{=}\\\\\\
\stackrel{(1),(2)}{=}\left|-4\dfrac{n^2+2n+1}{4}+4\dfrac{\frac{n+1}{2}\left(\frac{n+1}{2}+1\right)}{2}-\dfrac{n+1}{2}\right|=\\\\\\$

$=\left|-n^2-2n-1+2\cdot\dfrac{n+1}{2}\left(\dfrac{n+1}{2}+1\right)-\dfrac{n+1}{2}\right|=\\\\\\=
\left|-n^2-2n-1+(n+1)\left(\dfrac{n+1}{2}+1\right)-\dfrac{n+1}{2}\right|=\\\\\\=
\left|-n^2-2n-1+\dfrac{(n+1)^2}{2}+n+1-\dfrac{n+1}{2}\right|=\\\\\\=
\left|-n^2-n+\dfrac{n^2+2n+1}{2}-\dfrac{n+1}{2}\right|=\\\\\\=
\left|-n^2-n+\dfrac{n^2}{2}+n+\dfrac{1}{2}-\dfrac{n}{2}-\dfrac{1}{2}\right|=\left|-\dfrac{n^2}{2}-\dfrac{n}{2}\right|=\left|-\dfrac{n^2+n}{2}\right|=\\\\\\$

$=\left|-\dfrac{n(n+1)}{2}\right|=|-1|\cdot\left|\dfrac{n(n+1)}{2}\right|=\left|\dfrac{n(n+1)}{2}\right|\stackrel{(2)}{=}\left|\sum\limits_{k=1}^nk\right|\stackrel{(3)}{=}\sum\limits_{k=1}^nk$

We consider all possible n so we prove that:

$\forall_{n\in\mathbb{N}}\quad\left|\sum\limits_{k=1}^n(-1)^k\cdot k^2\right|=\sum\limits_{k=1}^nk$

7 0

3 years ago

Find a. Round to the nearest tenth:

marusya05 [52]

Answer:

14.356

Step-by-step explanation:

that's the answer round up to 14.4

5 0

2 years ago

12/39 in simplest form is 4/13 what are two ways to get there

arlik [135]

Divide 3 on the numerator and denominator.

Hoped this helped.

~Bob Ross®

7 0

3 years ago

Read 2 more answers