4
votes
1answer
248 views

Lower bound on the irrationality measure of $\pi$

There seems to be a lot of work on the upper bound for the irrationality measure of $\pi$, but I could not find anything on a lower bound except the general $\mu(\pi)\geq2$. Looks like it is the best ...
4
votes
1answer
152 views

Hermite Lindemann and transcendental reals

This is about compass and straightedge constructions, although I suspect nothing changes if we expand to real numbers algebraic over the rationals. Anyway, let $E$ be the "constructible numbers," ...
10
votes
1answer
367 views

Distribution mod 1 of exponential growth sequences

Let $t_n$ be a sequence of real numbers and $C,r>1.$ Suppose that for every $n\geq 1$ we have $\frac{1}{C}r^n\leq t_n \leq Cr^n.$ Does there exist a real number $\xi$ and an $\varepsilon>0$ ...
2
votes
2answers
507 views

Liouville's Theorem in Diophantine Approximation

Liouville's Theorem states that for any algebraic $\alpha \in \mathbb{R}$ of degree $n$, there exists a positive constant $c:=c(\alpha)$ such that $$|\alpha-\frac{p}{q}|>\frac{c}{q^n}$$ for any $p ...
5
votes
1answer
435 views

Analogue of van der Corput sequence for prime numbers

A van der Corput sequence is a low-discrepancy sequence over the unit interval first published in 1935 by the Dutch mathematician J. G. van der Corput. It is constructed by placing a decimal point and ...
3
votes
4answers
469 views

Equidistribution Theorem: distance between solutions

Can please someone help me with the following problem. Say we have a sequence $nx \; \mathrm{mod} \; 1$, where $n$ is a whole number and $x$ is irrational. Now I need to solve the inequality $nx \; ...
0
votes
2answers
520 views

A simple question regarding the sum-of-divisors function

A good day to everyone. Consider the following "Conjecture": If $a, b \in M \subset \mathbb{N}$, then $1 < a < b$ and ... [plus some more conditions on $a, b$ and $M$...] if and only if ...
0
votes
1answer
344 views

An asymptotic expression for the solution to the squares problem suggested by statistical mechanics

The $s$ squares problem is to count the number $r_s (n)$ of integer solutions $(x_1,x_2,...,x_s)$ of the Diophantine equation $x_{1}^{2}+x_{2}^{2}+...+x_{s}^{2}=n$ in which changing the sign or ...
74
votes
4answers
4k views

If $2^x $and $3^x$ are integers, must $x$ be as well?

I'm fascinated by this open problem (if it is indeed still that) and every few years I try to check up on its status. Some background: Let $x$ be a positive real number. If $n^x$ is an integer for ...