Reasoning about factorials: is this equation correct?
up vote
2
down vote
favorite
I was playing around with the möbius inversion formula and factorials and I came up with an equation that I found interesting:
$$prod_{ige2}leftlfloorfrac{x}{i}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
I'm not sure if this equation is valid.
Here is the reasoning:
(1) Let $text{lcm}(x) = $ the least common multiple of ${1, 2, 3, dots, x}$
(2) Using a well known equation:
$$x! = prod_{i ge 1}text{lcm}left(leftlfloorfrac{x}{i}rightrfloorright)$$
(3) Using mobius inversion, I believe that this is now valid:
$$text{lcm}(x) = prod_{i ge 1}left(leftlfloorfrac{x}{i}rightrfloor!right)^{mu(i)}$$
(4) Combining the two equations gets me to:
$$x! = prod_{j ge 1}prod_{i ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(5) Since order of the products doesn't matter:
$$x! = prod_{i ge 1}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(6) Since for $i=1,j=1$, $x! = left(frac{x}{ij}!right)^{mu(i)}$:
$$1 = prod_{i ge 1}prod_{j ge 1text{ and }jne1text{ if }i=1 }left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(7) We can now use division to separate the remaining cases of $i=1$ so that we get:
$$prod_{j ge 2}leftlfloorfrac{x}{j}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
Is this equation correct? And if correct, is it well known?
proof-verification factorial least-common-multiple mobius-inversion
This question has an open bounty worth +50
reputation from Larry Freeman ending in 3 days.
Looking for an answer drawing from credible and/or official sources.
Would love to know if this is true and if it is true, if it is well known. If this is not valid, is there a similar equation for factorials? In other words, can this equation be corrected to become valid?
add a comment |
up vote
2
down vote
favorite
I was playing around with the möbius inversion formula and factorials and I came up with an equation that I found interesting:
$$prod_{ige2}leftlfloorfrac{x}{i}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
I'm not sure if this equation is valid.
Here is the reasoning:
(1) Let $text{lcm}(x) = $ the least common multiple of ${1, 2, 3, dots, x}$
(2) Using a well known equation:
$$x! = prod_{i ge 1}text{lcm}left(leftlfloorfrac{x}{i}rightrfloorright)$$
(3) Using mobius inversion, I believe that this is now valid:
$$text{lcm}(x) = prod_{i ge 1}left(leftlfloorfrac{x}{i}rightrfloor!right)^{mu(i)}$$
(4) Combining the two equations gets me to:
$$x! = prod_{j ge 1}prod_{i ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(5) Since order of the products doesn't matter:
$$x! = prod_{i ge 1}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(6) Since for $i=1,j=1$, $x! = left(frac{x}{ij}!right)^{mu(i)}$:
$$1 = prod_{i ge 1}prod_{j ge 1text{ and }jne1text{ if }i=1 }left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(7) We can now use division to separate the remaining cases of $i=1$ so that we get:
$$prod_{j ge 2}leftlfloorfrac{x}{j}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
Is this equation correct? And if correct, is it well known?
proof-verification factorial least-common-multiple mobius-inversion
This question has an open bounty worth +50
reputation from Larry Freeman ending in 3 days.
Looking for an answer drawing from credible and/or official sources.
Would love to know if this is true and if it is true, if it is well known. If this is not valid, is there a similar equation for factorials? In other words, can this equation be corrected to become valid?
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
I was playing around with the möbius inversion formula and factorials and I came up with an equation that I found interesting:
$$prod_{ige2}leftlfloorfrac{x}{i}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
I'm not sure if this equation is valid.
Here is the reasoning:
(1) Let $text{lcm}(x) = $ the least common multiple of ${1, 2, 3, dots, x}$
(2) Using a well known equation:
$$x! = prod_{i ge 1}text{lcm}left(leftlfloorfrac{x}{i}rightrfloorright)$$
(3) Using mobius inversion, I believe that this is now valid:
$$text{lcm}(x) = prod_{i ge 1}left(leftlfloorfrac{x}{i}rightrfloor!right)^{mu(i)}$$
(4) Combining the two equations gets me to:
$$x! = prod_{j ge 1}prod_{i ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(5) Since order of the products doesn't matter:
$$x! = prod_{i ge 1}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(6) Since for $i=1,j=1$, $x! = left(frac{x}{ij}!right)^{mu(i)}$:
$$1 = prod_{i ge 1}prod_{j ge 1text{ and }jne1text{ if }i=1 }left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(7) We can now use division to separate the remaining cases of $i=1$ so that we get:
$$prod_{j ge 2}leftlfloorfrac{x}{j}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
Is this equation correct? And if correct, is it well known?
proof-verification factorial least-common-multiple mobius-inversion
I was playing around with the möbius inversion formula and factorials and I came up with an equation that I found interesting:
$$prod_{ige2}leftlfloorfrac{x}{i}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
I'm not sure if this equation is valid.
Here is the reasoning:
(1) Let $text{lcm}(x) = $ the least common multiple of ${1, 2, 3, dots, x}$
(2) Using a well known equation:
$$x! = prod_{i ge 1}text{lcm}left(leftlfloorfrac{x}{i}rightrfloorright)$$
(3) Using mobius inversion, I believe that this is now valid:
$$text{lcm}(x) = prod_{i ge 1}left(leftlfloorfrac{x}{i}rightrfloor!right)^{mu(i)}$$
(4) Combining the two equations gets me to:
$$x! = prod_{j ge 1}prod_{i ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(5) Since order of the products doesn't matter:
$$x! = prod_{i ge 1}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(6) Since for $i=1,j=1$, $x! = left(frac{x}{ij}!right)^{mu(i)}$:
$$1 = prod_{i ge 1}prod_{j ge 1text{ and }jne1text{ if }i=1 }left(leftlfloorfrac{x}{ij}rightrfloor!right)^{mu(i)}$$
(7) We can now use division to separate the remaining cases of $i=1$ so that we get:
$$prod_{j ge 2}leftlfloorfrac{x}{j}rightrfloor! = prod_{i ge 2}prod_{j ge 1}left(leftlfloorfrac{x}{ij}rightrfloor!right)^{-mu(i)}$$
Is this equation correct? And if correct, is it well known?
proof-verification factorial least-common-multiple mobius-inversion
proof-verification factorial least-common-multiple mobius-inversion
edited Nov 10 at 18:06
asked Nov 10 at 17:59
Larry Freeman
3,23021239
3,23021239
This question has an open bounty worth +50
reputation from Larry Freeman ending in 3 days.
Looking for an answer drawing from credible and/or official sources.
Would love to know if this is true and if it is true, if it is well known. If this is not valid, is there a similar equation for factorials? In other words, can this equation be corrected to become valid?
This question has an open bounty worth +50
reputation from Larry Freeman ending in 3 days.
Looking for an answer drawing from credible and/or official sources.
Would love to know if this is true and if it is true, if it is well known. If this is not valid, is there a similar equation for factorials? In other words, can this equation be corrected to become valid?
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2992908%2freasoning-about-factorials-is-this-equation-correct%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown