اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Irrationality Exponents of Computable Numbers
230
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 whose irrationality exponent is not computable.
قيم البحث
اقرأ أيضاً
We generalize the classical theorem by Jarnik and Besicovitch on the irrationality exponents of real numbers and Hausdorff dimension. Let a be any real number greater than or equal to 2 and let b be any non-negative real less than or equal to 2/a. We
show that there is a Cantor-like set with Hausdorff dimension equal to b such that, with respect to its uniform measure, almost all real numbers have irrationality exponent equal to a. We give an analogous result relating the irrationality exponent and the effective Hausdorff dimension of individual real numbers. We prove that there is a Cantor-like set such that, with respect to its uniform measure, almost all elements in the set have effective Hausdorff dimension equal to b and irrationality exponent equal to a. In each case, we obtain the desired set as a distinguished path in a tree of Cantor sets.
We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n sim A alpha^{d^n}$, but li
ttle can be said about the constant $alpha$. In this paper, we show that $alpha$ is always irrational or an integer. In fact, we prove a stronger statement: if a sequence $G_n$ satisfies an asymptotic formula of the form $G_n = A alpha^n + B + O(alpha^{-epsilon n})$, where $A,B$ are algebraic and $alpha > 1$, and the sequence contains infinitely many integers, then $alpha$ is irrational or an integer.
In this note we show how the irrationality measure of $zeta(s) = pi^2/6$ can be used to obtain explicit lower bounds for $pi(x)$. We analyze the key ingredients of the proof of the finiteness of the irrationality measure, and show how to obtain good
lower bounds for $pi(x)$ from these arguments as well. Whi
We examine the degree structure $mathbf{ER}$ of equivalence relations on $omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not have a join bu
t that some incomparable degrees do, and we characterize the degrees which have a join with every finite equivalence relation. We show that the natural classes of finite, light, and dark degrees are definable in $mathbf{ER}$. We show that every equivalence relation has continuum many self-full strong minimal covers, and that $mathbf{d}oplus mathbf{Id_1}$ neednt be a strong minimal cover of a self-full degree $mathbf{d}$. Finally, we show that the theory of the degree structure $mathbf{ER}$ as well as the theories of the substructures of light degrees and of dark degrees are each computably isomorphic with second order arithmetic.
Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same sum, which w
ill be $sigma(n)/2$. Generalizing even further, we call $n$ a $k$-layered number if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we completely characterize Zumkeller numbers with two distinct prime factors and give some bounds for prime factorization in case of Zumkeller numbers with more than two distinct prime factors. We also characterize $k$-layered numbers with two distinct prime factors and even $k$-layered numbers with more than two distinct odd prime factors. Some other results concerning these numbers and their relationship with practical numbers and Harmonic mean numbers are also discussed.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
