-adic continued fraction;
Khinchin’s theorem;
11A55;
11J70;
11K50;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
We study Schneider’s p-adic continued fraction algorithms. For p=2, we give a combinatorial characterization of rational numbers that have terminating expansions. For arbitrary p, we give data showing that rationals with terminating expansions are relatively rare. Finally, we prove an analogue of Khinchin’s theorem.