If you already have a proof for some result, but want to ask for a different proof (using different methods).

learn more… | top users | synonyms

0
votes
1answer
116 views

On a certain basis of an order of a quadratic number field

Let $K$ be an algebraic number field of degree $n$. An order of $K$ is a subring $R$ of $K$ such that $R$ is a free $\mathbb{Z}$-module of rank $n$. Let $\alpha_1, \cdots, \alpha_n$ be a basis of $R$ ...
7
votes
5answers
574 views

Proving $\sum_{k=1}^n k\cdot k! = (n+1)!-1$ without using mathematical Induction. [duplicate]

Possible Duplicate: Summation of a factorial This equation is given: $$ 1\cdot1! + 2\cdot2! + 3\cdot3! + \ldots + n\cdot n! = (n+1)! - 1 $$ I've solved it using mathematical induction but ...
-5
votes
1answer
127 views

Canonical basis of an ideal of a quadratic order

Let $K$ be a quadratic number field. Let $R$ be an order of $K$, $D$ its discriminant. I am interested in the ideal theory on $R$ because it is closely related to the theory of binary quadratic forms ...
17
votes
5answers
514 views

A limit problem $\lim\limits_{x \to 0}\frac{x\sin(\sin x) - \sin^{2}x}{x^{6}}$

This is a problem from "A Course of Pure Mathematics" by G H Hardy. Find the limit $$\lim_{x \to 0}\frac{x\sin(\sin x) - \sin^{2}x}{x^{6}}$$ I had solved it long back (solution presented in my blog ...
3
votes
3answers
766 views

$p=4n+3$ never has a Decomposition into $2$ Squares, right?

Primes of the form $p=4k+1\;$ have a unique decomposition as sum of squares $p=a^2+b^2$ with $0<a<b\;$, due to Thue's Lemma. Is it correct to say that, primes of the form $p=4n+3$, never have ...
6
votes
1answer
304 views

Proof that a certain entire function is a polynomial

Let $n\in\mathbf{N}$ be fixed, and $f$ entire and $|f^{-1}(\left\lbrace w\right\rbrace)|\leq n$ for every $w\in\mathbf{C}$. Then $f$ is a polynomial of degree at most $n$. I try to prove this ...
1
vote
1answer
219 views

Another point of view that $\mathbb{Z}/m\mathbb{Z} \times\mathbb{Z}/n\mathbb{Z}$ is cyclic.

I was thinking that the product of groups $\mathbb{Z}/2\mathbb{Z} \times\mathbb{Z}/2\mathbb{Z}$ is not cyclic, but $\mathbb{Z}/2\mathbb{Z} \times\mathbb{Z}/p\mathbb{Z}$ is cyclic if p is an odd prime. ...
-1
votes
1answer
81 views

Condition for $a, b + \omega$ to be the canonical basis of an ideal of a quadratic order

Let $K$ be a quadratic number field. Let $R$ be an order of $K$, $D$ its discriminant. By this question, $1, \omega = \frac{(D + \sqrt D)}{2}$ is a basis of $R$ as a $\mathbb{Z}$-module. Let $I$ be a ...
12
votes
1answer
1k views

Direct aproach to the Closed Graph Theorem

In the context of Banach spaces, the Closed Graph Theorem and the Open Mapping Theorem are equivalent. It seems that usually one proves the Open Mapping Theorem using the Baire Category Theorem, and ...
-2
votes
1answer
225 views

Criterion on whether a given ideal of a quadratic order is regular or not

Let $K$ be an algebraic number field of degree $n$. Let $\mathcal{O}_K$ be the ring of algebraic integers. Let $R$ be an order of $K$, i.e. a subring of $K$ which is a free $\mathbb{Z}$-module of rank ...
17
votes
4answers
1k views

Proofs that every natural number is a sum of four squares.

I am planning to write a little note detailing several proofs of Lagrange's theorem that every natural number can be written as the sum of four perfect squares. I know of three different proofs so ...
0
votes
3answers
1k views

for $1<p<2$, prove the p-series is convergent without concerned with integral and differential knowledge and geometry series

for $1<p<2$, prove the p-series: $\sum_{n=1}^{\infty}n^{-p}$ is convergent. please use Cauchy Rule (edit: that is, by showing directly that the sequence of partial sums is a Cauchy sequence) ...
5
votes
1answer
351 views

Excessive use of the Yoneda lemma

In a MathOverflow thread on "nuking mosquitos", Andrej Bauer offered the following proof: If two elements in a poset have the same lower bounds then they are equal by Yoneda lemma. I understand ...
1
vote
2answers
310 views

Using inequalities and limits

Is it possible to say: $$ If \ f(x) \ and \ g(x) \ both \ have \ limits \ as \ x\to p\ and \ f(x) \le g(x), \ then \lim_{x \to p} f(x)\le \lim_{x \to p} g(x). $$ My proof(Edit: Proof is wrong due to ...
10
votes
0answers
234 views

Pólya and Szegő, Part I, Ch. 4, 174.

The following is a problem proposed in Pólya and Szegő's book "Problems and Theorems in Analysis" Assume that $0<f(x)<x$ and $$f(x)=x-ax^k+bx^\ell+x^\ell \varepsilon(x),\,\;\;\;\lim_{x\to ...
32
votes
1answer
2k views

$n!$ is never a perfect square if $n\geq2$. Is there a proof of this that doesn't use Chebyshev's theorem?

If $n\geq2$, then $n!$ is not a perfect square. The proof of this follows easily from Chebyshev's theorem, which states that for any positive integer $n$ there exists a prime strictly between $n$ and ...
30
votes
3answers
590 views

Alternative proofs that $A_5$ is simple

What different ways are there to prove that the group $A_5$ is simple? I've collected these so far: By directly working with the cycles: page 483 of ...
10
votes
4answers
303 views

How to prove $f\equiv 0$ without Weierstrass theorem?

Let $\,f:[0,1] \to \mathbb{R}$ continuous. Show that: If $$\int_0 ^1 x^k f(x)\, dx=0,$$ for all $k\in\mathbb N$, then $f\equiv 0$. I know we can use Weierstrass theorem but I'd like to ...
9
votes
3answers
388 views

Can $\displaystyle\lim_{h\to 0}\frac{b^h - 1}{h}$ be solved without circular reasoning?

In many places I have read that $$\lim_{h\to 0}\frac{b^h - 1}{h}$$ is by definition $\ln(b)$. Does that mean that this is unsolvable without using that fact or a related/derived one? I can of course ...
5
votes
3answers
560 views

Is this proof that $\sqrt 2$ is irrational correct?

Suppose $\sqrt 2$ were rational. Then we would have integers $a$ and $b$ with $\sqrt 2 = \frac ab$ and $a$ and $b$ relatively prime. Since $\gcd(a,b)=1$, we have $\gcd(a^2, b^2)=1$, and the fraction ...
4
votes
2answers
167 views

If $n$ is squarefree, $k\ge 2$, then $\exists f\in\Bbb Z[x_1,\dots,x_k] : f(\overline x)\equiv 0\pmod n\iff \overline x\equiv \overline 0\pmod n$

Starting from this question, we set $n=k=2$ and use the function $f\in\Bbb Z[x,y]$ where $f(x,y)=x\cdot y+x+y$, then the proofs applied to that question satisfy this case. Note that for $k=1$ the ...
3
votes
5answers
181 views

$\sum_{k=1}^nH_k = (n+1)H_n-n$. Why?

This is motivated by my answer to this question. The Wikipedia entry on harmonic numbers gives the following identity: $$ \sum_{k=1}^nH_k=(n+1)H_n-n $$ Why is this? Note that I don't just ...
2
votes
1answer
153 views

Equivalences to “D-finite = finite”

By a D-finite set, we mean a set admitting no injection from the natural numbers (or equivalently, a set not in bijection with any proper subset). I have encountered a proof that the following are ...
12
votes
3answers
1k views

Show that the product of two consecutive natural numbers is never a square.

I'd like to have my proof verified and if possible, to see other solutions that are interesting. Proof: Suppose $n(n+1)$ is a square. Then we write $$n(n+1) = \prod_{p} p^{c(p)}$$ where $c(p) = a(p) ...
4
votes
0answers
296 views

Equivalence of Brouwers fixed point theorem and Sperner's lemma

I'm looking for a proof that Brouwer's fixed point theorem implies Sperner's lemma. All proof I've found just prove that there must be at least one completely colored n-simplex, not that there must be ...
2
votes
0answers
86 views

Choices of epsilons in proof : $(b_n) \to b$ implies $\left\{\frac{1}{b_n}\right\} \to \frac{1}{b}$ (Abbott pp 47 T2.3.3.iv) [closed]

Original became long, ergo I ask anew. The trick is to look far enough out into the sequence $(b_n)$ so that the terms are closer to b than they are to 0. Consider the particular value $e_0 = |b|/2$. ...
2
votes
1answer
109 views

Factor ring by a regular ideal of a one-dimensional Noetherian domain

Let $A$ be a one-dimensional Noetherian domain. Let $K$ be its field of fractions. Let $B$ be the integral closure of $A$ in $K$. Suppose $B$ is a finitely generated $A$-module. It is well-known that ...
1
vote
4answers
2k views

Prove that a continuous function on a closed interval attains a maximum

As the title indicates, I'd like to prove the following: If $f:\mathbb R\to\mathbb R$ is a continuous function on $[a,b]$, then $f$ attains its maximum. Now, I do have a working proof: $[a,b]$ ...
1
vote
3answers
319 views

Proof of the duality of the dominance order on partitions

Could anyone provide me with a nice proof that the dominance order $\leq$ on partitions of an integer $n$ satisfies the following: if $\lambda, \tau$ are 2 partitions of $n$, then $\lambda \leq \tau ...
0
votes
1answer
101 views

Decomposition of a primitive ideal of a quadratic order

Let $K$ be a quadratic number field. Let $\mathcal{O}_K$ be the ring of algebraic integers in $K$. Let $R$ be an order of $K$, $D$ its discriminant. I am interested in the ideal theory on $R$ because ...
0
votes
1answer
323 views

Norm of the product of two regular ideals of an order of an algebraic number field

Let $K$ be an algebraic number field of degree $n$. Let $\mathcal{O}_K$ be the ring of algebraic integers. An order of $K$ is a subring $R$ of $K$ such that $R$ is a free $\mathbb{Z}$-module of rank ...
0
votes
0answers
89 views

Proving that morphism of sheaves is iso iff induced morphism on stalks is iso

Is the following proof sound/does anyone have another more elegant (categorical) proof? The direction $\Rightarrow$ is obvious the "family of stalks"-functor is a functor and functors take isos to ...
-1
votes
1answer
163 views

On the norm formula $N(IJ) = N(I)N(J)$ in an order of an algebraic number field

Let $K$ be an algebraic number field of degree $n$. Let $\mathcal{O}_K$ be the ring of algebraic integers of $K$. Let $R$ be an order of $K$, i.e. a subring of $K$ which is a free $\mathbb{Z}$-module ...
-2
votes
1answer
161 views

Decomposition of a primitive regular ideal of a quadratic order

Let $K$ be a quadratic number field. Let $\mathcal{O}_K$ be the ring of algebraic integers in $K$. Let $R$ be an order of $K$, $D$ its discriminant. I am interested in the ideal theory on $R$ because ...
51
votes
9answers
3k views

Surprisingly elementary and direct proofs

What are some examples of theorems, whose first proof was quite hard and sophisticated, perhaps using some other deep theorems of some theory, before years later surprisingly a quite elementary, ...
17
votes
8answers
436 views

Proofs of AM-GM inequality

The arithmetic - geometric mean inequality states that $$\frac{x_1+ \ldots + x_n}{n} \geq \sqrt[n]{x_1 \cdots x_n}$$ I'm looking for some original proofs of this inequality. I can find the usual ...
29
votes
3answers
3k views

The Hexagonal Property of Pascal's Triangle

Any hexagon in Pascal's triangle, whose vertices are 6 binomial coefficients surrounding any entry, has the property that: the product of non-adjacent vertices is constant. the greatest common ...
25
votes
3answers
739 views

**Ended Competition:** What is the shortest proof of $\exists x \forall y (D(x) \to D(y)) $?

The competition has ended 6 june 2014 22:00 GMT The winner is Bryan Well done ! When I was rereading the proof of the drinkers paradox (see Proof of Drinker paradox I realised that $\exists x ...
12
votes
3answers
290 views

Simplified form for $\frac{\operatorname d^n}{\operatorname dx^n}\left(\frac{x}{e^x-1}\right)$?

I have found the following formula: $$\frac{\operatorname d^n}{\operatorname ...
14
votes
1answer
1k views

A proof of Wolstenholme's theorem

This was inspired by this question. I tried to use the identity $${2n \choose n}=\sum_{k=0}^n {n \choose k}^2$$ (see this question) to prove that $$\binom{2p}p\equiv2\pmod{p^3}$$ if $p\gt3$ is ...
12
votes
8answers
2k views

Polygons with equal area and perimeter but different number of sides?

Let's say we have two polygons with different numbers of sides. They can be any sort of shape, but they have to have the same area, and perimeter. There could be such possibilities, but can someone ...
6
votes
1answer
757 views

How to deduce open mapping theorem from closed graph theorem?

These two theorems are equivalent but I can not figure out how to deduce the open mapping from the closed graph. Can anyone give a hint or some reference?
10
votes
1answer
101 views

Seeking a more direct proof for: $m+n\mid f(m)+f(n)\implies m-n\mid f(m)-f(n)$

If $f:\mathbb N\to\mathbb Z$ satisfies: $$\forall n,m\in\mathbb N\,, n+m\mid f(n)+f(m)$$ How to show that this implies: $$\forall n,m\in\mathbb N,\,n-m\mid f(n)-f(m)?$$ I was almost incidentally ...
9
votes
7answers
894 views

If $xy$ and $x+y$ are both even integers (with $x,y$ integers), then $x$ and $y$ are both even integers

The title statement can be proven using the contrapositive, note that $x$ odd or $y$ odd means that at least one of $x\cdot y,x+y$ is odd. Is there a way to prove the statement directly? To ...
7
votes
11answers
861 views

limit question: $\lim\limits_{n\to \infty } \frac{n}{2^n}=0$

$$ \lim_{n\to\infty}\frac n{2^n}=0. $$ I know how to prove it by using the trick, $2^n=(1+1)^n=1+n+\frac{n(n-1)}{2}+\text{...}$ But how to prove it without using this?
4
votes
1answer
290 views

Possible mistake in Krause's “Localization Theory”

I'm a little confused about a proof in this note by H. Krause; see page 12, Prop. 3.5.1. Can you explain me how the $\beta_i$'s are determined? I can't catch how to choose them in order to coequalize ...
3
votes
1answer
130 views

Proofs regarding Continuous functions 2

I need verification for this proof: Q: Suppose $f: (0,1)\rightarrow \mathbb{R}$ is defined by $f(x) = \begin{cases}\frac{1}{n} & \text{if }\text{x is rational with x} = \frac{m}{n}\text{ in ...
2
votes
2answers
185 views

How to complete this proof to show that the metric $d'(x,y) = d(x,y) / (1 + d(x,y))$ gives the same topology as $d(x,y)$ gives?

This is an exercise problem from Munkres's Topology (Exercise 11 of Section 20 "The Metric Topology", 2nd edition). Exercise 11: Show that if $d$ is a metric for $X$, then $$d'(x,y) = d(x,y) / (1 ...
2
votes
1answer
77 views

How to show that $\lfloor n/1\rfloor+\lfloor n/2 \rfloor+…+\lfloor n/n\rfloor+\lfloor{\sqrt{n}}\rfloor$ is even?

Let $n$ is a natural number. Prove that $$\left\lfloor\frac{n}{1}\right\rfloor+\left\lfloor\frac{n}{2}\right\rfloor+....+\left\lfloor\frac{n}{n}\right\rfloor+\left\lfloor{\sqrt{n}}\right\rfloor$$ ...
2
votes
1answer
245 views

questions about Rudin's summation by parts

rudin's summation by parts 3.41 Theorem Given two sequences $\left\{a_n\right\}$,$\left\{b_n\right\}$,put $$\begin{align*}A_n=\sum _{k=0}^n a_k~~~(1)\end{align*}$$ if $n\geq 0$; put $A_{-1}=0$. ...