Factor $10^n -1$
$begingroup$
There is an identity or quick way to factor problems of the form $c^x -1$ e.g. $10^n-1$, what is it?
I mean that it can be represented in some way as multiple factors,e.g. $(x-a)(y-b)$, there is a way to expand the difference easily.
algebra-precalculus factoring
$endgroup$
add a comment |
$begingroup$
There is an identity or quick way to factor problems of the form $c^x -1$ e.g. $10^n-1$, what is it?
I mean that it can be represented in some way as multiple factors,e.g. $(x-a)(y-b)$, there is a way to expand the difference easily.
algebra-precalculus factoring
$endgroup$
$begingroup$
For $10^n-1$, $9$ is a factor of it.
$endgroup$
– Kemono Chen
Dec 7 '18 at 6:47
$begingroup$
Well, for $10^n - 1$, try a few $n$. You'll notice that every such number is a repdigit, all $9$'s, and thus clearly divisible by $9$, with a factor that's a repdigit of $1$'s. I'm not sure about factoring the new repdigit, though. Or about bases other than $10$, either.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:48
1
$begingroup$
Another thing that comes to mind is that it might not always be factorable. For example, take $c=2$. Some such numbers exist of the form $2^n - 1$ which are prime: they are known as Mersenne primes.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:49
1
$begingroup$
Addressing your edit, one way you could factor for even $n$ would be the difference of two squares. If $n$ is even, then $$(c^n - 1) = (c^{n/2} - 1)(c^{n/2} + 1)$$ Not sure about odd $n$. Sorry if I'm being unhelpful, I'm kinda spitballing here.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:51
add a comment |
$begingroup$
There is an identity or quick way to factor problems of the form $c^x -1$ e.g. $10^n-1$, what is it?
I mean that it can be represented in some way as multiple factors,e.g. $(x-a)(y-b)$, there is a way to expand the difference easily.
algebra-precalculus factoring
$endgroup$
There is an identity or quick way to factor problems of the form $c^x -1$ e.g. $10^n-1$, what is it?
I mean that it can be represented in some way as multiple factors,e.g. $(x-a)(y-b)$, there is a way to expand the difference easily.
algebra-precalculus factoring
algebra-precalculus factoring
edited Dec 7 '18 at 6:50
Danielle
asked Dec 7 '18 at 6:46
DanielleDanielle
2179
2179
$begingroup$
For $10^n-1$, $9$ is a factor of it.
$endgroup$
– Kemono Chen
Dec 7 '18 at 6:47
$begingroup$
Well, for $10^n - 1$, try a few $n$. You'll notice that every such number is a repdigit, all $9$'s, and thus clearly divisible by $9$, with a factor that's a repdigit of $1$'s. I'm not sure about factoring the new repdigit, though. Or about bases other than $10$, either.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:48
1
$begingroup$
Another thing that comes to mind is that it might not always be factorable. For example, take $c=2$. Some such numbers exist of the form $2^n - 1$ which are prime: they are known as Mersenne primes.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:49
1
$begingroup$
Addressing your edit, one way you could factor for even $n$ would be the difference of two squares. If $n$ is even, then $$(c^n - 1) = (c^{n/2} - 1)(c^{n/2} + 1)$$ Not sure about odd $n$. Sorry if I'm being unhelpful, I'm kinda spitballing here.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:51
add a comment |
$begingroup$
For $10^n-1$, $9$ is a factor of it.
$endgroup$
– Kemono Chen
Dec 7 '18 at 6:47
$begingroup$
Well, for $10^n - 1$, try a few $n$. You'll notice that every such number is a repdigit, all $9$'s, and thus clearly divisible by $9$, with a factor that's a repdigit of $1$'s. I'm not sure about factoring the new repdigit, though. Or about bases other than $10$, either.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:48
1
$begingroup$
Another thing that comes to mind is that it might not always be factorable. For example, take $c=2$. Some such numbers exist of the form $2^n - 1$ which are prime: they are known as Mersenne primes.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:49
1
$begingroup$
Addressing your edit, one way you could factor for even $n$ would be the difference of two squares. If $n$ is even, then $$(c^n - 1) = (c^{n/2} - 1)(c^{n/2} + 1)$$ Not sure about odd $n$. Sorry if I'm being unhelpful, I'm kinda spitballing here.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:51
$begingroup$
For $10^n-1$, $9$ is a factor of it.
$endgroup$
– Kemono Chen
Dec 7 '18 at 6:47
$begingroup$
For $10^n-1$, $9$ is a factor of it.
$endgroup$
– Kemono Chen
Dec 7 '18 at 6:47
$begingroup$
Well, for $10^n - 1$, try a few $n$. You'll notice that every such number is a repdigit, all $9$'s, and thus clearly divisible by $9$, with a factor that's a repdigit of $1$'s. I'm not sure about factoring the new repdigit, though. Or about bases other than $10$, either.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:48
$begingroup$
Well, for $10^n - 1$, try a few $n$. You'll notice that every such number is a repdigit, all $9$'s, and thus clearly divisible by $9$, with a factor that's a repdigit of $1$'s. I'm not sure about factoring the new repdigit, though. Or about bases other than $10$, either.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:48
1
1
$begingroup$
Another thing that comes to mind is that it might not always be factorable. For example, take $c=2$. Some such numbers exist of the form $2^n - 1$ which are prime: they are known as Mersenne primes.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:49
$begingroup$
Another thing that comes to mind is that it might not always be factorable. For example, take $c=2$. Some such numbers exist of the form $2^n - 1$ which are prime: they are known as Mersenne primes.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:49
1
1
$begingroup$
Addressing your edit, one way you could factor for even $n$ would be the difference of two squares. If $n$ is even, then $$(c^n - 1) = (c^{n/2} - 1)(c^{n/2} + 1)$$ Not sure about odd $n$. Sorry if I'm being unhelpful, I'm kinda spitballing here.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:51
$begingroup$
Addressing your edit, one way you could factor for even $n$ would be the difference of two squares. If $n$ is even, then $$(c^n - 1) = (c^{n/2} - 1)(c^{n/2} + 1)$$ Not sure about odd $n$. Sorry if I'm being unhelpful, I'm kinda spitballing here.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:51
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Okay so I did find something interesting after my rambling in the comments. It comes from here.
Suppose we have a difference of two $(n+1)$-th powers, $(x^{n+1} - y^{n+1})$. Then
$$(x^{n+1} - y^{n+1}) = (x-y)(x^n + x^{n-1}y + x^{n-2}y^2 + ... + xy^{n-1} + y^n)$$
Take $y=1$ as in your case, OP. Then $y^n = 1$ for all $n$ and
$$(x^{n+1} - 1) = (x-1)(x^n + x^{n-1} + x^{n-2} + ... + x + 1)$$
More compactly,
$$(x^{n+1} - 1) = (x-1)left( sum_{k=0}^n x^k right)$$
We make the assumption that $n$ is a positive integer, by the way, and $x,y$ are real numbers.
The summation won't be factorable in any meaningful way, though, at least as far as I know. For example, consider $n=2$. Then,
$$(x^3 - 1) = (x-1)(x^2 + x + 1)$$
We can't really factorize the quadratic on the right meaningfully without also solving for its roots, which I feel kinda defeats the purpose of this. Especially since, for I think it's fifth degree polynomials onwards, we can't solve for the roots easily, unlike the cubic/quadratic formulas.
That's not to say that the quadratic won't be factorizable for specific $x$. For example, I made WolframAlpha calculate the value of the quadratic for $x = 1, 2, 3, ..., 100$ and we see some composite numbers there. So there might be more to be said when it comes to factorizing in specific instances of $(x^3 - 1)$, for example, but not much in general.
$endgroup$
$begingroup$
If $n+1$ is composite, you actually can factor the sum. Of course, this doesn’t actually help you too much if you want the full prime factorization, but it helps break it down a bit
$endgroup$
– platty
Dec 8 '18 at 0:26
add a comment |
$begingroup$
Note that $a^n-b^n$ is a multiple of $a⁻b$.
And if $n$ is eben, then also $a+bmid a^n-b^n$
Hence for any $dmid n$, $10^d-1$ divides $10^n-1$; and if $n/d$ is even, also $10^d+1$ divides $10^n-1$
$endgroup$
add a comment |
$begingroup$
Since it’s subtraction, you could use the difference of two squares I suppose.
$$a^2-b^2 = (a+b)(a-b) implies a^c-b^c = big(a^{frac{c}{2}}+b^{frac{c}{2}}big)big(a^{frac{c}{2}}-b^{frac{c}{2}}big)$$
In this case, you have $b = 1$, so the factorization is
$$big(c^{frac{x}{2}}+1big)big(c^{frac{x}{2}}-1big) implies (10^5+1)(10^5-1)$$
A more commonly used idea is factoring the difference of $n^{th}$ powers for all $n$ and the sum of $n^{th}$ powers for all odd $n$ (which isn’t relevant but is very similar to the former).
$$a^n-b^n = (a-b)(a^{n-1}+a^{n-2}b+a^{n-3}b^2+…+a^2b^{n-3}+ab^{n-2}+b^{n-1})$$
This works because through expansion because multiplying $a$ to each term is canceled by multiplying $b$ to the term before it, which leaves only the first term for $a$ and the last term for $b$.
$$ = underbrace{a^ncolor{blue}{+a^{n-1}b+a^{n-2}b^2+…+a^3b^{n-3}+a^2b^{n-2}+ab^{n-1}}}_{a(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}underbrace{color{red}{-a^{n-1}b-a^{n-2}b^2-a^{n-3}b^3-…-a^2b^{n-2}-ab^{n-1}}-b^n}_{-b(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}$$
$$= a^n-b^n$$
So, for instance, you can factor your example as follows:
$$10^n-1 = (10-1)(10^{n-1}+10^{n-2}+10^{n-3}+…+1)$$
which also bears striking resemblance to the geometric series if written as $frac{10^n-1}{10-1} = 1+10+10^2+…+10^{n-1}$.
As a side note, you can use
$$(a+b)(a^{n-1}-a^{n-2}b+a^{n-3}b^2-a^{n-4}b^3+…+b^{n-1})$$
to factor the sum of $n^{th}$ powers, but this only works for an odd $n$.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f3029574%2ffactor-10n-1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Okay so I did find something interesting after my rambling in the comments. It comes from here.
Suppose we have a difference of two $(n+1)$-th powers, $(x^{n+1} - y^{n+1})$. Then
$$(x^{n+1} - y^{n+1}) = (x-y)(x^n + x^{n-1}y + x^{n-2}y^2 + ... + xy^{n-1} + y^n)$$
Take $y=1$ as in your case, OP. Then $y^n = 1$ for all $n$ and
$$(x^{n+1} - 1) = (x-1)(x^n + x^{n-1} + x^{n-2} + ... + x + 1)$$
More compactly,
$$(x^{n+1} - 1) = (x-1)left( sum_{k=0}^n x^k right)$$
We make the assumption that $n$ is a positive integer, by the way, and $x,y$ are real numbers.
The summation won't be factorable in any meaningful way, though, at least as far as I know. For example, consider $n=2$. Then,
$$(x^3 - 1) = (x-1)(x^2 + x + 1)$$
We can't really factorize the quadratic on the right meaningfully without also solving for its roots, which I feel kinda defeats the purpose of this. Especially since, for I think it's fifth degree polynomials onwards, we can't solve for the roots easily, unlike the cubic/quadratic formulas.
That's not to say that the quadratic won't be factorizable for specific $x$. For example, I made WolframAlpha calculate the value of the quadratic for $x = 1, 2, 3, ..., 100$ and we see some composite numbers there. So there might be more to be said when it comes to factorizing in specific instances of $(x^3 - 1)$, for example, but not much in general.
$endgroup$
$begingroup$
If $n+1$ is composite, you actually can factor the sum. Of course, this doesn’t actually help you too much if you want the full prime factorization, but it helps break it down a bit
$endgroup$
– platty
Dec 8 '18 at 0:26
add a comment |
$begingroup$
Okay so I did find something interesting after my rambling in the comments. It comes from here.
Suppose we have a difference of two $(n+1)$-th powers, $(x^{n+1} - y^{n+1})$. Then
$$(x^{n+1} - y^{n+1}) = (x-y)(x^n + x^{n-1}y + x^{n-2}y^2 + ... + xy^{n-1} + y^n)$$
Take $y=1$ as in your case, OP. Then $y^n = 1$ for all $n$ and
$$(x^{n+1} - 1) = (x-1)(x^n + x^{n-1} + x^{n-2} + ... + x + 1)$$
More compactly,
$$(x^{n+1} - 1) = (x-1)left( sum_{k=0}^n x^k right)$$
We make the assumption that $n$ is a positive integer, by the way, and $x,y$ are real numbers.
The summation won't be factorable in any meaningful way, though, at least as far as I know. For example, consider $n=2$. Then,
$$(x^3 - 1) = (x-1)(x^2 + x + 1)$$
We can't really factorize the quadratic on the right meaningfully without also solving for its roots, which I feel kinda defeats the purpose of this. Especially since, for I think it's fifth degree polynomials onwards, we can't solve for the roots easily, unlike the cubic/quadratic formulas.
That's not to say that the quadratic won't be factorizable for specific $x$. For example, I made WolframAlpha calculate the value of the quadratic for $x = 1, 2, 3, ..., 100$ and we see some composite numbers there. So there might be more to be said when it comes to factorizing in specific instances of $(x^3 - 1)$, for example, but not much in general.
$endgroup$
$begingroup$
If $n+1$ is composite, you actually can factor the sum. Of course, this doesn’t actually help you too much if you want the full prime factorization, but it helps break it down a bit
$endgroup$
– platty
Dec 8 '18 at 0:26
add a comment |
$begingroup$
Okay so I did find something interesting after my rambling in the comments. It comes from here.
Suppose we have a difference of two $(n+1)$-th powers, $(x^{n+1} - y^{n+1})$. Then
$$(x^{n+1} - y^{n+1}) = (x-y)(x^n + x^{n-1}y + x^{n-2}y^2 + ... + xy^{n-1} + y^n)$$
Take $y=1$ as in your case, OP. Then $y^n = 1$ for all $n$ and
$$(x^{n+1} - 1) = (x-1)(x^n + x^{n-1} + x^{n-2} + ... + x + 1)$$
More compactly,
$$(x^{n+1} - 1) = (x-1)left( sum_{k=0}^n x^k right)$$
We make the assumption that $n$ is a positive integer, by the way, and $x,y$ are real numbers.
The summation won't be factorable in any meaningful way, though, at least as far as I know. For example, consider $n=2$. Then,
$$(x^3 - 1) = (x-1)(x^2 + x + 1)$$
We can't really factorize the quadratic on the right meaningfully without also solving for its roots, which I feel kinda defeats the purpose of this. Especially since, for I think it's fifth degree polynomials onwards, we can't solve for the roots easily, unlike the cubic/quadratic formulas.
That's not to say that the quadratic won't be factorizable for specific $x$. For example, I made WolframAlpha calculate the value of the quadratic for $x = 1, 2, 3, ..., 100$ and we see some composite numbers there. So there might be more to be said when it comes to factorizing in specific instances of $(x^3 - 1)$, for example, but not much in general.
$endgroup$
Okay so I did find something interesting after my rambling in the comments. It comes from here.
Suppose we have a difference of two $(n+1)$-th powers, $(x^{n+1} - y^{n+1})$. Then
$$(x^{n+1} - y^{n+1}) = (x-y)(x^n + x^{n-1}y + x^{n-2}y^2 + ... + xy^{n-1} + y^n)$$
Take $y=1$ as in your case, OP. Then $y^n = 1$ for all $n$ and
$$(x^{n+1} - 1) = (x-1)(x^n + x^{n-1} + x^{n-2} + ... + x + 1)$$
More compactly,
$$(x^{n+1} - 1) = (x-1)left( sum_{k=0}^n x^k right)$$
We make the assumption that $n$ is a positive integer, by the way, and $x,y$ are real numbers.
The summation won't be factorable in any meaningful way, though, at least as far as I know. For example, consider $n=2$. Then,
$$(x^3 - 1) = (x-1)(x^2 + x + 1)$$
We can't really factorize the quadratic on the right meaningfully without also solving for its roots, which I feel kinda defeats the purpose of this. Especially since, for I think it's fifth degree polynomials onwards, we can't solve for the roots easily, unlike the cubic/quadratic formulas.
That's not to say that the quadratic won't be factorizable for specific $x$. For example, I made WolframAlpha calculate the value of the quadratic for $x = 1, 2, 3, ..., 100$ and we see some composite numbers there. So there might be more to be said when it comes to factorizing in specific instances of $(x^3 - 1)$, for example, but not much in general.
edited Dec 7 '18 at 7:08
answered Dec 7 '18 at 6:56
Eevee TrainerEevee Trainer
5,4431936
5,4431936
$begingroup$
If $n+1$ is composite, you actually can factor the sum. Of course, this doesn’t actually help you too much if you want the full prime factorization, but it helps break it down a bit
$endgroup$
– platty
Dec 8 '18 at 0:26
add a comment |
$begingroup$
If $n+1$ is composite, you actually can factor the sum. Of course, this doesn’t actually help you too much if you want the full prime factorization, but it helps break it down a bit
$endgroup$
– platty
Dec 8 '18 at 0:26
$begingroup$
If $n+1$ is composite, you actually can factor the sum. Of course, this doesn’t actually help you too much if you want the full prime factorization, but it helps break it down a bit
$endgroup$
– platty
Dec 8 '18 at 0:26
$begingroup$
If $n+1$ is composite, you actually can factor the sum. Of course, this doesn’t actually help you too much if you want the full prime factorization, but it helps break it down a bit
$endgroup$
– platty
Dec 8 '18 at 0:26
add a comment |
$begingroup$
Note that $a^n-b^n$ is a multiple of $a⁻b$.
And if $n$ is eben, then also $a+bmid a^n-b^n$
Hence for any $dmid n$, $10^d-1$ divides $10^n-1$; and if $n/d$ is even, also $10^d+1$ divides $10^n-1$
$endgroup$
add a comment |
$begingroup$
Note that $a^n-b^n$ is a multiple of $a⁻b$.
And if $n$ is eben, then also $a+bmid a^n-b^n$
Hence for any $dmid n$, $10^d-1$ divides $10^n-1$; and if $n/d$ is even, also $10^d+1$ divides $10^n-1$
$endgroup$
add a comment |
$begingroup$
Note that $a^n-b^n$ is a multiple of $a⁻b$.
And if $n$ is eben, then also $a+bmid a^n-b^n$
Hence for any $dmid n$, $10^d-1$ divides $10^n-1$; and if $n/d$ is even, also $10^d+1$ divides $10^n-1$
$endgroup$
Note that $a^n-b^n$ is a multiple of $a⁻b$.
And if $n$ is eben, then also $a+bmid a^n-b^n$
Hence for any $dmid n$, $10^d-1$ divides $10^n-1$; and if $n/d$ is even, also $10^d+1$ divides $10^n-1$
answered Dec 7 '18 at 6:53
Hagen von EitzenHagen von Eitzen
277k22269496
277k22269496
add a comment |
add a comment |
$begingroup$
Since it’s subtraction, you could use the difference of two squares I suppose.
$$a^2-b^2 = (a+b)(a-b) implies a^c-b^c = big(a^{frac{c}{2}}+b^{frac{c}{2}}big)big(a^{frac{c}{2}}-b^{frac{c}{2}}big)$$
In this case, you have $b = 1$, so the factorization is
$$big(c^{frac{x}{2}}+1big)big(c^{frac{x}{2}}-1big) implies (10^5+1)(10^5-1)$$
A more commonly used idea is factoring the difference of $n^{th}$ powers for all $n$ and the sum of $n^{th}$ powers for all odd $n$ (which isn’t relevant but is very similar to the former).
$$a^n-b^n = (a-b)(a^{n-1}+a^{n-2}b+a^{n-3}b^2+…+a^2b^{n-3}+ab^{n-2}+b^{n-1})$$
This works because through expansion because multiplying $a$ to each term is canceled by multiplying $b$ to the term before it, which leaves only the first term for $a$ and the last term for $b$.
$$ = underbrace{a^ncolor{blue}{+a^{n-1}b+a^{n-2}b^2+…+a^3b^{n-3}+a^2b^{n-2}+ab^{n-1}}}_{a(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}underbrace{color{red}{-a^{n-1}b-a^{n-2}b^2-a^{n-3}b^3-…-a^2b^{n-2}-ab^{n-1}}-b^n}_{-b(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}$$
$$= a^n-b^n$$
So, for instance, you can factor your example as follows:
$$10^n-1 = (10-1)(10^{n-1}+10^{n-2}+10^{n-3}+…+1)$$
which also bears striking resemblance to the geometric series if written as $frac{10^n-1}{10-1} = 1+10+10^2+…+10^{n-1}$.
As a side note, you can use
$$(a+b)(a^{n-1}-a^{n-2}b+a^{n-3}b^2-a^{n-4}b^3+…+b^{n-1})$$
to factor the sum of $n^{th}$ powers, but this only works for an odd $n$.
$endgroup$
add a comment |
$begingroup$
Since it’s subtraction, you could use the difference of two squares I suppose.
$$a^2-b^2 = (a+b)(a-b) implies a^c-b^c = big(a^{frac{c}{2}}+b^{frac{c}{2}}big)big(a^{frac{c}{2}}-b^{frac{c}{2}}big)$$
In this case, you have $b = 1$, so the factorization is
$$big(c^{frac{x}{2}}+1big)big(c^{frac{x}{2}}-1big) implies (10^5+1)(10^5-1)$$
A more commonly used idea is factoring the difference of $n^{th}$ powers for all $n$ and the sum of $n^{th}$ powers for all odd $n$ (which isn’t relevant but is very similar to the former).
$$a^n-b^n = (a-b)(a^{n-1}+a^{n-2}b+a^{n-3}b^2+…+a^2b^{n-3}+ab^{n-2}+b^{n-1})$$
This works because through expansion because multiplying $a$ to each term is canceled by multiplying $b$ to the term before it, which leaves only the first term for $a$ and the last term for $b$.
$$ = underbrace{a^ncolor{blue}{+a^{n-1}b+a^{n-2}b^2+…+a^3b^{n-3}+a^2b^{n-2}+ab^{n-1}}}_{a(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}underbrace{color{red}{-a^{n-1}b-a^{n-2}b^2-a^{n-3}b^3-…-a^2b^{n-2}-ab^{n-1}}-b^n}_{-b(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}$$
$$= a^n-b^n$$
So, for instance, you can factor your example as follows:
$$10^n-1 = (10-1)(10^{n-1}+10^{n-2}+10^{n-3}+…+1)$$
which also bears striking resemblance to the geometric series if written as $frac{10^n-1}{10-1} = 1+10+10^2+…+10^{n-1}$.
As a side note, you can use
$$(a+b)(a^{n-1}-a^{n-2}b+a^{n-3}b^2-a^{n-4}b^3+…+b^{n-1})$$
to factor the sum of $n^{th}$ powers, but this only works for an odd $n$.
$endgroup$
add a comment |
$begingroup$
Since it’s subtraction, you could use the difference of two squares I suppose.
$$a^2-b^2 = (a+b)(a-b) implies a^c-b^c = big(a^{frac{c}{2}}+b^{frac{c}{2}}big)big(a^{frac{c}{2}}-b^{frac{c}{2}}big)$$
In this case, you have $b = 1$, so the factorization is
$$big(c^{frac{x}{2}}+1big)big(c^{frac{x}{2}}-1big) implies (10^5+1)(10^5-1)$$
A more commonly used idea is factoring the difference of $n^{th}$ powers for all $n$ and the sum of $n^{th}$ powers for all odd $n$ (which isn’t relevant but is very similar to the former).
$$a^n-b^n = (a-b)(a^{n-1}+a^{n-2}b+a^{n-3}b^2+…+a^2b^{n-3}+ab^{n-2}+b^{n-1})$$
This works because through expansion because multiplying $a$ to each term is canceled by multiplying $b$ to the term before it, which leaves only the first term for $a$ and the last term for $b$.
$$ = underbrace{a^ncolor{blue}{+a^{n-1}b+a^{n-2}b^2+…+a^3b^{n-3}+a^2b^{n-2}+ab^{n-1}}}_{a(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}underbrace{color{red}{-a^{n-1}b-a^{n-2}b^2-a^{n-3}b^3-…-a^2b^{n-2}-ab^{n-1}}-b^n}_{-b(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}$$
$$= a^n-b^n$$
So, for instance, you can factor your example as follows:
$$10^n-1 = (10-1)(10^{n-1}+10^{n-2}+10^{n-3}+…+1)$$
which also bears striking resemblance to the geometric series if written as $frac{10^n-1}{10-1} = 1+10+10^2+…+10^{n-1}$.
As a side note, you can use
$$(a+b)(a^{n-1}-a^{n-2}b+a^{n-3}b^2-a^{n-4}b^3+…+b^{n-1})$$
to factor the sum of $n^{th}$ powers, but this only works for an odd $n$.
$endgroup$
Since it’s subtraction, you could use the difference of two squares I suppose.
$$a^2-b^2 = (a+b)(a-b) implies a^c-b^c = big(a^{frac{c}{2}}+b^{frac{c}{2}}big)big(a^{frac{c}{2}}-b^{frac{c}{2}}big)$$
In this case, you have $b = 1$, so the factorization is
$$big(c^{frac{x}{2}}+1big)big(c^{frac{x}{2}}-1big) implies (10^5+1)(10^5-1)$$
A more commonly used idea is factoring the difference of $n^{th}$ powers for all $n$ and the sum of $n^{th}$ powers for all odd $n$ (which isn’t relevant but is very similar to the former).
$$a^n-b^n = (a-b)(a^{n-1}+a^{n-2}b+a^{n-3}b^2+…+a^2b^{n-3}+ab^{n-2}+b^{n-1})$$
This works because through expansion because multiplying $a$ to each term is canceled by multiplying $b$ to the term before it, which leaves only the first term for $a$ and the last term for $b$.
$$ = underbrace{a^ncolor{blue}{+a^{n-1}b+a^{n-2}b^2+…+a^3b^{n-3}+a^2b^{n-2}+ab^{n-1}}}_{a(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}underbrace{color{red}{-a^{n-1}b-a^{n-2}b^2-a^{n-3}b^3-…-a^2b^{n-2}-ab^{n-1}}-b^n}_{-b(a^{n-1}+a^{n-2}b+…+ab^{n-2}+b^{n-1})}$$
$$= a^n-b^n$$
So, for instance, you can factor your example as follows:
$$10^n-1 = (10-1)(10^{n-1}+10^{n-2}+10^{n-3}+…+1)$$
which also bears striking resemblance to the geometric series if written as $frac{10^n-1}{10-1} = 1+10+10^2+…+10^{n-1}$.
As a side note, you can use
$$(a+b)(a^{n-1}-a^{n-2}b+a^{n-3}b^2-a^{n-4}b^3+…+b^{n-1})$$
to factor the sum of $n^{th}$ powers, but this only works for an odd $n$.
edited Dec 7 '18 at 7:50
answered Dec 7 '18 at 7:28
KM101KM101
5,9611523
5,9611523
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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%2f3029574%2ffactor-10n-1%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
$begingroup$
For $10^n-1$, $9$ is a factor of it.
$endgroup$
– Kemono Chen
Dec 7 '18 at 6:47
$begingroup$
Well, for $10^n - 1$, try a few $n$. You'll notice that every such number is a repdigit, all $9$'s, and thus clearly divisible by $9$, with a factor that's a repdigit of $1$'s. I'm not sure about factoring the new repdigit, though. Or about bases other than $10$, either.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:48
1
$begingroup$
Another thing that comes to mind is that it might not always be factorable. For example, take $c=2$. Some such numbers exist of the form $2^n - 1$ which are prime: they are known as Mersenne primes.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:49
1
$begingroup$
Addressing your edit, one way you could factor for even $n$ would be the difference of two squares. If $n$ is even, then $$(c^n - 1) = (c^{n/2} - 1)(c^{n/2} + 1)$$ Not sure about odd $n$. Sorry if I'm being unhelpful, I'm kinda spitballing here.
$endgroup$
– Eevee Trainer
Dec 7 '18 at 6:51