Congruence subgroup: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Promise her a definition
Modular group Γ(r): incorrect generalization from Γ(2)
en>David Eppstein
m Congruence subgroups of the Siegel modular group: mathrm and mathbf need brackets
 
Line 1: Line 1:
In [[mathematics]] a '''polydivisible number''' is a [[natural number|number]] with [[numerical digit|digits]] ''abcde...'' that has the following properties :
Teacher of the Reading Impaired Darell from The Pas, spends time with pursuits which include genealogy, new launch property singapore and trekkie. Completed a cruiseship experience that consisted of passing by Kunta Kinteh Island and Related Sites.<br><br>Look into my blog; [http://www.itexamtest.us/groups-2/singapore-condo-for-sale-apartment-new-launches-one-balmoral-city-resort-dleedon-sky-habitat-goodwood/ http://www.itexamtest.us/Groups-2/singapore-condo-for-sale-apartment-new-launches-One-balmoral-city-resort-dleedon-Sky-habitat-goodwood/]
 
# Its first digit ''a'' is not 0.
# The number formed by its first two digits ''ab'' is a multiple of 2.
# The number formed by its first three digits ''abc'' is a multiple of 3.
# The number formed by its first four digits ''abcd'' is a multiple of 4.
# etc.
 
For example, 345654 is a six-digit polydivisible number, but 123456 is not, because 1234 is not a multiple of 4. Polydivisible numbers can be defined in any [[radix|base]] - however, the numbers in this article are all in base 10, so permitted digits are 0 to 9.
 
The smallest base 10 polydivisible numbers with 1,2,3,4... etc. digits are
 
[[1 (number)|1]], [[10 (number)|10]], [[102 (number)|102]], 1020, 10200, 102000, 1020005, 10200056, 102000564, 1020005640 {{OEIS|id=A078282}}
 
==Background==
Polydivisible numbers are a generalisation of the following well-known problem in [[recreational mathematics]] :
 
: ''Arrange the digits 1 to 9 in order so that the first two digits form a multiple of 2, the first three digits form a multiple of 3, the first four digits form a multiple of 4 etc. and finally the entire number is a multiple of 9.''
 
The solution to the problem is a nine-digit polydivisible number with the additional condition that it contains the digits 1 to 9 exactly once each. There are 2,492 nine-digit polydivisible numbers, but the only one that satisfies the additional condition is
 
:'''381654729'''
 
==How many polydivisible numbers are there?==
If ''k'' is a polydivisible number with ''n''-1 digits, then it can be extended to create a polydivisible number with ''n'' digits if there is a number between 10''k'' and 10''k''+9 that is divisible by ''n''. If ''n'' is less or equal to 10, then it is always possible to extend an ''n''-1 digit polydivisible number to an ''n''-digit polydivisible number in this way, and indeed there may be more than one possible extension. If ''n'' is greater than 10, it is not always possible to extend a polydivisible number in this way, and as ''n'' becomes larger, the chances of being able to extend a given polydivisible number become smaller.
 
On average, each polydivisible number with ''n''-1 digits can be extended to a polydivisible number with ''n'' digits in 10/''n'' different ways. This leads to the following estimate of the number of ''n''-digit polydivisible numbers, which we will denote by ''F(n)'' :
 
:<math>F(n) \approx \frac{9 \times 10^{n-1}}{n!}</math>
 
Summing over all values of n, this estimate suggests that the total number of polydivisible numbers will be approximately
 
:<math>\frac{9(e^{10}-1)}{10}\approx 19823</math>
 
In fact, this underestimates the actual number of polydivisible numbers by about 3%.
 
==Counting polydivisible numbers==
We can find the actual values of ''F(n)'' by counting the number of polydivisible numbers with a given length :
 
[[Image:Graph of polydivisible number vectorial.svg|right|400px]]
 
<table border="1" cellpadding="2">
<tr><th>Length ''n''<th>F(''n'')<th>Estimate of F(''n'')<th><th>Length ''n''<th>F(''n'')<th>Estimate of F(''n'')<th><th>Length ''n''<th>F(''n'')<th>Estimate of F(''n'')
<tr><td>1<td>9<td>9<td><td>11<td>2225<td>2255<td><td>21<td>18<td>17
<tr><td>2<td>45<td>45<td><td>12<td>2041<td>1879<td><td>22<td>12<td>8
<tr><td>3<td>150<td>150<td><td>13<td>1575<td>1445<td><td>23<td>6<td>3
<tr><td>4<td>375<td>375<td><td>14<td>1132<td>1032<td><td>24<td>3<td>1
<tr><td>5<td>750<td>750<td><td>15<td>770<td>688<td><td>25<td>1<td>1
<tr><td>6<td>1200<td>1250<td><td>16<td>571<td>430<td>
<tr><td>7<td>1713<td>1786<td><td>17<td>335<td>253<td>
<tr><td>8<td>2227<td>2232<td><td>18<td>180<td>141<td>
<tr><td>9<td>2492<td>2480<td><td>19<td>90<td>74<td>
<tr><td>10<td>2492<td>2480<td><td>20<td>44<td>37<td>
</table>
 
There are 20,456 polydivisible numbers altogether, and the longest polydivisible number, which has 25 digits, is :
 
:'''360 852 885 036 840 078 603 672 5'''
 
==Related problems==
Other problems involving polydivisible numbers include :
 
* Finding polydivisible numbers with additional restrictions on the digits - for example, the longest polydivisible number that only uses even digits is
 
:'''480 006 882 084 660 840 40'''
 
* Finding [[palindromic number|palindromic]] polydivisible numbers - for example, the longest palindromic polydivisible number is
 
:'''300 006 000 03'''
 
* Enumerating polydivisible numbers in other bases.
 
==External links==
* [http://jwilson.coe.uga.edu/emt725/Class/Lanier/Nine.Digit/nine.html The nine-digit problem and its solution]
* [http://www.filmshuren.nl/randomstuff/polydivisiblenumbers.txt A list of all 20,456 polydivisible numbers]
{{Classes of natural numbers}}
[[Category:Base-dependent integer sequences]]

Latest revision as of 07:06, 6 November 2014

Teacher of the Reading Impaired Darell from The Pas, spends time with pursuits which include genealogy, new launch property singapore and trekkie. Completed a cruiseship experience that consisted of passing by Kunta Kinteh Island and Related Sites.

Look into my blog; http://www.itexamtest.us/Groups-2/singapore-condo-for-sale-apartment-new-launches-One-balmoral-city-resort-dleedon-Sky-habitat-goodwood/