Mathematics – Number Theory
Scientific paper
2004-06-01
JP Journal of Algebra, Number Theory, and Applications (JPANTA) 7 (2007), no. 1, 1-32
Mathematics
Number Theory
22 pages, LaTeX, 11pt; to appear in the JP Journal of Algebra, Number Theory, and Applications (JPANTA)
Scientific paper
In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of any fraction. Most of these results are accompanied by a proof (along with the assumptions needed), that works in a Euclidean domain. We then ask some obvious questions related to the results, and mention some similar questions that have been answered. In the final section (written jointly with P. Moree), some quantitative statements regarding the asymptotic behaviour of various sets of primes satisfying related properties, are considered.
No associations
LandOfFree
Divisibility tests and recurring decimals in Euclidean domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Divisibility tests and recurring decimals in Euclidean domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Divisibility tests and recurring decimals in Euclidean domains will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348632