|
|
| Line 1: |
Line 1: |
| The digits of some specific integers [[cyclic permutation|permute]] or [[cyclic shift|shift]] cyclically when they are multiplied by a number ''n''. Examples are:
| |
|
| |
|
| *142857 × 3 = 428571 (shifts cyclically one place left)
| |
| *142857 × 5 = 714285 (shifts cyclically one place right)
| |
| *128205 × 4 = 512820 (shifts cyclically one place right)
| |
| *076923 × 9 = 692307 (shifts cyclically two places left)
| |
|
| |
|
| These specific integers, known as '''transposable integers''', can be but are not always [[cyclic number]]s. The characterization of such numbers can be done using [[repeating decimals]] (and thus the related fractions), or directly.
| | Nowadays Ugg footwear is becoming a household brand. Ugg footwear is including ugg Shoes, ugg slippers, and ugg boots and so on. They are all warm, stylish and comfortable for our feet. The real Ugg boots are made from Australia sheepskin. Ugg has tall and short boots for different targets. But they all can protect us from the rough, slippery and rigorous conditions. Their credibility is such that they are the ones that have helped the human race to evolve by moving it from places to places.<br><br>Ugg boots walk into the top of fashion with the unique design and appearance today. I know that many people thought Ugg boots were ugly and uncool. But no one can imagine that [http://www.dict.cc/englisch-deutsch/Ugg+boots.html Ugg boots] became the symbol of fashion after years. Today, so many people as well as super stars wear Ugg boots as fashion. They wear Ugg Classic Boots, [http://tinyurl.com/ku6vjks ugg boots sale] Sandals boots to attend all kinds of parties and appear on fashion magazines and TV show. As a result, Ugg is more and more popular with the favor of super stars.<br><br>This material are so fine that they can make you warm in cold season and make you cool in hot season. Its sheepskin lining that keeps your feet at the perfect temperature all the time. In contrast with Christian Louboutin Boots, people from countries all over the world proudly wear their comfortable boots that are useful year-round.<br><br>In addition, the colorful styles of Ugg boots and shoes are also important factor to the popularity. You can find any style shoes and boots from Ugg such as Ugg Classic tall boots, Ugg Ultra, [http://tinyurl.com/ku6vjks ugg boots sale] Slippers and Ugg Sandals. What's more, you can also choose any colors from pink, black, light color and dark color according to your hobbies and styles. To tell you the truth, [http://tinyurl.com/ku6vjks ugg boots sale] boots are very well to go with your clothes such as skirts, hoodies, jeans and others.<br><br>Depend on the unique warmth, Ugg boots get much favor from different people especially woman. In fact, [http://tinyurl.com/ku6vjks ugg boots sale] boots are really good choice. You can choose your ideal ugg boots for you and your family. They are many styles and colors for you. Rating: Please Rate: Processing ... (Average: Not rated) Print Email Report Share Tweet Related Articles <br>Tips When Purchasing Ugg Classic Cardy Boots<br><br>Pictorea Digital Photo Frame - New Frames to Hold Old Memories<br><br>Why Many People Like UGG Boots<br><br>[http://tinyurl.com/ku6vjks ugg boots sale] Classic Tall Boots Make You Confident<br><br>The Spokesperson of the Fashion Industry<br><br>How To Maintain Ugg Shoes Better - Part 2<br>Latest Articles <br>Effective tips to select the nail salon<br><br>Top 5 Trendy Dresses for Women<br><br>Choose comfortable and soft panty to avoid skin irritation<br><br>The Significance of a Trendy and Stylish Handbag<br><br>Shopping Online: The Greatest Approach to Obtain Ideal Bridesmaid Dresses Brisbane<br><br>Why You Should Own a Pair of Peep Toe Shoes<br>Please enable JavaScript to view the comments. Article Categories <br>Arts and EntertainmentArtists<br>Gambling<br>Humanities<br>Humor<br>Movies<br>Music<br>Photography<br>Tattoos<br>Television<br><br><br>Autos and CarsClassic Cars<br>Motorcycles<br>Recreational Vehicles<br>SUVs<br>Trucks<br>Vans<br><br><br>BusinessBranding<br>Business Opportunities<br>Careers and Jobs<br>Corporate<br>Customer Service<br>Direct Mail<br>Entrepreneurship<br>Ethics<br>[https://www.Vocabulary.com/dictionary/Financing Financing]<br>Franchising<br>Home-Based Business<br>Human Resources<br>Import and Export<br>Leadership<br>Management<br>Market Research<br>Marketing and Advertising<br>Negotiation<br>Network Marketing<br>Networking<br>Organizational<br>Presentation<br>Project Management<br>Public Relations<br>Small Business<br>Strategic Planning<br>Team Building<br>Telemarketing<br>Training<br><br><br>ComputersData Recovery<br>Databases<br>Games<br>Hardware<br>Networks<br>Operating Systems<br>Programming<br>Security<br>Software<br>Spyware and Viruses<br><br><br>Education and ReferenceAsk an Expert<br>College and University<br>Home Schooling<br>K-12<br>Languages<br>Online Education<br>Psychology<br><br><br>FinanceAccounting<br>Credit<br>Currency Trading<br>Debt Consolidation<br>Insurance<br>Investing<br>Leasing<br>Loans<br>Mortgage<br>Mutual Funds<br>Personal Finance<br>Stock Market<br>Structured Settlements<br>Taxes<br>Wealth Building<br><br><br>Food and DrinkCoffee<br>Cooking<br>Gourmet<br>Recipes<br>Wine and Spirits<br><br><br>HealthAcne<br>Aerobics<br>Alternative Medicine<br>Beauty<br>Cancer<br>Cosmetics<br>Depression<br>Diabetes<br>Diseases and Conditions<br>Fitness Equipment<br>Fitness<br>Hair Loss<br>Heart Disease<br>Medicine<br>Men's Health<br>Muscle Building<br>Nutrition<br>Skin Care<br>Supplements and Vitamins<br>Weight Loss<br>Women's Health<br>Yoga<br><br><br>Home and FamilyArts and Crafts<br>Babies<br>Collecting<br>Elderly Care<br>Genealogy<br>Hobbies<br>Parenting<br>Pets<br>Pregnancy<br>Woodworking<br><br><br>Home ImprovementFeng Shui<br>Gardening<br>Home Appliances<br>Home Security<br>Interior Design<br>Landscaping<br><br><br>InternetAffiliate Programs<br>Article Marketing<br>Auctions<br>Audio<br>Banner Advertising<br>Blogging<br>Broadband<br>Domain Names<br>E-Books<br>E-Commerce<br>Email Marketing<br>Ezines and Newsletters<br>Forums<br>Internet Marketing<br>Link Popularity<br>Pay-Per-Click<br>Podcasting<br>RSS<br>Search Engine Marketing<br>Search Engine Optimization<br>Security<br>Social Media<br>Spam<br>Video<br>Viral Marketing<br>Web Design<br>Web Development<br>Web Hosting<br><br><br>LawCopyright<br>Cyber Law<br>Intellectual Property<br>National, State, Local<br>Patents<br>Regulatory Compliance<br>Trademarks<br><br><br>Real EstateBuying<br>Selling<br><br><br>Recreation and SportsBaseball<br>Basketball<br>Boating<br>Cycling<br>Extreme Sports<br>Fishing<br>Football<br>Golf<br>Hockey<br>Hunting<br>Martial Arts<br>Running<br>Scuba Diving<br>Soccer<br>Swimming<br>Tennis<br><br><br>RelationshipsDating<br>Divorce<br>Marriage<br>Weddings<br><br><br>Religion and SpiritualityAstrology<br>Buddhism<br>Christianity<br>Faith<br>Hinduism<br>Islam<br>Judaism<br>Meditation<br>Metaphysical<br>New Age<br><br><br>Science and TechnologyCable and Satellite TV<br>Cell Phones<br>Communication<br>Gadgets and Gizmos<br>GPS<br>Satellite Radio<br>Video Conferencing<br>VoIP<br><br><br>Self ImprovementAddictions<br>Coaching<br>Goal Setting<br>Motivational<br>Stress Management<br>Time Management<br><br><br>ShoppingClothing<br>Electronics<br>Fashion<br>Gifts<br>Jewelry<br><br><br>Society and CultureCauses and Organizations<br>Environment<br>History<br>Holidays<br>Men's Issues<br>Nature<br>Philosophy<br>Politics<br>Women's Issues<br>World Affairs<br><br><br>TravelAir Travel<br>Camping<br>Cruises<br>Destinations<br>Outdoors<br><br><br>WritingArticle Writing<br>Book Reviews<br>Copywriting<br>Fiction<br>Non-Fiction<br>Poetry<br>Quotes<br>Screenplay<br>Tools and Resources<br><br>Artipot About Us<br><br>FAQ<br><br>Contact Us<br><br>Privacy Policy<br><br>Latest Articles<br><br>Top Articles<br><br>Top Authors<br><br>Site Map<br>Authors Submit Articles<br><br>Author Login<br><br>Editorial Guidelines<br><br>Terms of Service<br>Publishers Terms of Service<br>Follow Us RSS<br>Blog<br>Facebook<br>Twitter<br>Google+<br>� 2014 Artipot - Free Articles. All rights reserved. |
| | |
| ==General==
| |
| For any integer coprime to 10, its reciprocal is a repeating decimal without any non-recurring digits. E.g. {{frac|1|143}} = 0.<span style="text-decoration: overline;">006993</span>006993<span style="text-decoration: overline;">006993</span>...
| |
| | |
| While the expression of a single series with [[vinculum (symbol)|vinculum]] on top is adequate, the intention of the above expression is to show that the six [[cyclic permutation]]s of 006993 can be obtained from this repeating decimal if we select six consecutive digits from the repeating decimal starting from different digits.
| |
| | |
| This illustrates that cyclic permutations are somehow related to repeating decimals and the corresponding fractions. | |
| | |
| The [[greatest common divisor|greatest common divisor (gcd)]] between any cyclic permutation of an ''m''-digit integer and 10<sup>''m''</sup> − 1 is constant. Expressed as a formula,
| |
| | |
| :<math>\gcd\left(N,10^m-1\right)=\gcd\left(N_c,10^m-1\right),</math> | |
| | |
| where ''N'' is an ''m''-digit integer; and ''N<sub>c</sub>'' is any cyclic permutation of ''N''.
| |
| | |
| For example,
| |
| gcd(091575, 999999) = gcd(3<sup>2</sup>×5<sup>2</sup>×11×37, 3<sup>3</sup>×7×11×13×37)
| |
| = 3663
| |
| = gcd(915750, 999999)
| |
| = gcd(157509, 999999)
| |
| = gcd(575091, 999999)
| |
| = gcd(750915, 999999)
| |
| = gcd(509157, 999999)
| |
| | |
| If ''N'' is an ''m''-digit integer, the number ''N<sub>c</sub>'', obtained by shifting ''N'' to the left cyclically, can be obtained from:
| |
| | |
| :<math>N_c = 10 N - d\left(10^m-1\right), \, </math> | |
| | |
| where ''d'' is the first digit of ''N'' and ''m'' is the number of digits.
| |
| | |
| This explains the above common gcd and the phenomenon is true in any [[radix|base]] if 10 is replaced by ''b'', the base.
| |
| | |
| The cyclic permutations are thus related to repeating decimals, the corresponding fractions, and divisors of 10<sup>''m''</sup>−1. For examples the related fractions to the above cyclic permutations are thus:
| |
| *{{frac|091575|999999}}, {{frac|915750|999999}}, {{frac|157509|999999}}, {{frac|575091|999999}}, {{frac|750915|999999}}, and {{frac|509157|999999}}.
| |
| Reduced to their lowest terms using the common gcd, they are:
| |
| *{{frac|25|273}}, {{frac|250|273}}, {{frac|43|273}}, {{frac|157|273}}, {{frac|205|273}}, and {{frac|139|273}}.
| |
| | |
| That is, these fractions when expressed [[in lowest terms]], have the same denominator. This is true for cyclic permutations of any integer.
| |
| | |
| ==Fraction method==
| |
| ===Integral multiplier===
| |
| An integral multiplier refers to the multiplier ''n'' being an integer:
| |
|
| |
| #An integer ''X'' shift '''right''' cyclically by ''k'' positions when it is multiplied by '''an integer ''n'''''. ''X'' is then the repeating digits of {{frac|1|''F''}}, whereby ''F'' is ''F''<sub>0</sub> = ''n'' 10<sup>''k''</sup> − 1 (''F''<sub>0</sub> is [[coprime]] to 10), or a factor of ''F''<sub>0</sub>; excluding any values of ''F'' which are not more than ''n''.
| |
| #An integer ''X'' shift '''left''' cyclically by ''k'' positions when it is multiplied by '''an integer ''n'''''. ''X'' is then the repeating digits of {{frac|1|''F''}}, whereby ''F'' is ''F''<sub>0</sub> = 10<sup>''k''</sup> - ''n'', or a factor of ''F''<sub>0</sub>; excluding any values of ''F'' which are not more than ''n'' and which are not [[coprime]] to 10.
| |
| | |
| It is necessary for F to be coprime to 10 in order that {{frac|1|''F''}} is a repeating decimal without any preceding non-repeating digits (see multiple sections of [[Repeating decimal]]). If there are digits not in a period, then there is no corresponding solution.
| |
| | |
| For these two cases, multiples of ''X'', i.e. (''j X'') are also solutions provided that the integer ''i'' satisfies the condition {{frac|''n j''|''F''}} < 1. Most often it is convenient to choose the smallest ''F'' that fits the above.
| |
| The solutions can be expressed by the formula:
| |
| :<math>X = j \frac {10^p-1}{F}</math>
| |
| :where ''p'' is a period length of {{frac|1|''F''}}; and ''F'' is a factor of ''F''<sub>0</sub> coprime to 10.
| |
| :E.g, ''F''<sub>0</sub> = 1260 = 2<sup>2</sup> × 3<sup>2</sup> × 5 × 7. The factors excluding 2 and 5 recompose to ''F'' = 3<sup>2</sup> × 7 = 63. Alternatively, strike off all the '''ending zeros''' from 1260 to become 126, then divide it by 2 (or 5) iteratively until the quotient is no more divisible by 2 (or 5). The result is also ''F'' = 63.
| |
| | |
| To exclude integers that begin with zeros from the solutions, select an integer ''j'' such that {{frac|''j''|''F''}} > {{frac|1|10}}, i.e. ''j'' > {{frac|''F''|10}}.
| |
| | |
| There is no solution when ''n'' > ''F''.
| |
| | |
| ===Fractional multiplier===
| |
| | |
| An integer ''X'' shift '''left''' cyclically by ''k'' positions when it is multiplied by '''a fraction {{frac|''n''|''s''}}'''. ''X'' is then the repeating digits of {{frac|''s''|''F''}}, whereby ''F'' is ''F''<sub>0</sub> = s 10<sup>''k''</sup> - ''n'', or a factor of ''F''<sub>0</sub>; and ''F'' must be coprime to 10.
| |
| | |
| For this third case, multiples of ''X'', i.e. (''j X'') are again solutions but the condition to be satisfied for integer ''j'' is that {{frac|''n j''|''F''}} < 1. Again it is convenient to choose the smallest ''F'' that fits the above.
| |
| | |
| The solutions can be expressed by the formula:
| |
| :<math>X = j s \frac {10^p-1}{F}</math>
| |
| :where ''p'' is defined likewise; and ''F'' is made coprime to 10 by the same process as before.
| |
| | |
| To exclude integers that begin with zeros from the solutions, select an integer ''j'' such that {{frac|''j s''|''F''}} > {{frac|1|10}}, i.e. ''j'' > {{frac|''F''|10''s''}}.
| |
| | |
| Again if {{frac|''j s''|''F''}} > 1, there is no solution.
| |
| | |
| == Direct representation ==
| |
| The direct algebra approach to the above cases integral multiplier lead to the following formula:
| |
| #<math>X=D \frac {10^m-1}{n10^k-1},</math>
| |
| #:where ''m'' is the number of digits of ''X'', and ''D'', the ''k''-digit number shifted from the low end of ''X'' to the high end of ''n'' ''X'', satisfies ''D'' < 10<sup>''k''</sup>.
| |
| #:If the numbers are not to have leading zeros, then ''n'' 10<sup>''k'' − 1</sup> ≤ ''D''.
| |
| #<math>X = D \frac {10^m-1}{10^k-n},</math>
| |
| #:where ''m'' is the number of digits of ''X'', and ''D'', the ''k''-digit number shifted from the high end of ''X'' to the low end of ''n'' ''X'', satisfies:
| |
| #:#<math>D<\frac {10^k} n - 1,</math>
| |
| #:#and the 10-part (the product of the terms corresponding to the primes 2 and 5 of the [[prime factor|factorization]]) of 10<sup>''k''</sup> − ''n'' divides ''D''.
| |
| #:#:The 10-part of an integer ''t'' is often abbreviated <math>\operatorname{gcd}\left(10^\infty,t\right).</math>
| |
| #:If the numbers are not to have leading zeros, then 10<sup>''k'' − 1</sup> ≤ ''D''.
| |
| | |
| == Cyclic permutation by multiplication ==
| |
| | |
| A long division of 1 by 7 gives:
| |
| | |
| <u>0.142857...</u>
| |
| 7 ) 1.000000
| |
| <u>.7</u>
| |
| 3
| |
| <u>28</u>
| |
| 2
| |
| <u>14</u>
| |
| 6
| |
| <u>56</u>
| |
| 4
| |
| <u>35</u>
| |
| 5
| |
| <u>49</u>
| |
| 1
| |
| | |
| At the last step, 1 reappears as the remainder. The cyclic remainders are {1, 3, 2, 6, 4, 5}. We rewrite the quotients with the corresponding dividend/remainders above them at all the steps:
| |
| Dividend/Remainders 1 3 2 6 4 5
| |
| Quotients 1 4 2 8 5 7
| |
| | |
| and also note that: | |
| | |
| * {{frac|1|7}} = 0.142857...
| |
| * {{frac|3|7}} = 0.428571...
| |
| * {{frac|2|7}} = 0.285714...
| |
| * {{frac|6|7}} = 0.857142...
| |
| * {{frac|4|7}} = 0.571428...
| |
| * {{frac|5|7}} = 0.714285...
| |
| | |
| By observing the remainders at each step, we can thus perform a desired [[cyclic permutation]] by multiplication. E.g.,
| |
| *The integer 142857, corresponding to remainder 1, permutes to 428571 when multiplied by 3, the corresponding remainder of the latter.
| |
| *The integer 142857, corresponding to remainder 1, permutes to 857142 when multiplied by 6, the corresponding remainder of the latter.
| |
| *The integer 857142, corresponding to remainder 6, permutes to 571428 when multiplied by {{frac|5|6}}; i.e. divided by 6 and multiplied by 5, the corresponding remainder of the latter.
| |
| | |
| In this manner, cyclical left or right shift of any number of positions can be performed.
| |
| | |
| Less importantly, this technique can be applied to any integer to [[cyclic shift|shift cyclically]] right or left by any given number of places for the following reason:
| |
| *Every repeating decimal can be expressed as a rational number (fraction).
| |
| *Every integer, when added with a decimal point in front and concatenated with itself infinite times, can be converted to a fraction, e.g. we can transform 123456 in this manner to 0.123456123456..., which can thus be converted to fraction {{frac|123456|999999}}. This fraction can be further simplified but it will not be done here.
| |
| *To permute the integer 123456 to 234561, all one needs to do is to multiply 123456 by {{frac|234561|123456}}. This looks like cheating but if {{frac|234561|123456}} is a whole number (in this case it is not), the mission is completed.
| |
| | |
| ==Proof of formula for cyclical right shift operation==
| |
| | |
| An integer ''X'' shift cyclically right by ''k'' positions when it is multiplied by an integer ''n''. Prove its formula.
| |
| | |
| '''Proof'''
| |
| | |
| First recognize that ''X'' is the repeating digits of a [[repeating decimal]], which always possesses cyclic behavior in multiplication. The integer ''X'' and its multiple ''n X'' then will have the following relationship:
| |
| | |
| #The integer ''X'' is the repeating digits of the fraction {{frac|1|''F''}}, say ''d<sub>p</sub>d<sub>p-1</sub>...d<sub>3</sub>d<sub>2</sub>d<sub>1</sub>'', where ''d<sub>p</sub>'', ''d<sub>p-1</sub>'', ..., ''d<sub>3</sub>'', ''d<sub>2</sub>'' and ''d<sub>1</sub>'' each represents a digit and ''p'' is the number of digits.
| |
| #The multiple ''n X'' is thus the repeating digits of the fraction {{frac|''n''|''F''}}, say ''d<sub>k</sub>d<sub>k-1</sub>...d<sub>3</sub>d<sub>2</sub>d<sub>1</sub>d<sub>p</sub>d<sub>p-1</sub>...d<sub>k+2</sub>d<sub>k+1</sub>'', representing the results after right cyclical shift of ''k'' positions.
| |
| #''F'' must be coprime to 10 so that when {{frac|1|''F''}} is expressed in decimal there is no preceding non-repeating digits otherwise the repeating decimal does not possesses cyclic behavior in multiplication.
| |
| #If the first remainder is taken to be ''n'' then ''1'' shall be the (''k'' + 1)<sup>th</sup> remainder in the long division for {{frac|n|''F''}} in order for this cyclic permutation to take place.
| |
| #In order that ''n'' × 10<sup>''k''</sup> = 1 (mod ''F'') then ''F'' shall be either ''F''<sub>0</sub> = (''n'' × 10<sup>k</sup> - 1), or a factor of ''F''<sub>0</sub>; but excluding any values not more than ''n'' and any value having a nontrivial common factor with 10, as deduced above.
| |
| | |
| This completes the proof.
| |
| | |
| ==Proof of formula for cyclical left shift operation==
| |
| | |
| An integer ''X'' shift cyclically left by ''k'' positions when it is multiplied by '''an integer ''n'''''. Prove its formula.
| |
| | |
| '''Proof'''
| |
| | |
| First recognize that ''X'' is the repeating digits of a [[repeating decimal]], which always possesses a cyclic behavior in multiplication. The integer ''X'' and its multiple ''n X'' then will have the following relationship:
| |
| | |
| #The integer ''X'' is the repeating digits of the fraction {{frac|1|''F''}}, say ''d<sub>p</sub>d<sub>p-1</sub>...d<sub>3</sub>d<sub>2</sub>d<sub>1</sub>'' .
| |
| #The multiple ''n X'' is thus the repeating digits of the fraction {{frac|''n''|''F''}}, say ''d<sub>p-k</sub>d<sub>p-k-1</sub>...d<sub>3</sub>d<sub>2</sub>d<sub>1</sub>d<sub>p</sub>d<sub>p-1</sub>...d<sub>p-k+1</sub>'',
| |
| which represents the results after left cyclical shift of ''k'' positions.
| |
| #''F'' must be coprime to 10 so that {{frac|1|''F''}} has no preceding non-repeating digits otherwise the repeating decimal does not possesses cyclic behavior in multiplication.
| |
| #If the first remainder is taken to be 1 then ''n'' shall be the (''k'' + 1)<sup>th</sup> remainder in the long division for {{frac|1|''F''}} in order for this cyclic permutation to take place.
| |
| #In order that 1 × 10<sup>k</sup> = ''n'' (mode ''F'') then ''F'' shall be either ''F''<sub>0</sub> = (10<sup>k</sup> -''n''), or a factor of ''F''<sub>0</sub>; but excluding any value not more than ''n'', and any value having a nontrivial common factor with 10, as deduced above.
| |
| | |
| This completes the proof. The proof for non-integral multiplier such as {{frac|''n''|''s''}} can be derived in a similar way and is not documented here.
| |
| | |
| == Shifting an integer cyclically ==
| |
| The permutations can be:
| |
| | |
| *Shifting right cyclically by single position ([[parasitic numbers]]);
| |
| *Shifting right cyclically by double positions;
| |
| *Shifting right cyclically by any number of positions;
| |
| *Shifting left cyclically by single position;
| |
| *Shifting left cyclically by double positions; and
| |
| *Shifting left cyclically by any number of positions
| |
| | |
| == Parasitic numbers ==
| |
| {{Main|parasitic number}}
| |
| | |
| When a parasitic number is multiplied by n, not only it exhibits the cyclic behavior but the permutation is such that the last digit of the parasitic number now becomes the first digit of the multiple. For example, 102564 x 4 = 410256. Note that 102564 is the repeating digits of {{frac|4|39}} and 410256 the repeating digits of {{frac|16|39}}.
| |
| | |
| == Shifting right cyclically by double positions ==
| |
| An integer ''X'' shift right cyclically by double positions when it is multiplied by an integer ''n''. ''X'' is then the repeating digits of {{frac|1|''F''}}, whereby {{math|''F''}} = ''n'' × 10<sup>2</sup> - 1; or a factor of it; but excluding values for which {{frac|1|''F''}} has a period length dividing 2 (or, equivalently, less than 3); and {{math|''F''}} must be coprime to 10.
| |
| | |
| Most often it is convenient to choose the smallest {{math|''F''}} that fits the above.
| |
| | |
| === Summary of results ===
| |
| The following multiplication moves the last two digits of each original integer to the first two digits and shift every other digits to the right:
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| ! Multiplier ''n''
| |
| ! Solution
| |
| ! Represented by
| |
| ! Other Solutions
| |
| |-
| |
| | 2
| |
| | 0050251256 2814070351 7587939698 4924623115 5778894472 3618090452 2613065326 6331658291 4572864321 608040201
| |
| | {{frac|1|199}} x 2 = {{frac|2|199}}
| |
| period = 99
| |
| i.e. 99 repeating digits.
| |
| | {{frac|2|199}}, {{frac|3|199}}, ..., {{frac|99|199}}
| |
| |-
| |
| | 3
| |
| | 0033444816 0535117056 8561872909 6989966555 1839464882 9431438127 090301
| |
| | {{frac|1|299}} x 3 = {{frac|3|299}}
| |
| period = 66
| |
| | |
| 299 = 13×23
| |
| | {{frac|2|299}}, {{frac|3|299}}, ..., {{frac|99|299}}
| |
| some special cases are illustrated below
| |
| |-
| |
| | 3
| |
| | 076923
| |
| | {{frac|1|13}} x 3 = {{frac|3|13}}
| |
| period = 6
| |
| | {{frac|2|13}}, {{frac|3|13}}, {{frac|4|13}}
| |
| |-
| |
| | 3
| |
| | 0434782608 6956521739 13
| |
| | {{frac|1|23}} x 3 = {{frac|3|23}}
| |
| period = 22
| |
| | {{frac|2|23}}, {{frac|3|23}}, ..., {{frac|7|23}}
| |
| |-
| |
| | 4
| |
| | 0025062656 64160401
| |
| | {{frac|1|399}} x 4 = {{frac|4|399}}
| |
| period = 18
| |
| | |
| 399 = 3×7×19
| |
| | {{frac|2|399}}, {{frac|3|399}}, ..., {{frac|99|399}}
| |
| some special cases are illustrated below
| |
| |-
| |
| | 4
| |
| | 142857
| |
| | {{frac|1|7}} x 4 = {{frac|4|7}}
| |
| period = 6
| |
| | -
| |
| |-
| |
| | 4
| |
| | 0526315789 47368421
| |
| | {{frac|1|19}} x 4 = {{frac|4|19}}
| |
| period = 18
| |
| | {{frac|2|19}}, {{frac|3|19}}, {{frac|4|19}}
| |
| |-
| |
| | 5
| |
| | (a [[cyclic number]] with a period of 498)
| |
| | {{frac|1|499}} x 5 = {{frac|5|499}}
| |
| 499 is a [[full reptend prime]]
| |
| | {{frac|2|499}}, {{frac|3|499}}, ..., {{frac|99|499}}
| |
| |}
| |
| | |
| Note that:
| |
| *299 = 13 x 23, and the period of {{frac|1|299}} is accurately determined by the formula, LCM(6, 22) = 66, according to [[Repeating decimal#Generalization]].
| |
| *399 = 3 x 7 x 19, and the period of {{frac|1|399}} is accurately determined by the formula, LCM(1, 6, 18) = 18.
| |
| | |
| There are many other possibilities.
| |
| | |
| == Shifting left cyclically by single position ==
| |
| Problem: An integer ''X'' shift left cyclically by single position when it is multiplied by 3. Find ''X''.
| |
| | |
| Solution:
| |
| First recognize that ''X'' is the repeating digits of a [[repeating decimal]], which always possesses some interesting cyclic behavior in multiplications.
| |
| The integer ''X'' and its multiple then will have the following relationship:
| |
| | |
| *The integer ''X'' is the repeating digits of the fraction {{frac|1|''F''}}, say ''ab***''.
| |
| *The multiple is thus the repeating digits of the fraction {{frac|3|''F''}}, say ''b***a''.
| |
| *In order for this cyclic permutation to take place, then 3 shall be the next remainder in the long division for {{frac|1|''F''}}. Thus {{math|''F''}} shall be 7 as 1 × 10 ÷ 7 gives remainder 3.
| |
| | |
| This yields the results that:
| |
| | |
| :''X'' = the repeating digits of {{frac|1|7}}
| |
| ::=142857, and
| |
| :the multiple = 142857 × 3 = 428571, the repeating digits of {{frac|3|7}}
| |
| | |
| The other solution is represented by {{frac|2|7}} x 3 = {{frac|6|7}}:
| |
| *285714 x 3 = 857142
| |
| | |
| There are no other solutions <ref>P. Yiu, k-right-transposable integers, Chap.18.1 'Recreational Mathematics'</ref> because:
| |
| *Integer ''n'' must be the subsequent remainder in a long division of a fraction {{frac|1|F}}. Given that n = 10 - F, and F is coprime to 10 in order for {{frac|1|F}} to be a repeating decimal, then ''n'' shall be less than 10.
| |
| *For ''n'' = 2, F must be 10 - 2 = 8. However {{frac|1|8}} does not generate a repeating decimal, similarly for ''n'' = 5.
| |
| *For ''n'' = 7, F must be 10 - 7 = 3. However 7 > 3 and {{frac|7|3}} = 2.333 > 1 and does not fit the purpose.
| |
| *Similarly there is no solution for any other integer of ''n'' less than 10 except ''n'' = 3.
| |
| | |
| However, if the multiplier is not restricted to be an integer (though ugly), there are many other solutions from this method. E.g., if an integer ''X'' shift right cyclically by single position when it is multiplied by {{frac|3|2}}, then 3 shall be the next remainder after 2 in a long division of a fraction {{frac|2|F}}. This deduces that F = 2 x 10 - 3 = 17, giving ''X'' as the repeating digits of {{frac|2|17}}, i.e. 1176470588235294, and its multiple is 1764705882352941.
| |
| | |
| The following summarizes some of the results found in this manner:
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| ! Multiplier ''{{frac|n|s}}''
| |
| ! Solution
| |
| ! Represented by
| |
| ! Other Solutions
| |
| |-
| |
| | {{frac|1|2}}
| |
| | 105263157894736842
| |
| | {{frac|2|19}} × {{frac|1|2}} = {{frac|1|19}}
| |
| A 2-[[parasitic number]]
| |
| | Other 2-parasitic numbers:
| |
| {{frac|4|19}}, {{frac|6|19}}, {{frac|8|19}}, {{frac|10|19}}, {{frac|12|19}}, {{frac|14|19}}, {{frac|16|19}}, {{frac|18|19}}
| |
| |-
| |
| | {{frac|3|2}}
| |
| | 1176470588235294
| |
| | {{frac|2|17}} × {{frac|3|2}} = {{frac|3|17}}
| |
| | {{frac|4|17}}, {{frac|6|17}}, {{frac|8|17}}, {{frac|10|17}}
| |
| |-
| |
| | {{frac|7|2}}
| |
| | 153846
| |
| | {{frac|2|13}} × {{frac|7|2}} = {{frac|7|13}}
| |
| | -
| |
| |-
| |
| | {{frac|9|2}}
| |
| | 18
| |
| | {{frac|2|11}} × {{frac|9|2}} = {{frac|9|11}}
| |
| | -
| |
| |-
| |
| | {{frac|7|3}}
| |
| | 1304347826086956521739
| |
| | {{frac|3|23}} × {{frac|7|3}} = {{frac|7|23}}
| |
| | {{frac|6|23}}, {{frac|9|23}}, {{frac|12|23}}, {{frac|15|23}}, {{frac|18|23}}, {{frac|21|23}}
| |
| |-
| |
| | {{frac|19|4}}
| |
| | 190476
| |
| | {{frac|4|21}} × {{frac|19|4}} = {{frac|19|21}}
| |
| | -
| |
| |}
| |
| | |
| == Shifting left cyclically by double positions ==
| |
| An integer ''X'' shift left cyclically by double positions when it is multiplied by an integer ''n''. ''X'' is then the repeating digits of {{frac|1|''F''}}, whereby {{math|''F''}} is {{math|''R''}} = 10<sup>2</sup> - n, or a factor of {{math|''R''}}; excluding values of {{math|''F''}} for which {{frac|1|''F''}} has a period length dividing 2 (or, equivalently, less than 3); and ''F'' must be coprime to 10.
| |
| | |
| Most often it is convenient to choose the smallest {{math|''F''}} that fits the above.
| |
| | |
| === Summary of results ===
| |
| | |
| The following summarizes some of the results obtained in this manner, where the white spaces between the digits divide the digits into 10-digit groups:
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| ! Multiplier ''n''
| |
| ! Solution
| |
| ! Represented by
| |
| ! Other Solutions
| |
| |-
| |
| | 2
| |
| | 142857
| |
| | {{frac|1|7}} × 2 = {{frac|2|7}}
| |
| | {{frac|2|7}}, {{frac|3|7}}
| |
| |-
| |
| | 3
| |
| | 0103092783 5051546391 7525773195 8762886597 9381443298 9690721649 4845360824 7422680412 3711340206 185567
| |
| | {{frac|1|97}} x 3 = {{frac|3|97}}
| |
| | {{frac|2|97}}, {{frac|3|97}}, {{frac|4|97}}, {{frac|5|97}}, ...., {{frac|31|97}}, {{frac|32|97}}
| |
| |-
| |
| | 4
| |
| | No solution
| |
| | -
| |
| | -
| |
| |-
| |
| | 5
| |
| | 0526315789 47368421
| |
| | {{frac|1|19}} x 5 = {{frac|5|19}}
| |
| | {{frac|2|19}}, {{frac|3|19}}
| |
| |-
| |
| | 6
| |
| | 0212765957 4468085106 3829787234 0425531914 893617
| |
| | {{frac|1|47}} x 6 = {{frac|6|47}}
| |
| | {{frac|2|47}}, {{frac|3|47}}, {{frac|4|47}}, {{frac|5|47}}, {{frac|6|47}}, {{frac|7|47}}
| |
| |-
| |
| | 7
| |
| | 0322580645 16129
| |
| | {{frac|1|31}} x 7 = {{frac|7|31}}
| |
| | {{frac|2|31}}, {{frac|3|31}}, {{frac|4|31}}
| |
| {{frac|1|93}}, {{frac|2|93}}, {{frac|4|93}}, {{frac|5|93}}, {{frac|7|93}}, {{frac|8|93}}, {{frac|10|93}}, {{frac|11|93}}, {{frac|13|93}}
| |
| |-
| |
| | 8
| |
| | 0434782608 6956521739 13
| |
| | {{frac|1|23}} x 8 = {{frac|8|23}}
| |
| | {{frac|2|23}}
| |
| |-
| |
| | 9
| |
| | 076923
| |
| | {{frac|1|13}} x 9 = {{frac|9|13}}
| |
| | {{frac|1|91}}, {{frac|2|91}}, {{frac|3|91}}, {{frac|4|91}}, {{frac|5|91}}, {{frac|6|91}}, {{frac|8|91}}, {{frac|9|91}}, {{frac|10|91}}
| |
| |-
| |
| | 10
| |
| | No solution
| |
| | -
| |
| | -
| |
| |-
| |
| | 11
| |
| | 0112359550 5617977528 0898876404 4943820224 7191
| |
| | {{frac|1|89}} x 11 = {{frac|11|89}}
| |
| | {{frac|2|89}}, {{frac|3|89}}, {{frac|4|89}}, {{frac|5|89}}, {{frac|6|89}}, {{frac|7|89}}, {{frac|8|89}}
| |
| |-
| |
| | 12
| |
| | No solution
| |
| | -
| |
| | -
| |
| |-
| |
| | 13
| |
| | 0344827586 2068965517 24137931
| |
| | {{frac|1|29}} x 13 = {{frac|13|29}}
| |
| | {{frac|2|29}}
| |
| {{frac|1|87}}, {{frac|2|87}}, {{frac|4|87}}, {{frac|5|87}}, {{frac|6|87}}
| |
| |-
| |
| | 14
| |
| | 0232558139 5348837209 3
| |
| | {{frac|1|43}} x 14 = {{frac|14|43}}
| |
| | {{frac|2|43}}, {{frac|3|43}}
| |
| |-
| |
| | 15
| |
| | 0588235294117647
| |
| | {{frac|1|17}} x 15 = {{frac|15|17}}
| |
| | -
| |
| |}
| |
| | |
| ==Notes==
| |
| <references/>
| |
| | |
| == References ==
| |
| *P. Yiu, k-right-transposable integers, k-left-transposable integers Chap.18.1, 18.2 pp. 168/360 in 'Recreational Mathematics', http://www.math.fau.edu/yiu/RecreationalMathematics2003.pdf
| |
| *[[Clifford A. Pickover|C. A. Pickover]], ''Wonders of Numbers'', Chapter 28, [[Oxford University Press]] UK, 2000.
| |
| | |
| *{{SloanesRef |sequencenumber=A092697|name=For 1 <= n <= 9, a(n) = least number m such that the product n*m is obtained merely by shifting the rightmost digit of m to the left end}}
| |
| | |
| *Gardner, Martin. Mathematical Circus: More Puzzles, Games, Paradoxes and Other Mathematical Entertainments From Scientific American. New York: The Mathematical Association of America, 1979. pp. 111–122.
| |
| | |
| *Kalman, Dan; 'Fractions with Cycling Digit Patterns' The College Mathematics Journal, Vol. 27, No. 2. (Mar., 1996), pp. 109–115.
| |
| | |
| * Leslie, John. ''"The Philosophy of Arithmetic: Exhibiting a Progressive View of the Theory and Practice of ...."'', Longman, Hurst, Rees, Orme, and Brown, 1820, ISBN 1-4020-1546-1
| |
| | |
| *Wells, David; ''"[[The Penguin Dictionary of Curious and Interesting Numbers]]"'', Penguin Press. ISBN 0-14-008029-5
| |
| | |
| {{Classes of natural numbers}}
| |
| [[Category:Base-dependent integer sequences]]
| |