$A=5cdot d_1^3 + 5 cdot d_2^3 + d_3^3 + d_4^3$Set of all $n$; $n={d^2_1 + d^2_2 + d^2_3 +d^2_4}$Show that...
Most cost effective thermostat setting: consistent temperature vs. lowest temperature possible
What is a^b and (a&b)<<1?
Have researchers managed to "reverse time"? If so, what does that mean for physics?
Identifying the interval from A♭ to D♯
Could the Saturn V actually have launched astronauts around Venus?
Credit cards used everywhere in Singapore or Malaysia?
Gravity magic - How does it work?
How to change two letters closest to a string and one letter immediately after a string using notepad++
Science-fiction short story where space navy wanted hospital ships and settlers had guns mounted everywhere
compactness of a set where am I going wrong
Can a druid choose the size of its wild shape beast?
Should we release the security issues we found in our product as CVE or we can just update those on weekly release notes?
Why do Australian milk farmers need to protest supermarkets' milk price?
The difference between「N分で」and「後N分で」
How do anti-virus programs start at Windows boot?
Look at your watch and tell me what time is it. vs Look at your watch and tell me what time it is
Are all passive ability checks floors for active ability checks?
Life insurance that covers only simultaneous/dual deaths
Do the common programs (for example: "ls", "cat") in Linux and BSD come from the same source code?
Unexpected result from ArcLength
Instead of Universal Basic Income, why not Universal Basic NEEDS?
Why doesn't using two cd commands in bash script execute the second command?
How to make healing in an exploration game interesting
Is this a real picture of Jordan Peterson in New Zealand with a fan wearing a shirt that says "I'm a Proud Islamaphobe"?
$A=5cdot d_1^3 + 5 cdot d_2^3 + d_3^3 + d_4^3$
Set of all $n$; $n={d^2_1 + d^2_2 + d^2_3 +d^2_4}$Show that $sumnolimits_{d|n} frac{1}{d} = frac{sigma (n)}{n}$ for every positive integer $n$.Finding $frac{1}{d_1}+frac{1}{d_2}+frac{1}{d_3}+…+frac{1}{d_k}$Need assistance on geometry problem**A curious number triangle.**Black-Scholes: solve for $sigma$ given $d_1$ and $d_2$Prove that $N = frac{(d_1 + d_2 + … + d_n)}{frac{1}{d_1} + frac{1}{d_2} + … + frac{1}{d_n })}$?Set of all $n$; $n={d^2_1 + d^2_2 + d^2_3 +d^2_4}$Product of 2-digit numbersNumber of triples of divisors who are relatively prime as a tripleA simple modulo arithmetic problem
$begingroup$
Find $Ain mathbb{N}$ s.t. $A=5cdot d_1^3 + 5 cdot d_2^3 + d_3^3 + d_4^3$ and $d_1, d_2, d_3, d_4$ are the smallest divisors of $A$ but not in this order.
It's easy to see that $1$ and $2$ are among them.
I have no idea how to continue.
algebra-precalculus elementary-number-theory
$endgroup$
add a comment |
$begingroup$
Find $Ain mathbb{N}$ s.t. $A=5cdot d_1^3 + 5 cdot d_2^3 + d_3^3 + d_4^3$ and $d_1, d_2, d_3, d_4$ are the smallest divisors of $A$ but not in this order.
It's easy to see that $1$ and $2$ are among them.
I have no idea how to continue.
algebra-precalculus elementary-number-theory
$endgroup$
$begingroup$
The d's being the smallest divisors are primes.
$endgroup$
– William Elliot
Mar 10 at 23:03
1
$begingroup$
This question is a bit lacking in context. Can you at least tell where it comes from?
$endgroup$
– Jyrki Lahtonen
Mar 11 at 4:58
$begingroup$
I do find the question interesting nevertheless. Reminds me of this oldie. May be this succumbs to a similar analysis? Warning: I have not checked, may be a false lead in spite of the similarities.
$endgroup$
– Jyrki Lahtonen
Mar 11 at 5:01
add a comment |
$begingroup$
Find $Ain mathbb{N}$ s.t. $A=5cdot d_1^3 + 5 cdot d_2^3 + d_3^3 + d_4^3$ and $d_1, d_2, d_3, d_4$ are the smallest divisors of $A$ but not in this order.
It's easy to see that $1$ and $2$ are among them.
I have no idea how to continue.
algebra-precalculus elementary-number-theory
$endgroup$
Find $Ain mathbb{N}$ s.t. $A=5cdot d_1^3 + 5 cdot d_2^3 + d_3^3 + d_4^3$ and $d_1, d_2, d_3, d_4$ are the smallest divisors of $A$ but not in this order.
It's easy to see that $1$ and $2$ are among them.
I have no idea how to continue.
algebra-precalculus elementary-number-theory
algebra-precalculus elementary-number-theory
asked Mar 10 at 22:39
rafarafa
593212
593212
$begingroup$
The d's being the smallest divisors are primes.
$endgroup$
– William Elliot
Mar 10 at 23:03
1
$begingroup$
This question is a bit lacking in context. Can you at least tell where it comes from?
$endgroup$
– Jyrki Lahtonen
Mar 11 at 4:58
$begingroup$
I do find the question interesting nevertheless. Reminds me of this oldie. May be this succumbs to a similar analysis? Warning: I have not checked, may be a false lead in spite of the similarities.
$endgroup$
– Jyrki Lahtonen
Mar 11 at 5:01
add a comment |
$begingroup$
The d's being the smallest divisors are primes.
$endgroup$
– William Elliot
Mar 10 at 23:03
1
$begingroup$
This question is a bit lacking in context. Can you at least tell where it comes from?
$endgroup$
– Jyrki Lahtonen
Mar 11 at 4:58
$begingroup$
I do find the question interesting nevertheless. Reminds me of this oldie. May be this succumbs to a similar analysis? Warning: I have not checked, may be a false lead in spite of the similarities.
$endgroup$
– Jyrki Lahtonen
Mar 11 at 5:01
$begingroup$
The d's being the smallest divisors are primes.
$endgroup$
– William Elliot
Mar 10 at 23:03
$begingroup$
The d's being the smallest divisors are primes.
$endgroup$
– William Elliot
Mar 10 at 23:03
1
1
$begingroup$
This question is a bit lacking in context. Can you at least tell where it comes from?
$endgroup$
– Jyrki Lahtonen
Mar 11 at 4:58
$begingroup$
This question is a bit lacking in context. Can you at least tell where it comes from?
$endgroup$
– Jyrki Lahtonen
Mar 11 at 4:58
$begingroup$
I do find the question interesting nevertheless. Reminds me of this oldie. May be this succumbs to a similar analysis? Warning: I have not checked, may be a false lead in spite of the similarities.
$endgroup$
– Jyrki Lahtonen
Mar 11 at 5:01
$begingroup$
I do find the question interesting nevertheless. Reminds me of this oldie. May be this succumbs to a similar analysis? Warning: I have not checked, may be a false lead in spite of the similarities.
$endgroup$
– Jyrki Lahtonen
Mar 11 at 5:01
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I'll show how one might stumble across a few solutions and then indicate how to systematically find them all.
First, we verify that $A$ must be even. If $A$ were odd, each of $d_1,d_2,d_3,d_4$ would be odd, so $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ would be even. But that sum is supposed to be $A$; hence, $A$ is even and its two smallest divisors are $1$ and $2$.
Next, we try to judge the scale of the problem. How big must $A$ be? The smallest possible values for the divisors are $1,2,3,4$, and using those values $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be smallest if $d_1$ and $d_2$ are $1$ and $2$. Thus $A$ is at least $5cdot1^3 + 5cdot2^3 + 3^3 + 4^3 = 136$.
But look: that almost solves the problem. $136$ is divisible by $1,2$ and $4$; it's only missing the factor of $3$. Can we fix up this near miss?
If we switch which divisors have the coefficients of $5$ or $1$, that won't change divisibility by $4$. There aren't many possibilities to check, but we can figure out what the change $bmod 3$ will be in advance: if $5a^3 + b^3$ is changed to $5b^3 + a^3$, the difference is $4b^3 - 4a^3 equiv b^3 - a^3 equiv b - a pmod 3$. Since $136 equiv 1 pmod 3$, an increase of $2 bmod 3$ is needed. This can be done by either swapping $1$ with $3$, yielding
$$
240 = 5cdot 3^3 + 5cdot 2^3 + 1^3 + 4^3,
$$
or swapping $2$ with $4$:
$$
360 = 5cdot 1^3 + 5cdot 4^3 + 3^3 + 2^3.
$$
Now we try to be more thorough. We consider two cases: either $A$ is divisible by $4$ or not.
If $A$ is divisible by $4$, three of its four smallest divisors are necessarily $1,2$ and $4$. The remaining one must be odd so that $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be even; hence it is the smallest odd divisor of $A$ apart from $1$. It must be a prime, so call it $p$. Since $p$ divides both $A$ and the term on the right-hand side in which it appears, it must also divide the sum of the remaining three terms. Depending on where factors of $5$ appear, that sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 + 4^3 &= 109\
5cdot 1^3 + 2^3 + 5cdot 4^3 &= 333 = 3^2cdot 37\
1^3 + 5cdot 2^3 + 5cdot 4^3 &= 361 = 19^2\
5cdot 1^3 + 2^3 + 4^3 &= 77 = 7cdot 11\
1^3 + 5cdot 2^3 + 4^3 &= 105 = 3cdot 5cdot 7\
1^3 + 2^3 + 5cdot 4^3 &= 329 = 7cdot 47
end{align}
$$
There are thus $11$ cases, where $p$ is one of the prime factors of these sums. Adding in the remaining term of $p^3$ or $5p^3$ may not produce a multiple of $4$ (e.g., $109 + 109^3$ doesn't work) or may introduce a new divisor smaller than $p$ (e.g., $361 + 19^3$ is divisible by $5$), but in four cases everything works out. Two were found above; the other two are
$$
begin{align}
1792 &= 5cdot 1^3 + 5cdot 7^3 + 2^3 + 4^3\
2044 &= 5cdot 4^3 + 5cdot 7^3 + 1^3 + 2^3
end{align}
$$
If $A$ is not divisible by $4$, then its third smallest divisor is an odd prime $p$. The fourth must be an even divisor; since it is not divisible by $4$, it is twice an odd divisor. Thus the smallest it can be is $2p$. Now $p$ divides $A$ and two terms on the right-hand side, so it divides the sum of the remaining two terms. That sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 &= 45 = 3^2cdot 5\
5cdot 1^3 + 2^3 &= 13\
1^3 + 5cdot 2^3 &= 41\
1^3 + 2^3 &= 9 = 3^2
end{align}
$$
There are five prime factors but seven cases, since for $p = 13$ the remaining terms could be $13^3 + 5cdot 26^3$ or $5cdot 13^3 + 26^3$ and likewise for $p = 41$. However, in each case the resulting total is either a multiple of $4$ or has an odd prime factor smaller than $p$, so there are no further solutions.
So there are exactly four possible values of $A$: $240, 360, 1792$ and $2044$.
$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%2f3143013%2fa-5-cdot-d-13-5-cdot-d-23-d-33-d-43%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I'll show how one might stumble across a few solutions and then indicate how to systematically find them all.
First, we verify that $A$ must be even. If $A$ were odd, each of $d_1,d_2,d_3,d_4$ would be odd, so $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ would be even. But that sum is supposed to be $A$; hence, $A$ is even and its two smallest divisors are $1$ and $2$.
Next, we try to judge the scale of the problem. How big must $A$ be? The smallest possible values for the divisors are $1,2,3,4$, and using those values $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be smallest if $d_1$ and $d_2$ are $1$ and $2$. Thus $A$ is at least $5cdot1^3 + 5cdot2^3 + 3^3 + 4^3 = 136$.
But look: that almost solves the problem. $136$ is divisible by $1,2$ and $4$; it's only missing the factor of $3$. Can we fix up this near miss?
If we switch which divisors have the coefficients of $5$ or $1$, that won't change divisibility by $4$. There aren't many possibilities to check, but we can figure out what the change $bmod 3$ will be in advance: if $5a^3 + b^3$ is changed to $5b^3 + a^3$, the difference is $4b^3 - 4a^3 equiv b^3 - a^3 equiv b - a pmod 3$. Since $136 equiv 1 pmod 3$, an increase of $2 bmod 3$ is needed. This can be done by either swapping $1$ with $3$, yielding
$$
240 = 5cdot 3^3 + 5cdot 2^3 + 1^3 + 4^3,
$$
or swapping $2$ with $4$:
$$
360 = 5cdot 1^3 + 5cdot 4^3 + 3^3 + 2^3.
$$
Now we try to be more thorough. We consider two cases: either $A$ is divisible by $4$ or not.
If $A$ is divisible by $4$, three of its four smallest divisors are necessarily $1,2$ and $4$. The remaining one must be odd so that $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be even; hence it is the smallest odd divisor of $A$ apart from $1$. It must be a prime, so call it $p$. Since $p$ divides both $A$ and the term on the right-hand side in which it appears, it must also divide the sum of the remaining three terms. Depending on where factors of $5$ appear, that sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 + 4^3 &= 109\
5cdot 1^3 + 2^3 + 5cdot 4^3 &= 333 = 3^2cdot 37\
1^3 + 5cdot 2^3 + 5cdot 4^3 &= 361 = 19^2\
5cdot 1^3 + 2^3 + 4^3 &= 77 = 7cdot 11\
1^3 + 5cdot 2^3 + 4^3 &= 105 = 3cdot 5cdot 7\
1^3 + 2^3 + 5cdot 4^3 &= 329 = 7cdot 47
end{align}
$$
There are thus $11$ cases, where $p$ is one of the prime factors of these sums. Adding in the remaining term of $p^3$ or $5p^3$ may not produce a multiple of $4$ (e.g., $109 + 109^3$ doesn't work) or may introduce a new divisor smaller than $p$ (e.g., $361 + 19^3$ is divisible by $5$), but in four cases everything works out. Two were found above; the other two are
$$
begin{align}
1792 &= 5cdot 1^3 + 5cdot 7^3 + 2^3 + 4^3\
2044 &= 5cdot 4^3 + 5cdot 7^3 + 1^3 + 2^3
end{align}
$$
If $A$ is not divisible by $4$, then its third smallest divisor is an odd prime $p$. The fourth must be an even divisor; since it is not divisible by $4$, it is twice an odd divisor. Thus the smallest it can be is $2p$. Now $p$ divides $A$ and two terms on the right-hand side, so it divides the sum of the remaining two terms. That sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 &= 45 = 3^2cdot 5\
5cdot 1^3 + 2^3 &= 13\
1^3 + 5cdot 2^3 &= 41\
1^3 + 2^3 &= 9 = 3^2
end{align}
$$
There are five prime factors but seven cases, since for $p = 13$ the remaining terms could be $13^3 + 5cdot 26^3$ or $5cdot 13^3 + 26^3$ and likewise for $p = 41$. However, in each case the resulting total is either a multiple of $4$ or has an odd prime factor smaller than $p$, so there are no further solutions.
So there are exactly four possible values of $A$: $240, 360, 1792$ and $2044$.
$endgroup$
add a comment |
$begingroup$
I'll show how one might stumble across a few solutions and then indicate how to systematically find them all.
First, we verify that $A$ must be even. If $A$ were odd, each of $d_1,d_2,d_3,d_4$ would be odd, so $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ would be even. But that sum is supposed to be $A$; hence, $A$ is even and its two smallest divisors are $1$ and $2$.
Next, we try to judge the scale of the problem. How big must $A$ be? The smallest possible values for the divisors are $1,2,3,4$, and using those values $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be smallest if $d_1$ and $d_2$ are $1$ and $2$. Thus $A$ is at least $5cdot1^3 + 5cdot2^3 + 3^3 + 4^3 = 136$.
But look: that almost solves the problem. $136$ is divisible by $1,2$ and $4$; it's only missing the factor of $3$. Can we fix up this near miss?
If we switch which divisors have the coefficients of $5$ or $1$, that won't change divisibility by $4$. There aren't many possibilities to check, but we can figure out what the change $bmod 3$ will be in advance: if $5a^3 + b^3$ is changed to $5b^3 + a^3$, the difference is $4b^3 - 4a^3 equiv b^3 - a^3 equiv b - a pmod 3$. Since $136 equiv 1 pmod 3$, an increase of $2 bmod 3$ is needed. This can be done by either swapping $1$ with $3$, yielding
$$
240 = 5cdot 3^3 + 5cdot 2^3 + 1^3 + 4^3,
$$
or swapping $2$ with $4$:
$$
360 = 5cdot 1^3 + 5cdot 4^3 + 3^3 + 2^3.
$$
Now we try to be more thorough. We consider two cases: either $A$ is divisible by $4$ or not.
If $A$ is divisible by $4$, three of its four smallest divisors are necessarily $1,2$ and $4$. The remaining one must be odd so that $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be even; hence it is the smallest odd divisor of $A$ apart from $1$. It must be a prime, so call it $p$. Since $p$ divides both $A$ and the term on the right-hand side in which it appears, it must also divide the sum of the remaining three terms. Depending on where factors of $5$ appear, that sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 + 4^3 &= 109\
5cdot 1^3 + 2^3 + 5cdot 4^3 &= 333 = 3^2cdot 37\
1^3 + 5cdot 2^3 + 5cdot 4^3 &= 361 = 19^2\
5cdot 1^3 + 2^3 + 4^3 &= 77 = 7cdot 11\
1^3 + 5cdot 2^3 + 4^3 &= 105 = 3cdot 5cdot 7\
1^3 + 2^3 + 5cdot 4^3 &= 329 = 7cdot 47
end{align}
$$
There are thus $11$ cases, where $p$ is one of the prime factors of these sums. Adding in the remaining term of $p^3$ or $5p^3$ may not produce a multiple of $4$ (e.g., $109 + 109^3$ doesn't work) or may introduce a new divisor smaller than $p$ (e.g., $361 + 19^3$ is divisible by $5$), but in four cases everything works out. Two were found above; the other two are
$$
begin{align}
1792 &= 5cdot 1^3 + 5cdot 7^3 + 2^3 + 4^3\
2044 &= 5cdot 4^3 + 5cdot 7^3 + 1^3 + 2^3
end{align}
$$
If $A$ is not divisible by $4$, then its third smallest divisor is an odd prime $p$. The fourth must be an even divisor; since it is not divisible by $4$, it is twice an odd divisor. Thus the smallest it can be is $2p$. Now $p$ divides $A$ and two terms on the right-hand side, so it divides the sum of the remaining two terms. That sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 &= 45 = 3^2cdot 5\
5cdot 1^3 + 2^3 &= 13\
1^3 + 5cdot 2^3 &= 41\
1^3 + 2^3 &= 9 = 3^2
end{align}
$$
There are five prime factors but seven cases, since for $p = 13$ the remaining terms could be $13^3 + 5cdot 26^3$ or $5cdot 13^3 + 26^3$ and likewise for $p = 41$. However, in each case the resulting total is either a multiple of $4$ or has an odd prime factor smaller than $p$, so there are no further solutions.
So there are exactly four possible values of $A$: $240, 360, 1792$ and $2044$.
$endgroup$
add a comment |
$begingroup$
I'll show how one might stumble across a few solutions and then indicate how to systematically find them all.
First, we verify that $A$ must be even. If $A$ were odd, each of $d_1,d_2,d_3,d_4$ would be odd, so $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ would be even. But that sum is supposed to be $A$; hence, $A$ is even and its two smallest divisors are $1$ and $2$.
Next, we try to judge the scale of the problem. How big must $A$ be? The smallest possible values for the divisors are $1,2,3,4$, and using those values $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be smallest if $d_1$ and $d_2$ are $1$ and $2$. Thus $A$ is at least $5cdot1^3 + 5cdot2^3 + 3^3 + 4^3 = 136$.
But look: that almost solves the problem. $136$ is divisible by $1,2$ and $4$; it's only missing the factor of $3$. Can we fix up this near miss?
If we switch which divisors have the coefficients of $5$ or $1$, that won't change divisibility by $4$. There aren't many possibilities to check, but we can figure out what the change $bmod 3$ will be in advance: if $5a^3 + b^3$ is changed to $5b^3 + a^3$, the difference is $4b^3 - 4a^3 equiv b^3 - a^3 equiv b - a pmod 3$. Since $136 equiv 1 pmod 3$, an increase of $2 bmod 3$ is needed. This can be done by either swapping $1$ with $3$, yielding
$$
240 = 5cdot 3^3 + 5cdot 2^3 + 1^3 + 4^3,
$$
or swapping $2$ with $4$:
$$
360 = 5cdot 1^3 + 5cdot 4^3 + 3^3 + 2^3.
$$
Now we try to be more thorough. We consider two cases: either $A$ is divisible by $4$ or not.
If $A$ is divisible by $4$, three of its four smallest divisors are necessarily $1,2$ and $4$. The remaining one must be odd so that $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be even; hence it is the smallest odd divisor of $A$ apart from $1$. It must be a prime, so call it $p$. Since $p$ divides both $A$ and the term on the right-hand side in which it appears, it must also divide the sum of the remaining three terms. Depending on where factors of $5$ appear, that sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 + 4^3 &= 109\
5cdot 1^3 + 2^3 + 5cdot 4^3 &= 333 = 3^2cdot 37\
1^3 + 5cdot 2^3 + 5cdot 4^3 &= 361 = 19^2\
5cdot 1^3 + 2^3 + 4^3 &= 77 = 7cdot 11\
1^3 + 5cdot 2^3 + 4^3 &= 105 = 3cdot 5cdot 7\
1^3 + 2^3 + 5cdot 4^3 &= 329 = 7cdot 47
end{align}
$$
There are thus $11$ cases, where $p$ is one of the prime factors of these sums. Adding in the remaining term of $p^3$ or $5p^3$ may not produce a multiple of $4$ (e.g., $109 + 109^3$ doesn't work) or may introduce a new divisor smaller than $p$ (e.g., $361 + 19^3$ is divisible by $5$), but in four cases everything works out. Two were found above; the other two are
$$
begin{align}
1792 &= 5cdot 1^3 + 5cdot 7^3 + 2^3 + 4^3\
2044 &= 5cdot 4^3 + 5cdot 7^3 + 1^3 + 2^3
end{align}
$$
If $A$ is not divisible by $4$, then its third smallest divisor is an odd prime $p$. The fourth must be an even divisor; since it is not divisible by $4$, it is twice an odd divisor. Thus the smallest it can be is $2p$. Now $p$ divides $A$ and two terms on the right-hand side, so it divides the sum of the remaining two terms. That sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 &= 45 = 3^2cdot 5\
5cdot 1^3 + 2^3 &= 13\
1^3 + 5cdot 2^3 &= 41\
1^3 + 2^3 &= 9 = 3^2
end{align}
$$
There are five prime factors but seven cases, since for $p = 13$ the remaining terms could be $13^3 + 5cdot 26^3$ or $5cdot 13^3 + 26^3$ and likewise for $p = 41$. However, in each case the resulting total is either a multiple of $4$ or has an odd prime factor smaller than $p$, so there are no further solutions.
So there are exactly four possible values of $A$: $240, 360, 1792$ and $2044$.
$endgroup$
I'll show how one might stumble across a few solutions and then indicate how to systematically find them all.
First, we verify that $A$ must be even. If $A$ were odd, each of $d_1,d_2,d_3,d_4$ would be odd, so $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ would be even. But that sum is supposed to be $A$; hence, $A$ is even and its two smallest divisors are $1$ and $2$.
Next, we try to judge the scale of the problem. How big must $A$ be? The smallest possible values for the divisors are $1,2,3,4$, and using those values $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be smallest if $d_1$ and $d_2$ are $1$ and $2$. Thus $A$ is at least $5cdot1^3 + 5cdot2^3 + 3^3 + 4^3 = 136$.
But look: that almost solves the problem. $136$ is divisible by $1,2$ and $4$; it's only missing the factor of $3$. Can we fix up this near miss?
If we switch which divisors have the coefficients of $5$ or $1$, that won't change divisibility by $4$. There aren't many possibilities to check, but we can figure out what the change $bmod 3$ will be in advance: if $5a^3 + b^3$ is changed to $5b^3 + a^3$, the difference is $4b^3 - 4a^3 equiv b^3 - a^3 equiv b - a pmod 3$. Since $136 equiv 1 pmod 3$, an increase of $2 bmod 3$ is needed. This can be done by either swapping $1$ with $3$, yielding
$$
240 = 5cdot 3^3 + 5cdot 2^3 + 1^3 + 4^3,
$$
or swapping $2$ with $4$:
$$
360 = 5cdot 1^3 + 5cdot 4^3 + 3^3 + 2^3.
$$
Now we try to be more thorough. We consider two cases: either $A$ is divisible by $4$ or not.
If $A$ is divisible by $4$, three of its four smallest divisors are necessarily $1,2$ and $4$. The remaining one must be odd so that $5 d_1^3 + 5 d_2^3 + d_3^3 + d_4^3$ will be even; hence it is the smallest odd divisor of $A$ apart from $1$. It must be a prime, so call it $p$. Since $p$ divides both $A$ and the term on the right-hand side in which it appears, it must also divide the sum of the remaining three terms. Depending on where factors of $5$ appear, that sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 + 4^3 &= 109\
5cdot 1^3 + 2^3 + 5cdot 4^3 &= 333 = 3^2cdot 37\
1^3 + 5cdot 2^3 + 5cdot 4^3 &= 361 = 19^2\
5cdot 1^3 + 2^3 + 4^3 &= 77 = 7cdot 11\
1^3 + 5cdot 2^3 + 4^3 &= 105 = 3cdot 5cdot 7\
1^3 + 2^3 + 5cdot 4^3 &= 329 = 7cdot 47
end{align}
$$
There are thus $11$ cases, where $p$ is one of the prime factors of these sums. Adding in the remaining term of $p^3$ or $5p^3$ may not produce a multiple of $4$ (e.g., $109 + 109^3$ doesn't work) or may introduce a new divisor smaller than $p$ (e.g., $361 + 19^3$ is divisible by $5$), but in four cases everything works out. Two were found above; the other two are
$$
begin{align}
1792 &= 5cdot 1^3 + 5cdot 7^3 + 2^3 + 4^3\
2044 &= 5cdot 4^3 + 5cdot 7^3 + 1^3 + 2^3
end{align}
$$
If $A$ is not divisible by $4$, then its third smallest divisor is an odd prime $p$. The fourth must be an even divisor; since it is not divisible by $4$, it is twice an odd divisor. Thus the smallest it can be is $2p$. Now $p$ divides $A$ and two terms on the right-hand side, so it divides the sum of the remaining two terms. That sum is one of the following:
$$
begin{align}
5cdot 1^3 + 5cdot 2^3 &= 45 = 3^2cdot 5\
5cdot 1^3 + 2^3 &= 13\
1^3 + 5cdot 2^3 &= 41\
1^3 + 2^3 &= 9 = 3^2
end{align}
$$
There are five prime factors but seven cases, since for $p = 13$ the remaining terms could be $13^3 + 5cdot 26^3$ or $5cdot 13^3 + 26^3$ and likewise for $p = 41$. However, in each case the resulting total is either a multiple of $4$ or has an odd prime factor smaller than $p$, so there are no further solutions.
So there are exactly four possible values of $A$: $240, 360, 1792$ and $2044$.
answered Mar 11 at 5:13
FredHFredH
2,044814
2,044814
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%2f3143013%2fa-5-cdot-d-13-5-cdot-d-23-d-33-d-43%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$
The d's being the smallest divisors are primes.
$endgroup$
– William Elliot
Mar 10 at 23:03
1
$begingroup$
This question is a bit lacking in context. Can you at least tell where it comes from?
$endgroup$
– Jyrki Lahtonen
Mar 11 at 4:58
$begingroup$
I do find the question interesting nevertheless. Reminds me of this oldie. May be this succumbs to a similar analysis? Warning: I have not checked, may be a false lead in spite of the similarities.
$endgroup$
– Jyrki Lahtonen
Mar 11 at 5:01