Tag Info

New answers tagged

1

Here's my approach using replacement rule /. Sum[r^p_. a__, b_] :> r^p Sum[Times[a], b]. I have a hunch that there's a built in function that could accomplish this but I can't seem to find it. I've also made some modifications to your code: 1) Changing the first function to β to avoid clashing with the subscripted symbol α. 2) Changing the upper limit ...


0

The following function splits m=Binomial[n,k] into one or two parts whose product is m. The parts satisfy the conditions you specified, to the best of my understanding. UVfactors[n_, k_] := With[{f = FactorInteger[Binomial[n, k]]}, Print[Binomial[n, k]]; Print[f]; Apply[Times, Map[#[[All,1]]^#[[All,2]]&, SplitBy[f, ...


3

@asad the comments are all appropriate and (if I understand your aim), I present a way to implement to perhaps kickstart your own approach. However, I suggest in future you post an attempt, however imperfect. Further, it is helpful to post a small example so people can be clear about what you mean. Finally, if I misunderstand your aim then comment, otherwise ...



Top 50 recent answers are included