1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Mandarinka [93]
3 years ago
15

Y + x = 11 solve for y

Mathematics
1 answer:
Alecsey [184]3 years ago
4 0

<em>Y can equal 5 or 6 and many different numbers.</em>

<em>Same with x.</em>

  • <em>6+x=11</em>
  • <em>5+x=11</em>

<em>Lets fill in x and y in both.</em>

  • <em>6+5=11</em>
  • <em>5+6=11.</em>
You might be interested in
Which is the better deal per car? 12 car washes for $100 or 5 car washes for $45
il63 [147K]

Answer:

12 Car washes for $100

Step-by-step explanation:

mark brainliest please.

5 0
3 years ago
Read 2 more answers
Pls pls pls help me
Sonja [21]

Answer:

It's B. Good luck! :)

4 0
3 years ago
ILL GIVE YOU BRAINLIEST!! Solve `x^{2}-5x+6=0`
kramer

Answer:

Factoring

Step-by-step explanation:

x^2-5x+6=0

x^2-2x-3x+6=0

x(x-2)-3(x-2)

(x-3)(x-2)=0

x=2 and x=3

5 0
2 years ago
Read 2 more answers
ben needs to convert 500 US dollars to the japanese yen. one american dollar is worth 123.3 yen. how many yen will he have
laiz [17]

Answer:

<u>The correct answer is 61,650 Yens</u>

Step-by-step explanation:

US$ in cash that Ben has = 500

Exchange rate (US$/Yen) = 1 : 123.3

For calculating the total amount in Yens that Ben has, we use this formula:

Yens in Cash = US$ in Cash * Exchange rate given

Yens in Cash = 500 * 123.3

Yens in Cash = 61,650

<u>After converting the US$ 500 Ben has, he will receive Yens 61,650</u>

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\\\\\\&#10;(2)\qquad\sum\limits_{k=1}^nk=1+2+3+\ldots+n=\dfrac{n(n+1)}{2}\quad\text{(arithmetic  series)}\\\\\\&#10;(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)}\\\\\\&#10;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|=&#10;\left|\sum\limits_{k=1}^\frac{n}{2}(2k)^2-\sum\limits_{k=1}^\frac{n}{2}(2k-1)^2\right|=\\\\\\=&#10;\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)}{=}\\\\\\=&#10;\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|=\\\\\\&#10;

=\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)}{=}&#10;\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}\\\\\\&#10;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\\\\\\&#10;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|=&#10;\left|\sum\limits_{k=1}^{\frac{n+1}{2}-1}(2k)^2-\sum\limits_{k=1}^{\frac{n+1}{2}}(2k-1)^2\right|=\\\\\\=&#10;\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|=\\\\\\=&#10;\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|=\\\\\\=&#10;\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)}{=}\\\\\\&#10;\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|=\\\\\\=&#10;\left|-n^2-2n-1+(n+1)\left(\dfrac{n+1}{2}+1\right)-\dfrac{n+1}{2}\right|=\\\\\\=&#10;\left|-n^2-2n-1+\dfrac{(n+1)^2}{2}+n+1-\dfrac{n+1}{2}\right|=\\\\\\=&#10;\left|-n^2-n+\dfrac{n^2+2n+1}{2}-\dfrac{n+1}{2}\right|=\\\\\\=&#10;\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
Other questions:
  • What transformation has changed the parent function f(x) = log2 x to its new appearance shown in the graph below?
    14·1 answer
  • Write a sentence for this equation 30- X = 4
    12·1 answer
  • 7 minus the quotient of 3 and p
    9·1 answer
  • 15 people prefer Hot Cheetos and 10 prefer cool Ranch Doritos. for each set of data, write a statement of comparison using ratio
    8·1 answer
  • 1. The point (3, -5) is reflected over the x-axis. What are the<br> coordinates of the new point?
    7·1 answer
  • PLS HELP ME ASAP FOR 11 AND 13!! (MUST SHOW WORK!!) + LOTS OF POINTS!! *brainliest*
    14·1 answer
  • A pyramid with a square base of length 3 cm and height 16 cm
    10·1 answer
  • How do you change 1/16 into a decimal?
    14·2 answers
  • Algebra 2/Trig: im literally crying
    14·1 answer
  • Find the surface area of a basketball with a diameter of 10 in.
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!