Tagged Questions

Questions on more advanced topics of number theory, such as quadratic residues, primitive roots, prime numbers, non-linear Diophantine equations, etc. Consider first if (elementary-number-theory) might be a more appropriate tag before adding this tag.

0answers
1k views

Gross-Zagier formulae outside of number theory

(Edit: I have asked this question on MO.) The Gross-Zagier formula and various variations of it form the starting point in most of the existing results towards the Birch and Swinnerton-Dyer ...
0answers
1k views

On the problem of polynomial bijection from $\mathbb Q\times\mathbb Q$ to $\mathbb Q$

The question titled "Polynomial bijection from $\mathbb Q\times\mathbb Q$ to $\mathbb Q$" which was posed on MathOverflow attracted quite a lot of attention (and may be the question with most wrong ...
0answers
330 views

Does every ring of integers sit inside a ring of integers that has a power basis?

Given a finite extension of the rationals, K, we know that $K=\mathbb{Q}[\alpha]$ by the primitive element theorem, so every $x \in K$ has the form $$x = a_0 + a_1 \alpha + \cdots + a_n \alpha^n$$ ...
0answers
742 views

How to solve this two simultaneous “divisibilities” : $n+1\mid m^2+1$ and $m+1\mid n^2+1$

Is it possible to find all integers $m>0$ and $n>0$ such that $n+1\mid m^2+1$ and $m+1\,|\,n^2+1$ ? I succeed to prove there is an infinite number of solutions, but I can not progress anymore......
0answers
685 views

Definitive source about Dirichlet finally proving the Unit Theorem in the Sistine Chapel

There is a remark one can find in various books or survey articles (e.g., page 49 of Helmut Koch's "Number Theory: Algebraic Numbers and Algebraic Functions") saying Dirichlet figured out a proof of ...
0answers
499 views

0answers
316 views

Simplify the sum $\sum_{n=2}^N\frac{1}{n^2}\sin^2(\pi x)\csc^2(\frac{\pi x}{n})$? - a sum shows all primes $\le N^2$

I was looking for a closed form but it seemed too difficult. Now I'm seeking help to simplify this sum. The 50 bounty points or more will be awarded for any meaningful simplification of this sum. I ...
0answers
197 views

Where Fermat's last theorem fails

It's fairly well known that Fermat's last theorem fails in $\mathbb{Z}/p\mathbb{Z}$. Schur discovered this while he was trying to prove the conjecture on $\mathbb{N}$, and the proof is an application ...
0answers
315 views

Algorithm to find primes up to $n$ in $O\left(\frac{n}{\log n}\right)$?

Consider the problem of given an integer $n$, generating a list of the primes not greater than $n$. An optimized version of the Sieve of Eratosthenes can do such task in $O(n)$, while the more modern ...
0answers
428 views

0answers
475 views