A counting method for finding rational approximates to arbitrary order roots of integers

Details A counting method for finding rational approximates to arbitrary order roots of integers A counting method for finding rational approximates to arbitrary order roots of integers

1999-12-11

arxiv.org/abs/math/9912090v1

Mathematics

General Mathematics

Scientific paper

It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a 'replacement rule' that generates a word W* from another word W consisting of symbols belonging to a finite 'alphabet' of size m. This rule applied iteratively on almost any initial word W0, yields a sequence of words {Wi} such that the relative frequency of different symbols in the word Wi approaches powers of the m'th root of N as i tends to infinity

Affiliated with

Also associated with

No associations

Rating

A counting method for finding rational approximates to arbitrary order roots of integers 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 A counting method for finding rational approximates to arbitrary order roots of integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A counting method for finding rational approximates to arbitrary order roots of integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-420039