相关论文: The birthday boy problem
We show that every irrational number is a sum of two real numbers with diverging partial quotients. The proof is constructive. The key towards these results is an algorithm which was recently developed by Nikita Shulga, and our study of…
This PhD thesis elaborates on a problem raised by Schmidt in 1967. We study Diophantine exponents for subspaces, which generalize the irrationality measure for real numbers. We construct subspaces with prescribed exponents and demonstrate…
New (infinitely many) rational approximants to \zeta(3) proving its irrationality are given. The recurrence relations for the numerator and denominator of these approximants as well as their continued fraction expansions are obtained. A…
In this note, I develop step-by-step proofs of irrationality for $\,\zeta{(2)}\,$ and $\,\zeta{(3)}$. Though the proofs follow closely those based upon unit-square integrals proposed originally by Beukers, I introduce some modifications…
The irrationality exponent of a real number measures how well that number can be approximated by rationals. Real numbers with irrationality exponent strictly greater than $2$ are transcendental numbers, and form a set with rich fractal…
About 40 years ago Jonathan and Peter Borwein discovered the series identity $$ \sum_{n=0}^\infty \frac{(-1)^n(6n)!}{(3n)!(n!)^3} \frac{(A+nB)}{C^{n+1/2}} = \frac{1}{12\pi} $$ where \begin{align*} A&=1657145277365+212175710912\sqrt{61},\cr…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
In this paper we present two efficient methods for reconstructing a rational number from several residue-modulus pairs, some of which may be incorrect. One method is a natural generalization of that presented by Wang, Guy and Davenport in…
Birthday problem is a well-known classic problem in probability theory widely applied in cryptography, and bubble sort is a popular sorting algorithm leading to some interesting theoretical problems in computer science. However, the…
The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…
Goedel Incompleteness Theorem leaves open a way around it, vaguely perceived for a long time but not clearly identified. (Thus, Goedel believed informal arguments can answer any math question.) Closing this loophole does not seem obvious…
We address the problem of determining the Hausdorff dimension of sets consisting of complex irrationals whose complex continued fraction digits satisfy prescribed restrictions and growth conditions. For the Hurwitz continued fraction, we…
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…
The Plurality problem - introduced by Aigner \cite{A2004} - has many variants. In this article we deal with the following version: suppose we are given $n$ balls, each of them colored by one of three colors. A \textit{plurality ball} is one…
Fix an irrational number $\theta$. For a real number $\tau >0$, consider the numbers $y$ satisfying that for all large number $Q$, there exists an integer $1\leq n\leq Q$, such that $\|n\theta-y\|<Q^{-\tau}$, where $\|\cdot\|$ is the…
Let $\zeta_2(\cdot)$ be the Kubota-Leopoldt $2$-adic zeta function. We prove that, for every nonnegative integer $s$, there exists an odd integer $j$ in the interval $[s+3,3s+5]$ such that $\zeta_2(j)$ is irrational. In particular, at least…
To solve the probability problem of the Many Worlds Interpretation of Quantum Mechanics, D.Wallace has presented a formal proof of the Born rule via decision theory, as proposed by D.Deutsch. The idea is to get subjective probabilities from…
In this note I give simple proofs of classical results of Euler, Legendre and Sylvester showing that for certain integers M there are no (or only a few) solutions of $x^3 + y^3 = M$, with $x$ and $y$ in $\mathbb{Q}$. The proofs all use a…
Consider a uniformly random deck consisting of cards labelled by numbers from $1$ through $n$, possibly with repeats. A guesser guesses the top card, after which it is revealed and removed and the game continues. What is the expected number…
In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number we want to divide by is not zero. In many cases, any real…