.\" Automatically generated by Pod::Man 2.28 (Pod::Simple 3.28) .\" .\" Standard preamble: .\" ======================================================================== .de Sp \" Vertical space (when we can't use .PP) .if t .sp .5v .if n .sp .. .de Vb \" Begin verbatim text .ft CW .nf .ne \\$1 .. .de Ve \" End verbatim text .ft R .fi .. .\" Set up some character translations and predefined strings. \*(-- will .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left .\" double quote, and \*(R" will give a right double quote. \*(C+ will .\" give a nicer C++. Capital omega is used to do unbreakable dashes and .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff, .\" nothing in troff, for use with C<>. .tr \(*W- .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' .ie n \{\ . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} .el\{\ . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' . ds C` . ds C' 'br\} .\" .\" Escape single quotes in literal strings from groff's Unicode transform. .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" .\" If the F register is turned on, we'll generate index entries on stderr for .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index .\" entries marked with X<> in POD. Of course, you'll have to process the .\" output yourself in some meaningful fashion. .\" .\" Avoid warning from groff about undefined register 'F'. .de IX .. .nr rF 0 .if \n(.g .if rF .nr rF 1 .if (\n(rF:(\n(.g==0)) \{ . if \nF \{ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . if !\nF==2 \{ . nr % 0 . nr F 2 . \} . \} .\} .rr rF .\" .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2). .\" Fear. Run. Save yourself. No user-serviceable parts. . \" fudge factors for nroff and troff .if n \{\ . ds #H 0 . ds #V .8m . ds #F .3m . ds #[ \f1 . ds #] \fP .\} .if t \{\ . ds #H ((1u-(\\\\n(.fu%2u))*.13m) . ds #V .6m . ds #F 0 . ds #[ \& . ds #] \& .\} . \" simple accents for nroff and troff .if n \{\ . ds ' \& . ds ` \& . ds ^ \& . ds , \& . ds ~ ~ . ds / .\} .if t \{\ . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u" . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u' . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u' . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u' . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u' . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u' .\} . \" troff and (daisy-wheel) nroff accents .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V' .ds 8 \h'\*(#H'\(*b\h'-\*(#H' .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#] .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H' .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u' .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#] .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#] .ds ae a\h'-(\w'a'u*4/10)'e .ds Ae A\h'-(\w'A'u*4/10)'E . \" corrections for vroff .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u' .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u' . \" for low resolution devices (crt and lpr) .if \n(.H>23 .if \n(.V>19 \ \{\ . ds : e . ds 8 ss . ds o a . ds d- d\h'-1'\(ga . ds D- D\h'-1'\(hy . ds th \o'bp' . ds Th \o'LP' . ds ae ae . ds Ae AE .\} .rm #[ #] #H #V #F C .\" ======================================================================== .\" .IX Title "Math::PlanePath::DivisibleColumns 3pm" .TH Math::PlanePath::DivisibleColumns 3pm "2014-06-14" "perl v5.20.1" "User Contributed Perl Documentation" .\" For nroff, turn off justification. Always turn off hyphenation; it makes .\" way too many mistakes in technical documents. .if n .ad l .nh .SH "NAME" Math::PlanePath::DivisibleColumns \-\- X divisible by Y in columns .SH "SYNOPSIS" .IX Header "SYNOPSIS" .Vb 3 \& use Math::PlanePath::DivisibleColumns; \& my $path = Math::PlanePath::DivisibleColumns\->new; \& my ($x, $y) = $path\->n_to_xy (123); .Ve .SH "DESCRIPTION" .IX Header "DESCRIPTION" This path visits points X,Y where X is divisible by Y going by columns from Y=1 to Y<=X. .PP .Vb 10 \& 18 | 57 \& 17 | 51 \& 16 | 49 \& 15 | 44 \& 14 | 40 \& 13 | 36 \& 12 | 34 \& 11 | 28 \& 10 | 26 \& 9 | 22 56 \& 8 | 19 48 \& 7 | 15 39 \& 6 | 13 33 55 \& 5 | 9 25 43 \& 4 | 7 18 32 47 \& 3 | 4 12 21 31 42 54 \& 2 | 2 6 11 17 24 30 38 46 53 \& 1 | 0 1 3 5 8 10 14 16 20 23 27 29 35 37 41 45 50 52 \& Y=0| \& +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\- \& X=0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 .Ve .PP Starting N=0 at X=1,Y=1 means the values 1,3,5,8,etc horizontally on Y=1 are the sums .PP .Vb 3 \& i=K \& sum numdivisors(i) \& i=1 .Ve .PP The current implementation is fairly slack and is slow on medium to large N. .SH "Proper Divisors" .IX Header "Proper Divisors" \&\f(CW\*(C`divisor_type => \*(Aqproper\*(Aq\*(C'\fR gives only proper divisors of X, meaning that Y=X itself is excluded. .PP .Vb 12 \& 9 | 39 \& 8 | 33 \& 7 | 26 \& 6 | 22 38 \& 5 | 16 29 \& 4 | 11 21 32 \& 3 | 7 13 20 28 37 \& 2 | 3 6 10 15 19 25 31 36 \& 1 | 0 1 2 4 5 8 9 12 14 17 18 23 24 27 30 34 35 \& Y=0| \& +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\- \& X=0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 .Ve .PP The pattern is the same, but the X=Y line skipped. The high line going up is at Y=X/2, when X is even, that being the highest proper divisor. .SS "N Start" .IX Subsection "N Start" The default is to number points starting N=0 as shown above. An optional \&\f(CW\*(C`n_start\*(C'\fR can give a different start with the same shape, For example to start at 1, .PP .Vb 1 \& n_start => 1 \& \& 9 | 23 \& 8 | 20 \& 7 | 16 \& 6 | 14 \& 5 | 10 \& 4 | 8 19 \& 3 | 5 13 22 \& 2 | 3 7 12 18 \& 1 | 1 2 4 6 9 11 15 17 21 \& Y=0| \& +\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\- \& X=0 1 2 3 4 5 6 7 8 9 .Ve .SH "FUNCTIONS" .IX Header "FUNCTIONS" See \*(L"\s-1FUNCTIONS\*(R"\s0 in Math::PlanePath for behaviour common to all path classes. .ie n .IP """$path = Math::PlanePath::DivisibleColumns\->new ()""" 4 .el .IP "\f(CW$path = Math::PlanePath::DivisibleColumns\->new ()\fR" 4 .IX Item "$path = Math::PlanePath::DivisibleColumns->new ()" .PD 0 .ie n .IP """$path = Math::PlanePath::DivisibleColumns\->new (divisor_type => $str, n_start => $n)""" 4 .el .IP "\f(CW$path = Math::PlanePath::DivisibleColumns\->new (divisor_type => $str, n_start => $n)\fR" 4 .IX Item "$path = Math::PlanePath::DivisibleColumns->new (divisor_type => $str, n_start => $n)" .PD Create and return a new path object. \f(CW\*(C`divisor_type\*(C'\fR (a string) can be .Sp .Vb 2 \& "all" (the default) \& "proper" .Ve .ie n .IP """($x,$y) = $path\->n_to_xy ($n)""" 4 .el .IP "\f(CW($x,$y) = $path\->n_to_xy ($n)\fR" 4 .IX Item "($x,$y) = $path->n_to_xy ($n)" Return the X,Y coordinates of point number \f(CW$n\fR on the path. Points begin at 0 and if \f(CW\*(C`$n < 0\*(C'\fR then the return is an empty list. .SH "FORMULAS" .IX Header "FORMULAS" .SS "Rectangle to N Range" .IX Subsection "Rectangle to N Range" The cumulative divisor count up to and including a given X column can be calculated from the fairly well-known sqrt formula, a sum from 1 to sqrt(X). .PP .Vb 4 \& S = floor(sqrt(X)) \& / i=S \e \& numdivs cumulative = 2 * | sum floor(X/i) | \- S^2 \& \e i=1 / .Ve .PP This means the N range for 0 to X can be calculated without working out all each column count up to X. In the current code if column counts have been worked out then they're used, otherwise this formula. .SH "OEIS" .IX Header "OEIS" This pattern is in Sloane's Online Encyclopedia of Integer Sequences in the following forms, .Sp .RS 4 (etc) .RE .PP .Vb 3 \& n_start=0 (the default) \& A006218 N on Y=1 row, cumulative count of divisors \& A077597 N on X=Y diagonal, cumulative count divisors \- 1 \& \& n_start=1 \& A061017 X coord, each n appears countdivisors(n) times \& A027750 Y coord, list divisors of successive k \& A056538 X/Y, divisors high to low \& \& divisor_type=proper (and default n_start=0) \& A027751 Y coord divisor_type=proper, divisors of successive n \& (extra initial 1) \& \& divisor_type=proper, n_start=2 \& A208460 X\-Y, being X subtract each proper divisor .Ve .PP A208460 has \*(L"offset\*(R" 2, hence \f(CW\*(C`n_start=2\*(C'\fR to match that. The same with all divisors would simply insert an extra 0 for the difference at X=Y. .SH "SEE ALSO" .IX Header "SEE ALSO" Math::PlanePath, Math::PlanePath::CoprimeColumns .SH "HOME PAGE" .IX Header "HOME PAGE" .SH "LICENSE" .IX Header "LICENSE" Copyright 2011, 2012, 2013, 2014 Kevin Ryde .PP Math-PlanePath is free software; you can redistribute it and/or modify it under the terms of the \s-1GNU\s0 General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. .PP Math-PlanePath is distributed in the hope that it will be useful, but \&\s-1WITHOUT ANY WARRANTY\s0; without even the implied warranty of \s-1MERCHANTABILITY\s0 or \s-1FITNESS FOR A PARTICULAR PURPOSE. \s0 See the \s-1GNU\s0 General Public License for more details. .PP You should have received a copy of the \s-1GNU\s0 General Public License along with Math-PlanePath. If not, see .