相关论文: A computational criterion for the irrationality of…

In order to prove irrationality of \sqrt{2} by using only decimal expansions (and not fractions), we develop in detail a model of real numbers based on infinite decimals and arithmetic operations with them.

We prove that a real number a greater than or equal to 2 is the irrationality exponent of some computable real number if and only if a is the upper limit of a computable sequence of rational numbers. Thus, there are computable real numbers…

We study asymptotics for the intergal of irrationality measure functions.

In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…

We study the relationship between the frequency of a ternary digit in a number and the asymptotic mean value of the digits. The conditions for the existence of the asymptotic mean of digits in a ternary number are established. We indicate…

A common question from students on the usual diagonalization proof for the uncountability of the set of real numbers is: when a representation of real numbers, such as the decimal expansions of real numbers, allows us to use the…

Summation arithmetic functions with asymptotically independent terms are studied in the paper, the limit of which is the law of normal distribution. Assertions about the asymptotic behavior of the indicated functions are proved.

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…

Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…

We give asymptotic estimates for the mean number of divisors of integers without small prime factors, integers with bounded ratios of consecutive divisors, and for practical numbers. In the last case, this confirms a conjecture of…

We provide an asymptotic estimate for the number of rational points of bounded height on a non-singular conic over the rationals. The estimate is uniform in the coefficients of the underlying quadratic form.

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

Despite the fact that almost all real numbers are absolutely normal---that is, the digits in their expansions to any base occur in all possible configurations with the expected frequency---not one specific example of an absolutely normal…

We investigate the topological structure of the decimal expansions of the three famous naturally occurring irrational numbers, $\pi$, $e$, and golden ratio, by explicitly calculating the diversity of the pair distributions of the ten digits…

We prove conditional asymptotic normality of a class of quadratic U-statistics that are dominated by their degenerate second order part and have kernels that change with the number of observations. These statistics arise in the construction…

We introduce a concept of asymptotic mean of digits (symbols) in the $Q_s$-representation of a real number, that is a generalization of the $s$-adic representation and have a self-similar geometry. We discuss its relationship with the…

A real number is called simply normal to base $b$ if every digit $0,1,\ldots ,b-1$ should appear in its $b$-adic expansion with the same frequency $1/b$. A real number is called normal to base $b$ if it is simply normal to every base $b,…

An integer $n\ge 1$ is said to be practical if every natural number $ m \le n$ can be expressed as a sum of distinct positive divisors of $n$. The number of practical numbers up to $x$ is asymptotic to $c x/\log x$, where $c$ is a constant.…

If we form a decimal where the nth digit is the last non-zero digit of $n!$ (likewise, the last non-zero digit of $n^n$), we obtain an irrational number

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…