For questions about the writing of proofs. But instead of focusing the mathematics behind the proof, these questions ask about the details and implementation of the proof.

learn more… | top users | synonyms

22
votes
1answer
2k views

How would one be able to prove mathematically that $1+1 = 2$?

Is it possible to prove that $1+1 = 2$? Or rather, how would one prove this algebraically or mathematically?
17
votes
7answers
4k views

how to be good at proving?

I'm starting my Discrete Math class, and I was taught proving techniques such as proof by contradiction, contrapositive proof, proof by construction, direct proof, equivalence proof etc. I know how ...
8
votes
2answers
2k views

Prove that $\mathcal{P}(A)⊆ \mathcal{P}(B)$ if and only if $A⊆B$. [duplicate]

Here is my proof, I would appreciate it if someone could critique it for me: To prove this statement true, we must proof that the two conditional statements ("If $\mathcal{P}(A)⊆ \mathcal{P}(B)$, ...
168
votes
14answers
7k views

Can every proof by contradiction also be shown without contradiction?

Are there some proofs that can only be shown by contradiction or can everything that can be shown by contradiction also be shown without contradiction? What are the advantage/disadvantages of proving ...
8
votes
2answers
191 views

How to show that: $\gcd\left( {a^n-b^n \over a-b} ,a-b\right)=\gcd(n d^{n-1},a-b )$

How to show that: $$ \gcd\bigg( {a^n-b^n \over a-b} ,a-b\bigg )=\gcd(n d^{n-1},a-b ) $$ $a,b\in \mathbb Z$ where $d=\gcd(a,b)$? $\gcd$ is the greatest common divisor.
3
votes
2answers
1k views

Proof the inequality $n! \geq 2^n$ by induction

I'm having difficulity solving an exercise in my course. The question is: Prove that $n!\geq 2^n$. We have to do this with induction. I started like this: The lowest natural number where the ...
62
votes
4answers
7k views

Can an irrational number raised to an irrational power be rational?

Can an irrational number raised to an irrational power be rational? If it can be rational, how can one prove it?
11
votes
8answers
891 views

Book about technical and academic writing

I'm in the process of writing my Master's Thesis on automata theory. The writing must be in English which isn't my mother tongue. So the question is, given that this is my first time long (hundred ...
51
votes
3answers
11k views

Proof by contradiction vs Prove the contrapositive

What is the difference between a "proof by contradiction" and "proving the contrapositive"? Intuitive, it feels like doing the exact same thing. And when I compare an exercise, one person proves by ...
3
votes
3answers
487 views

How to prove that $z\cdot\text{gcd}(a,b)=\text{gcd}(za,zb)$

I need to prove that $z \cdot \text{gcd}(a,b)=\text{gcd}(za,zb)$. I tried a lot, for example, looking at set of common divisors of the two sides, but I can't conclude anything from that. Can you ...
5
votes
4answers
707 views

Sum of cubes proof [duplicate]

Prove that for any natural number n the following equality holds: $$ (1+2+ \ldots + n)^2 = 1^3 + 2^3 + \ldots + n^3 $$ I think it has something to do with induction?
5
votes
3answers
330 views

How to prove or statements

How do I prove statements of the following types: $A \text{ or } B \implies$ C $A \implies B \text{ or } C$ I don't know how to go about proving statements like this when they have "or". Can ...
3
votes
4answers
2k views

Proving the sum of the first $n$ natural numbers by induction [duplicate]

I am currently studying proving by induction but I am faced with a problem. I need to solve by induction the following question. $$1+2+3+\ldots+n=\frac{1}{2}n(n+1)$$ for all $n > 1$. Any ...
2
votes
5answers
3k views

Proof by induction that $ \sum_{i=1}^n 3i-2 = \frac{n(3n-1)}{2} $

I'm starting to understand how induction works (with the whole $k \to k+1$ thing), but I'm not exactly sure how summations play a role. I'm a bit confused by this question specifically: $$ ...
1
vote
2answers
387 views

simple binomial theorem proof

I am trying to prove this binomial statement: For $a \in \mathbb{C}$ and $k \in \mathbb{N_0}$, $\sum_{j=0}^{k} {a+j \choose j} = {a+k+1 \choose k}.$ I am stuck where and how to start. My steps ...
18
votes
4answers
726 views

Advice for writing good mathematics?

It's been a (far-fetched, possibly) goal of mine to some day write a math Textbook. I've been thinking about writing this question for a while, but reading an exceedingly mediocre text on Mathematical ...
2
votes
3answers
626 views

Maps - question about $f(A \cup B)=f(A) \cup f(B)$ and $ f(A \cap B)=f(A) \cap f(B)$

I am struggling to prove this map statement on sets. The statement is: Let $f:X \rightarrow Y$ be a map. i) $\forall_{A,B \subset X}: f(A \cup B)=f(A) \cup f(B)$ ii) $\forall_{A,B \subset X}: ...
4
votes
5answers
353 views

H0w t0 prove that periodic decimal numbers are rational? $a_1…a_k(b_1b_2..b_l)={m \over n}$

Given $a_1...a_k(b_1b_2..b_l)={m \over n}$ how can I prove that periodic decimal numbers are rational? Where do I even begin?
3
votes
2answers
498 views

Infinum & Supremum: An Analysis on Relatedness

$\require{color}$ Question: I need some help in proving that $\color{green}{\text{if $k\geq 0$, then $\sup (kS) = k\sup(S)$ and $\inf (kS) = k\inf (S)$}}$, and also that $\color{red}{\text{if ...
72
votes
14answers
4k views

Formal proof for $(-1) \times (-1) = 1$

Is there a formal proof for $(-1) \times (-1) = 1$? It's a fundamental formula not only in arithmetic but also in the whole of math. Is there a proof for it or is it just assumed?
14
votes
3answers
271 views

Showing that $1^k+2^k + \dots + n^k$ is divisible by $n(n+1)\over 2$

For any odd positive integer $k\geq1$, the sum $1^k+2^k + \dots + n^k$ is divisible by $n(n+1)\over 2$. I used induction principle for the solution but cannot prove it. I took $P(k) = ...
11
votes
2answers
10k views

Prove: If a sequence converges, then every subsequence converges to the same limit.

I need some help understanding this proof: Prove: If a sequence converges, then every subsequence converges to the same limit. Proof: Let $s_{n_k}$ denote a subsequence of $s_n$. Note that $n_k ...
7
votes
1answer
3k views

Inductive Proof for Vandermonde's Identity?

I am reading up on Vandermonde's Identity, and so far I have found proofs for the identity using combinatorics, sets, and other methods. However, I am trying to find a proof that utilizes mathematical ...
6
votes
4answers
11k views

Prove that $1^3 + 2^3 + … + n^3 = (1+ 2 + … + n)^2$ [duplicate]

This is what I've been able to do: Base case: $n = 1$ $L.H.S: 1^3 = 1$ $R.H.S: (1)^2 = 1$ Therefore it's true for $n = 1$. I.H.: Assume that, for some $k \in \Bbb N$, $1^3 + 2^3 + ... + k^3 = (1 ...
5
votes
5answers
764 views

Prove that $(a-b) \mid (a^n-b^n)$

I'm trying to prove by induction that for all $a,b \in \mathbb{Z}$ and $n \in \mathbb{N}$, that $(a-b) \mid (a^n-b^n)$. The base case was trivial, so I started by assuming that $(a-b) \mid (a^n-b^n)$. ...
7
votes
4answers
2k views

$f\geq 0$, continuous and $\int_a^b f=0$ implies $f=0$ everywhere on $[a,b]$

This is problem 6.2 from the 3rd edition of Principles of Mathematical Analysis. Problem 6.2: Suppose $f\geq 0$, f is continuous on $[a, b]$, and $\int_{a}^{b}f(x)dx = 0$. Prove that $f(x)=0$ for ...
4
votes
5answers
239 views

$A \oplus B = A \oplus C$ imply $B = C$?

I don't quite yet understand how $\oplus$ (xor) works yet. I know that fundamentally in terms of truth tables it means only 1 value(p or q) can be true, but not both. But when it comes to solving ...
2
votes
1answer
1k views

Prove the integral of $f$ is positive if $f ≥ 0$, $f$ continuous at $x_0$ and $f(x_0)>0$

Prove that $\int_a^b f(x)\,dx \gt 0$ if $f \geq 0$ for all $x \in [a,b]$ and $f$ is continuous at $x_0 \in [a,b]$ and $f(x_0) \gt 0$ EDIT. Please ignore below. It is very confusing actually -.- ...
107
votes
9answers
5k views

Why do people use “it is easy to prove”?

Math is not generally what I am doing, but I have to read some literature and articles in dynamic systems and complexity theory. What I noticed is that authors tend to use (quite frequently) the ...
21
votes
10answers
3k views

Proving $\sqrt 3$ is irrational.

There is a very simple proof by means of divisibility that $\sqrt 2$ is irrational. I have to prove that $\sqrt 3$ is irrational too, as a homework. I have done it as follows, ad absurdum: Suppose ...
4
votes
2answers
321 views

Completeness proof of $\ell^p$

Say $\{x_n\}$ is Cauchy in $\ell^p$ and $x$ is its pointwise limit. To argue that $x \in \ell^p$ would the following be correct: Let $\varepsilon > 0$ and let $N$ be s.t. $n,m > N$ ...
8
votes
3answers
3k views

Prove that if $2^n - 1$ is prime, then $n$ is prime for $n$ being a natural number

Prove that if $2^n - 1$ is prime, then $n$ is prime for $n$ being a natural number I've looked at http://math.stackexchange.com/a/19998 It is known that $2^n-1$ can only be prime if $n$ is ...
4
votes
3answers
447 views

Proof by induction or contradiction that $(4k + 3) ^2 - (4k + 3)$ is not divisible by $4$?

I have to prove that $(4k + 3) ^2 - (4k + 3)$ is not divisible by $4$. What would be the best approach for this, proof by induction or contradiction? I've tried both and haven't got very far. Any ...
4
votes
1answer
156 views

Integral calculus proof

If $f(x)$ is continuous in $[a,b]$, prove that $ \displaystyle \lim_{n \to \infty} \dfrac{b-a}{n} \displaystyle \sum^n _{k=1} f\left( a + \dfrac{k(b-a)}{n} \right) = \displaystyle \int_a ^ b f(x)dx$ ...
4
votes
5answers
411 views

Showing $a^2 < b^2$, if $0 < a < b$

Lately, I've been stumbling with proofs of inequalities. For example: Given $0 < a < b$ Show $a^2 < b^2$ The only thing I've been able to come up with so far: $a^2 < b^2$ ...
2
votes
2answers
329 views

how to prove $f^{-1}(B_1 \cap B_2) = f^{-1}(B_1) \cap f^{-1}(B_2)$

I am given this equation: $f^{-1}(B_1 \cap B_2) = f^{-1}(B_1) \cap f^{-1}(B_2)$ I want to prove it: what i did is I take any $a \in f^{-1}(B_1 \cap B_2)$, then there is $b \in (B_1 \cap B_2)$ so ...
1
vote
4answers
179 views

Proving the inequality $|a-b| \leq |a-c| + |c-b|$ for real $a,b,c$

Let $a,b,c$ real numbers. Prove the inequality $|a-b| \leq |a-c| + |c-b|$. Prove that equality holds if and only if $a \leq c \leq b$ or $b \leq c \leq a$. I've tried starting with just $a \leq ...
1
vote
3answers
1k views

Sum of $k {n \choose k}$ is $n2^{n-1}$

Proof that $\suṃ̣_{k=1}^{n}k {n \choose k}$ for $n \in \mathbb N$ is equal to $n2^{n-1}$. As a hint I got that $k {n \choose k} = n {n-1\choose k-1} $. I tried solving this by induction but, in the ...
1
vote
2answers
2k views

Proof of Bezout's Lemma using Euclid's Algorithm backwards

I've seen it said that you can prove Bezout's Identity using Euclid's algorithm backwards, but I've searched google and cannot find such a proof anywhere. I found another proof which looks simple but ...
71
votes
14answers
8k views

Why are mathematical proofs that rely on computers controversial?

There are many theorems in mathematics that have been proved with the assistance of computers, take the famous four color theorem for example. Such proofs are often controversial among some ...
14
votes
3answers
526 views

Prove that $\int_0^\pi\frac{\cos x \cos 4x}{(2-\cos x)^2}dx=\frac{\pi}{9} (2160 - 1247\sqrt{3})$

Prove that $$\int_0^\pi\frac{\cos x \cos 4x}{(2-\cos x)^2}dx=\frac{\pi}{9} (2160 - 1247\sqrt{3})$$ I tried to use Weierstrass substitution but the term $\cos 4x$ made horrible algebraic-forms since ...
10
votes
3answers
803 views

Intuition of Addition Formula for Sine and Cosine

The proof of two angles for sine function is derived using $$\sin(A+B)=\sin A\cos B+\sin B\cos A$$ and $$\cos(A+B)=\cos A\cos B-\sin A\sin B$$ for cosine function. I know how to derive both of the ...
16
votes
3answers
749 views

prove $\sqrt{a_n b_n}$ and $\frac{1}{2}(a_n+b_n)$ have same limit

i am given this problem: let $a\ge0$,$b\ge0$, and the sequences $a_n$ and $b_n$ are defined in this way: $a_0:=a$, $b_0:=b$ and $a_{n+1}:= \sqrt{a_nb_n}$ and $b_{n+1}:=\frac{1}{2}(a_n+b_n)$ for all ...
8
votes
3answers
441 views

Proof of Wolstenholme's theorem.?

According to the theorem : $$1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+...+\frac{1}{p-1} =\frac{r}{q}$$ And we have to prove that $r= 0 \pmod{p^2}$. (Given $ p>3$, ...
4
votes
1answer
20k views

Proof for triangle inequality for vectors

Generally,the length of the sum of two vectors is not equal to the sum of their lengths. To see this consider the vectors $u$ and $v$ as shown below. By considering $u$ and $v$ as two sides of a ...
8
votes
2answers
2k views

Proof: How many digits does a number have? $\lfloor \log_{10} n \rfloor +1$

I read recently that you can find the number of digits in a number through the formula $\lfloor \log_{10} n \rfloor +1$ What's the logic behind this rather what's the proof?
5
votes
4answers
668 views

Prove that $\cot^2{(\pi/7)} + \cot^2{(2\pi/7)} + \cot^2{(3\pi/7)} = 5$

Prove that $\cot^2{(\pi/7)} + \cot^2{(2\pi/7)} + \cot^2{(3\pi/7)} = 5$ . I am sure this is derived from using roots of unity and Euler's complex number function, but I am very uncomfortable in these ...
3
votes
2answers
77 views

Prove that a function is both differentiable and continous at a point $x_0$

Suppose $f$ is differentialble on $(a,b)$, except possibly at $x_0 \in (a,b)$ an is continous on $[a,b]$; assume $ \lim\limits_{x\rightarrow x_0}f´(x)$ exists. Prove that $f$ is differentiable at ...
3
votes
3answers
308 views

Another way to go about proving Binet's Formula

As I showed in another question of mine, it is easy to prove that $$\tag{1}\phi^{n+1} =F_{n+1} \phi+F_{n }$$ given $F_1=1$ , $F_2=1$ , $F_{n+1}=F_n+F_{n-1}\text{ ; }n\geq2$. Now, extending $(1)$ ...
3
votes
6answers
319 views

Would like a proofreading of my proof

Prove that if $n\in\mathbb Z$, then $n^2$ is of the form $3q$ or $3q+1$ for some $q\in\mathbb Z$ I would like to show that 3q+2 is = 3q+1 thus $n^2$ can be of the form of 3q or 3q+1. Case one ...