4
votes
$\begingroup$

Could someone please expand on how to get from $\;\displaystyle\left( n^2-\frac{n^2}{2}\right)\;$ to $\;\left(\dfrac{n^2}{2}\right)\;?\;$

I can't seem to wrap my head around that.

$\endgroup$

locked by Alexander Gruber Aug 21 '14 at 17:37

This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here. This question and its answers are frozen and cannot be changed. More info: help center.

Read more about locked posts here.

  • 15
    $\begingroup$ If you have one bread and you take away half of it, then you remain with...? $\endgroup$ – azimut May 2 '13 at 23:02
  • 27
    $\begingroup$ This probably needs more than five answers. One more effort! $\endgroup$ – Julien May 2 '13 at 23:20
  • 11
    $\begingroup$ @azimut I find your comment confusing, given that most breads are not square. $\endgroup$ – Julien May 2 '13 at 23:33
  • 6
    $\begingroup$ I don't believe the result unless I see it proven via $\mathbb{N}$-induction using $\text{Nats}$ within Homotopy Type Theory. $\endgroup$ – Nikolaj-K May 3 '13 at 7:49
  • 8
    $\begingroup$ By golly! That looks exactly like the Grothendieck-Riemann-Roch Theorem!!! $\endgroup$ – Alexei Averchenko May 3 '13 at 13:02

15 Answers 15

20
votes
$\begingroup$

$$n^2 = \dfrac{2n^2}{2}$$ $$\dfrac{2 n^2}{2} - \dfrac{n^2}{2} = \dfrac{2n^2 - n^2}{2}= \dfrac{n^2}{2}$$


In short, for any $X$: $\;(X = x; X = n^2; \text{ or}\;X = n^{917})\;\text{etc.}:\;$ $${\bf two}\text{ halves of X}\;- \;{\bf one} \text{ half of X}\; = \;{\bf one} \text{ half of X}$$

$\endgroup$
25
votes
$\begingroup$

This reduces to proving that $1-\frac 12 = \frac 12$. In order to do this, expand $1$ into the geometric series $$1=\sum_{i=1}^{\infty}\frac 1{2^i},$$ and divide both sides by $2$ to get $$\frac 12=\sum_{i=1}^{\infty}\frac 1{2^{i+1}}=\sum_{i=2}^{\infty}\frac 1{2^i}.$$ It follows that $$1-\frac 12 = \sum_{i=1}^{\infty}\frac 1{2^i}-\frac 1{2^1}=\sum_{i=2}^{\infty}\frac 1{2^{i}}=\frac 12.$$

$\endgroup$
  • 5
    $\begingroup$ Sorry but this is also an attention-seeking answer. $\endgroup$ – Julien May 3 '13 at 12:34
  • 1
    $\begingroup$ @julien: Exactly, my comment on the other answer was sarcasm. ;) $\endgroup$ – Karl Kronenfeld May 3 '13 at 12:36
  • $\begingroup$ Ha, ha! I was not totally sure. $\endgroup$ – Julien May 3 '13 at 12:37
24
votes
$\begingroup$

$$\begin{array}{cccccccc}\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\ \end{array}\hspace{15pt}-\hspace{15pt}\begin{array}{cccc}\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}&\color{blue}{\star}\\\end{array}\hspace{15pt}=\hspace{15pt}\begin{array}{cccc}\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\color{red}{\star}&\color{red}{\star}&\color{red}{\star}&\color{red}{\star}\\\end{array}$$

$$ $$

$\endgroup$
  • 45
    $\begingroup$ This only proves the special case $n=8$. How might we proceed for other $n$? $\endgroup$ – Karl Kronenfeld May 3 '13 at 4:00
  • 13
    $\begingroup$ The generalization to even $n$ is somewhat straightforward, but to odd $n$ is nontrivial. :-) $\endgroup$ – ShreevatsaR May 3 '13 at 5:00
  • 10
    $\begingroup$ These are the results of the 2000 US presidential election. Off-topic. $\endgroup$ – Julien May 4 '13 at 3:31
16
votes
$\begingroup$

Did you know that $$x-\frac{x}{2}=\frac{x}{2}$$ whatever $x$ you take?

$\endgroup$
8
votes
$\begingroup$

We proceed by induction on $n$. The base case for $n = 0$ is $0^2 - \frac{0^2}{2} = 0 =\frac{0^2}{2}$, which follows from the fact that $0$ is the additive identity in $\mathbb{Q}$. Suppose the claim holds for some $n = k$. Now \begin{aligned} (k+1)^2 - \frac{(k+1)^2}{2} &= k^2 + 2k + 1 - \frac{k^2}{2} - \frac{2k}{2} - \frac{1}{2} \\ &= \color{blue}{\left ( k^2 - \frac{k^2}{2} \right )} + k + \frac{1}{2} \\ &= \color{blue}{\frac{k^2}{2}} + k + \frac{1}{2} \quad \color{blue}{\text{(hypothesis)}} \\ &= \frac{k^2 + 2k + 1}{2} \\ &= \frac{(k+1)^2}{2}. \end{aligned} This concludes the inductive step, so our claim holds for all $n \in \mathbb{N}$.

$\endgroup$
7
votes
$\begingroup$

Maybe an ancient greek-style of answer can be fun to read.

Let $A$ be the square with lenght of side $n$. Thererefore the area of $A$ is $n \cdot n = n^2$. Now draw one of the two diagonals. Note that the sum of the areas of the two right triangles you create (call it $B,C$) is equal to the area of $A$, and they have the same area, because they have two equal legs and the right angle between. Consider, for example $B$: the area of it is $\frac{n \cdot n}{2}$. So if you take from $A$ of area $n^2$, $B$ of area $\frac{n^2}{2}$ there is still the other, $C$ of area $\frac{n^2}{2}$.

$\endgroup$
6
votes
$\begingroup$

$$x-\frac x2=\frac x2$$ Take from something its half and you're left with half of it

$\endgroup$
3
votes
$\begingroup$

That equation is saying $$n - \text{ half of } n =\text{ half of } n$$

If you substitute n for integers it's quite easy to see why it works.

$$1 - 1/2 = 1/2$$ $$2 - 2/2 = 2/2$$

$\endgroup$
  • 10
    $\begingroup$ This would be a better answer if you used some variable other than $n$. $\endgroup$ – Micah May 2 '13 at 23:49
3
votes
$\begingroup$

Since $\left(1-\dfrac{1}{2}\right)=\dfrac{1}{2}$, then $x\cdot\dfrac{1}{2}=\left(x-\dfrac{x}{2}\right)=\dfrac{x}{2}$.

$\endgroup$
  • 3
    $\begingroup$ I can't say this is very enlightening. Could I also conclude that "If $(1 - \frac{1}{2}) = \frac{1}{2}$ then $(1 - \frac{1}{x}) = \frac{1}{x}$."? $\endgroup$ – TMM May 2 '13 at 23:18
  • 4
    $\begingroup$ @TMM Do you know distributive laws? $\endgroup$ – Gaston Burrull May 2 '13 at 23:20
  • 1
    $\begingroup$ @GastónBurrull I changed a word from your answer. I hope you don't mind. Maybe an intermediate step might be useful, to show the application of the distributive law. $\endgroup$ – Pedro Tamaroff May 2 '13 at 23:26
  • 2
    $\begingroup$ If you added the step $x\left(1-\frac{1}{2}\right)$, this would be the most understandable proof of this fact. From my perspective at least. $\endgroup$ – Julien May 3 '13 at 3:46
  • $\begingroup$ @Gaston: Of course I know what you mean. But if the user who asked the question does not know why $x - x/2 = x/2$, he also may now know what you did to go from $1 - \frac{1}{2} = \frac{1}{2}$ to $x - \frac{x}{2} = \frac{x}{2}$. $\endgroup$ – TMM May 3 '13 at 9:11
3
votes
$\begingroup$

Simple arithmetic: \begin{equation} n^2 - \dfrac{n^2}{2} = n^2(1 - \dfrac{1}{2}) = n^2(\dfrac{1}{2}) = \dfrac{1}{2}n^2 = \dfrac{n^2}{2} \end{equation}

$\endgroup$
2
votes
$\begingroup$

Subtracting half of something yields half of that thing.

$\endgroup$
2
votes
$\begingroup$

Let $n= \sin x$, so that $n^2 = \sin^{2} x = 1- \cos^{2} x$. Thus $$ n^{2}- \frac{n^{2}}{2} = 1-\cos^{2} x - \frac{1-\cos^{2}x}{2}. $$

Multiplying both sides by $2$ yields

$$ 2n^{2} - n^{2} = 2-2\cos^{2} x - (1-\cos^{2}x) = 2-2\cos^{2} x - 1 +\cos^{2}x = 1 - \cos^{2} x = \sin^{2} x = n^{2}. $$

Now dividing both sides by $2$ gives

$$ n^{2} - \frac{n^{2}}{2} = \frac{n^{2}}{2}. $$

$\endgroup$
  • 3
    $\begingroup$ $n=\sin x$ has not sense if $n>1$. $\endgroup$ – Gaston Burrull May 3 '13 at 0:02
  • 2
    $\begingroup$ Do you know that $|\sin x|\leq 1$ ? $\endgroup$ – Gaston Burrull May 3 '13 at 0:07
  • 11
    $\begingroup$ @GastónBurrull I know that the government wants you to think that. $\endgroup$ – Quinn Culver May 3 '13 at 0:07
  • 6
    $\begingroup$ @GastónBurrull It's only a joke answer. $\endgroup$ – Alex Provost May 3 '13 at 0:43
  • 3
    $\begingroup$ @GastónBurrull How is using $-2\cos^2x+\cos^2x=-\cos^2x$ more circular than using $x-x/2=x/2$ or $2n^2-n^2=n^2$? The only important thing here is $1-1/2=1/2$. Every approach uses an equivalent form of that. $\endgroup$ – Julien May 3 '13 at 3:38
2
votes
$\begingroup$

We want to prove that $n^2 - \frac{n^2}{2} = \frac{n^2}{2}$. In order to better understand what we want to do, let us simplify this equation a little bit by adding $\frac{n^2}{2}$ to both sides. We get $n^2 = \frac{n^2}{2} + \frac{n^2}{2}$. So in order to solve the problem, we just need to show that $\frac{n^2}{2} + \frac{n^2}{2} = n^2$. In order to show that these two things are equal, let's start with the left hand side and show that it equal to the right hand side. Since we know how to add fractions with the same denominator, we get $$\frac{n^2}{2} + \frac{n^2}{2} = \frac{2n^2}{2} = \frac{2}{2}n^2= n^2$$ Now we're done!

$\endgroup$
1
vote
$\begingroup$

We know that $n^2=n^2$.

Hence $n^2=\frac{2n^2}{2}$ $$\implies n^2=\frac{n^2}{2}+\frac{n^2}2$$ $$ \implies n^2- \frac{n^2}2=\frac{n^2}2$$ as we wanted.

$\endgroup$
  • 6
    $\begingroup$ All you've shown is that if $n^{2} - \frac{n^{2}}{2} = \frac{n^{2}}{2}$ holds, then something 'obviously true' holds. $\endgroup$ – Quinn Culver May 2 '13 at 23:59
  • 2
    $\begingroup$ yeah you're right edit will be made $\endgroup$ – John Marty May 3 '13 at 0:04
-1
votes
$\begingroup$

Actually, if you consider an integer division (so called Euclidian division) the proposition becomes: $$ n^2 - \frac{n^2}{2} = \frac{n^2}{2} + \text{mod}{(n^2,2)} $$

Indeed, by definition of the Euclidian division of the integer $n^2$ by the integer $2$, one has: $$ n^2 = 2\times\frac{n^2}{2} + \text{mod}{(n^2,2)} $$ where $\text{mod}{(a,b)}$ denotes the remainder of the euclidian division of an integer $a$ by an integer $b$.

Now, by (cleverly enough) remarking that the term $2\times \frac{n^2}{2}$ equals to $\frac{n^2}{2} + \frac{n^2}{2}$ one can write: $$ \begin{aligned} n^2 &= 2\times\frac{n^2}{2} + \text{mod}{(n^2,2)} \\ n^2 &= \frac{n^2}{2} + \frac{n^2}{2} + \text{mod}{(n^2,2)} \\ \Leftrightarrow n^2 - \frac{n^2}{2}&= \frac{n^2}{2} + \text{mod}{(n^2,2)} \\ \end{aligned} $$ that ends the proof ;)

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.