Skip to main content

factorization - Find the a factor of an integer which is nearest to another integer


If I know two integers $n$ and $m$ and $m < n$, how can I find two different integers $x$ and $y$ that are nearest to $m$, and satisfy Mod[n,x]==Mod[n,y]==0 ?


For example,


f[720,8] ==> {8,9}
f[720,20] ==> {18,20}

If $n$ is small, we can brute force to test whether an integer is a factor of $n$, and find the nearest two of the factors:



twoNear[n_Integer, m_Integer] := Module[{ls, sortls},
ls = Select[Range[1, n], Mod[n, #] == 0 &];
sortls = Sort[Transpose[{ls - m, ls}], Abs[#1[[1]]] < Abs[#2[[1]]] &];
Sort@sortls[[1 ;; 2, 2]]
]

twoNear[720,8]
twoNear[720,20]
(*{8, 9}*)
(*{18, 20}*)


but how to deal with problems such as n=20!, m=1*^9 , n=40!,m=1*^20 ?



Answer



My lucky day (night). I get to take my own answer which was of dubious value here and basically repurpose it to give a good response to this question.


We set this up as a mixed linear program by trying to get sums of logs of factors as close to m as possible, subject to coefficients being nonnegative integers that do not exceed the powers of the corresponding factors. There is an added complication in that we need not just the optimal value but also the next best.


So here we go.


nearDivisors[n_, m_] := Module[
{fax = FactorInteger[n], prec, logs, maxes, len, c, coeffs, c1, c2,
c3, diff, epsilon, constraints, vars, min, vals, res1, res2, res3,
newproblems, equalities, best},

prec = Max[20, Log[10., m]];
logs = Log[N[fax[[All, 1]], prec]];
maxes = fax[[All, 2]];
len = Length[fax];
coeffs = Array[c, len];
c1 = Table[0 <= c[j] <= maxes[[j]], {j, len}];
diff = coeffs.logs - Log[m];
c2 = {diff <= epsilon, -diff <= epsilon};
c3 = Element[coeffs, Integers];
constraints = Join[c1, c2, {c3}];

vars = Join[coeffs, {epsilon}];
{min, vals} = FindMinimum[{epsilon, constraints}, vars];
res1 = Round[Exp[coeffs.logs /. vals]];
vals = coeffs /. vals;
newproblems = Flatten[Table[
equalities = Table[c[k] == vals[[k]], {k, j - 1}];
{Join[constraints, equalities, {c[j] <= vals[[j]] - 1}],
Join[constraints, equalities, {c[j] >= vals[[j]] + 1}]}
, {j, len}], 1];
best = Infinity;

Do[min =
Quiet[FindMinimum[{epsilon, newproblems[[j]]}, vars,
WorkingPrecision -> prec]];
If[Head[min] =!= FindMinimum,
If[min[[1]] < best,
best = min[[1]];
res2 = Round[Exp[coeffs.logs /. min[[2]]]];
]
], {j, Length[newproblems]}];
{res1, res2}

]

Here are the now-standard benchmark tests. We also check that we used adequate precision so that we can accurately recover the results.


Timing[ndsmall = nearDivisors[20!, 10^9]]

(* Out[967]= {1.840000, {999949860, 1000194048}} *)

20!/ndsmall

(* Out[968]= {2433024000, 2432430000} *)


Timing[ndmiddle = nearDivisors[30!, 10^9]]

(* Out[971]= {20.350000, {999949860, 1000065000}} *)

30!/ndmiddle

(* Out[972]= {265266160257466368000000, 265235619496923758592000} *)

Now we get ambitious.



Timing[ndbig = nearDivisors[40!, 10^20]]

(* Out[969]= {41.020000, {99999622686575390625, 100000079233442099712}} *)

40!/ndbig

(* Out[970]= {8159183618174107243291607040, 8159146367706464256000000000} *)

--- edit ---


Okay, why not...



Timing[ndbigger = nearDivisors[80!, 10^20]]
(* Out[1017]= {2070.830000, {100000004179992913920,
100000028588579559040}} *)

80!/ndbigger

(* Out[1018]= \
{715694540546656942785553897344003751254098684983349359903188074751331\
095778689024000000000000000000, \
7156943658557848407002572034351080637013939631522009525004233001820750\

27228721152000000000000000000} *)

--- end edit ---


Comments

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...

calculus and analysis - Integral of the Sinc product

Let us consider the following integral $$ B_n = \int_0^\infty \prod_{k=1,3,5,\dots}^n\frac{\sin (x/k)}{x/k}dx $$ By definition, Sinc[x] == Sin[x]/x , therefore B[n_?OddQ] := Integrate[Product[Sinc[x/k], {k, 1, n, 2}], {x, 0, Infinity}] B /@ Range[1, 13, 2] {Pi/2, Pi/2, Pi/2, Pi/2, Pi/2, Pi/2, Pi/2} OK, everything is fine. But... B[15] 467807924713440738696537864469 Pi/935615849440640907310521750000 What's going on? Answer As Eckhard wrote in comments B[n] is the n-th Borwein integral . (The letter B was not accidental :) ) This funny properties of Borwein integrals is related to the Fourier transform of Sinc function FourierTransform[Sinc[x], x, k] 1/2 Sqrt[Pi/2] (Sign[1 - k] + Sign[1 + k]) Plot[%, {k, -2, 2}, Filling -> 0] which is the box function. The result is $\pi/2$ while the sum $$ 1/3+1/5+\dots+1/n $$ B_n = \frac{\pi}{2} - \pi \bigg(\sum_{k=3,5,\ldots}^n\frac{1}{k} -1\biggr)^\frac{n-1}{2}\prod_{k=3,5,\dots}^n\frac{k}{k-1}. $$ For $n=15$ it is equal to $$ \frac{46780...

list manipulation - Selecting multiple columns from a matrix?

Sample data: data = { {{2013, 1, 1}, 24.13, 167.67, 231.82}, {{2013, 1, 2}, 32.15, 170.92, 225.99}, {{2013, 1, 3}, 35.43, 172.68, 221.67}, {{2013, 1, 4}, 36.73, 173.05, 218.32}, {{2013, 1, 5}, 58.19, 165.96, 197.05}, {{2013, 1, 6}, 69.99, 163.50, 187.52}, {{2013, 1, 7}, 71.37, 154.21, 175.58}, {{2013, 1, 8}, 72.51, 149.66, 163.25}}; I want a DateListPlot with three graphs, so for a matrix formed by columns 1 and 2, one for columns 1 and 3, and 1 for columns 1 and 4. At the moment I'm using this code: data2 = Transpose[{data[[All, 1]], data[[All, 2]]}]; data3 = Transpose[{data[[All, 1]], data[[All, 3]]}]; data4 = Transpose[{data[[All, 1]], data[[All, 4]]}]; DateListPlot[{data2, data3, data4}, Joined -> True, Filling -> {3 -> {1}}] but I have a hunch that this can be done more efficiently. I don't like the Transpose s in particular. Any ideas? edit (for extra credit) What if I need to multiply the second column by 2, which in my solution is simp...