Questions tagged [number-theory]

Questions on advanced topics - beyond those in typical introductory courses: higher degree algebraic number and function fields, Diophantine equations, geometry of numbers / lattices, quadratic forms, discontinuous groups and and automorphic forms, Diophantine approximation, transcendental numbers, elliptic curves and arithmetic algebraic geometry, exponential and character sums, Zeta and L-functions, multiplicative and additive number theory, etc.

Number theory is concerned with the study of natural numbers. One of the main subjects is studying the behavior of prime numbers.

We know that by the prime number theorem, the number of primes less than $x$ is approximately $\frac{x}{\ln(x)}$. Another good approximation is $\operatorname{li}(x)$. Despite these estimates, we don't know much about the maximal prime gaps. The weaker conjectures, such as Legendre's conjecture, Andrica's conjecture and Opperman's conjecture, imply a gap of $O\left(\sqrt{p}\right)$. Stronger conjectures even imply a gap of $O(\ln^2(p))$. The Riemann Hypothesis implies a gap of $O\left(\sqrt{p} \ln(p)\right)$, though proving this is not sufficient to show the RH. The minimal gap is also a subject of research. It has been shown that gaps smaller than or equal to $246$ occur infinitely often. It is conjectured that gaps equal to $2$ occur infinitely often. This is known as the twin prime conjecture.

Another subject in number theory are Diophantine equations, which are polynomial equations in more than one variable, where variables are integer valued. Some equations can be solved by considering terms modulo some number or by considering divisors, prime factors or the number of divisors. Other equations, such as Fermat's Last Theorem, are much harder, and are or were famous open problems. Recent progress usually uses algebraic number theory and the related elliptic curves.

Another subject is the study of number theoretic functions, most notably $\tau(n)$, the number of divisiors of $n$, $\sigma(n)$, the sum of divisors of $n$ and $\varphi(n)$, the Euler-phi function, the number of numbers smaller than $n$ coprime with $n$.

For questions on elementary topics such as congruences, linear Diophantine equations, greatest common divisors, quadratic and power residues, primitive roots, please use the tag. This tag is for more advanced topics such as higher degree algebraic number and function fields, Diophantine equations, geometry of numbers / lattices, quadratic forms, discontinuous groups and and automorphic forms, Diophantine approximation, transcendental numbers, elliptic curves and arithmetic algebraic geometry, exponential and character sums, zeta and L-functions, multiplicative and additive number theory, etc.

38388 questions
153
votes
3 answers

The square roots of different primes are linearly independent over the field of rationals

I need to find a way of proving that the square roots of a finite set of different primes are linearly independent over the field of rationals. I've tried to solve the problem using elementary algebra and also using the theory of field…
user8465
  • 1,633
  • 3
  • 12
  • 6
144
votes
6 answers

Do Arithmetic Mean and Geometric Mean of Prime Numbers converge?

I was looking at a list of primes. I noticed that $ \frac{AM (p_1, p_2, \ldots, p_n)}{p_n}$ seemed to converge. This led me to try $ \frac{GM (p_1, p_2, \ldots, p_n)}{p_n}$ which also seemed to converge. I did a quick Excel graph and regression and…
Soham
  • 1,493
  • 1
  • 10
  • 11
136
votes
2 answers

Is there any mathematical reason for this "digit-repetition-show"?

The number $$\sqrt{308642}$$ has a crazy decimal representation : $$555.5555777777773333333511111102222222719999970133335210666544640008\cdots $$ Is there any mathematical reason for so many repetitions of the digits ? A long block containing only…
Peter
  • 78,494
  • 15
  • 63
  • 194
126
votes
1 answer

Can $x^{x^{x^x}}$ be a rational number?

If $x$ is a positive rational number, but not an integer, then can $x^{x^{x^x}}$ be a rational number ? We can prove that if $x$ is a positive rational number but not an integer, then $x^x$ can not be rational: Denote…
124
votes
1 answer

Is There An Injective Cubic Polynomial $\mathbb Z^2 \rightarrow \mathbb Z$?

Earlier, I was curious about whether a polynomial mapping $\mathbb Z^2\rightarrow\mathbb Z$ could be injective, and if so, what the minimum degree of such a polynomial could be. I've managed to construct such a quartic and rule out the existence of…
Milo Brandt
  • 58,703
  • 5
  • 98
  • 184
114
votes
1 answer

$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 $2n-2$. A proof can be found here. Two weeks and…
114
votes
5 answers

A multiplication algorithm found in a book by Paul Erdős: how does it work?

I am trying to understand the following problem from Erdős and Surányi's Topics in the theory of numbers (Springer), chapter 1 ("Divisibility, the Fundamental Theorem of Number Theory"): We can multiply two (positive integer) numbers together in…
iadvd
  • 8,645
  • 11
  • 31
  • 68
113
votes
1 answer

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 conjecture. It relates the value at $1$ of the derivative…
112
votes
25 answers

Different ways to prove there are infinitely many primes?

This is just a curiosity. I have come across multiple proofs of the fact that there are infinitely many primes, some of them were quite trivial, but some others were really, really fancy. I'll show you what proofs I have and I'd like to know more…
Patrick Da Silva
  • 39,395
  • 5
  • 76
  • 126
112
votes
5 answers

Finding a primitive root of a prime number

How would you find a primitive root of a prime number such as 761? How do you pick the primitive roots to test? Randomly? Thanks
user27617
111
votes
2 answers

Find all functions $f$ such that if $a+b$ is a square, then $f(a)+f(b)$ is a square

Question: For any $a,b\in \mathbb{N}^{+}$, if $a+b$ is a square number, then $f(a)+f(b)$ is also a square number. Find all such functions. My try: It is clear that the function $$f(x)=x$$ satisfies the given conditions, since: …
109
votes
5 answers

Fibonacci number that ends with 2014 zeros?

This problem is giving me the hardest time: Prove or disprove that there is a Fibonacci number that ends with 2014 zeros. I tried mathematical induction (for stronger statement that claims that there is a Fibonacci number that ends in any number…
109
votes
4 answers

Least prime of the form $38^n+31$

I search the least n such that $$38^n+31$$ is prime. I checked the $n$ upto $3000$ and found none, so the least prime of that form must have more than $4000$ digits. I am content with a probable prime, it need not be a proven prime.
Peter
  • 78,494
  • 15
  • 63
  • 194
104
votes
1 answer

Can we remove any prime number with this strange process?

This is a little algorithm I made today, which may appear to be quite complex so I will start with an example. The process goes as follows: Start with the first prime number, $2$. From $2$, add the next prime number ($3$) to get $2+3=5$. There are…
103
votes
1 answer

All polynomials with no natural roots and integer coefficients such that $\phi(n)|\phi(P(n))$

Let $P(x)$ be a polynomial with integer coefficients such that the equation $P(x)=0$ has no positive integer solutions. Find all polynomials $P(x)$ such that for all positive integers $n$ we have $\phi(n) \mid \phi(P(n))$. It is conjectured there…
Amir Parvardi
  • 4,788
  • 2
  • 23
  • 61