Zero, One, Two, Three, etc The Next CEO of Stack OverflowThree secret numbers (Variant 1 and Variant 2)A new six-sided dieSquares in seriesSum of three six digit numbersFind the value of $bigstar$: Puzzle 3 - SubstitutionFind the value of $bigstar$: Puzzle 4 - In BetweenFind the value of $bigstar$: Puzzle 7 - Boss BattleFind the value of $bigstar$: Puzzle 8 - InequalityDistinct digits but Close EnoughA 4 x 4 Magic Square with Pairwise Relatively Prime Entries
Why is my new battery behaving weirdly?
Prepend last line of stdin to entire stdin
The past simple of "gaslight" – "gaslighted" or "gaslit"?
Axiom Schema vs Axiom
How did people program for Consoles with multiple CPUs?
Is a distribution that is normal, but highly skewed considered Gaussian?
Can I use the load factor to estimate the lift?
Why is the US ranked as #45 in Press Freedom ratings, despite its extremely permissive free speech laws?
If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?
How to prove a simple equation?
RigExpert AA-35 - Interpreting The Information
How to get from Geneva Airport to Metabief, Doubs, France by public transport?
Solving system of ODEs with extra parameter
What flight has the highest ratio of time difference to flight time?
Legal workarounds for testamentary trust perceived as unfair
Can we say or write : "No, it'sn't"?
Why, when going from special to general relativity, do we just replace partial derivatives with covariant derivatives?
Where does this common spurious transmission come from? Is there a quality difference?
How to edit “Name” property in GCI output?
"misplaced omit" error when >centering columns
TikZ: How to reverse arrow direction without switching start/end point?
Easy to read palindrome checker
0 rank tensor vs 1D vector
Unclear about dynamic binding
Zero, One, Two, Three, etc
The Next CEO of Stack OverflowThree secret numbers (Variant 1 and Variant 2)A new six-sided dieSquares in seriesSum of three six digit numbersFind the value of $bigstar$: Puzzle 3 - SubstitutionFind the value of $bigstar$: Puzzle 4 - In BetweenFind the value of $bigstar$: Puzzle 7 - Boss BattleFind the value of $bigstar$: Puzzle 8 - InequalityDistinct digits but Close EnoughA 4 x 4 Magic Square with Pairwise Relatively Prime Entries
$begingroup$
Find a solution to the following system of simultaneous equations. All letters stand for integers (positive, zero, or negative), and different letters are different integers.
The preferred solution will be the one in which the difference between the largest and smallest of the values is the least.
C+E+R+O = 0
U+N+O = 1
D+O+S = 2
T+R+E+S = 3
C+U+A+T+R+O = 4
C+I+N+C+O = 5
S+E+I+S = 6
S+I+E+T+E = 7
O+C+H+O = 8
N+U+E+V+E = 9
D+I+E+Z = 10
mathematics arithmetic
$endgroup$
add a comment |
$begingroup$
Find a solution to the following system of simultaneous equations. All letters stand for integers (positive, zero, or negative), and different letters are different integers.
The preferred solution will be the one in which the difference between the largest and smallest of the values is the least.
C+E+R+O = 0
U+N+O = 1
D+O+S = 2
T+R+E+S = 3
C+U+A+T+R+O = 4
C+I+N+C+O = 5
S+E+I+S = 6
S+I+E+T+E = 7
O+C+H+O = 8
N+U+E+V+E = 9
D+I+E+Z = 10
mathematics arithmetic
$endgroup$
add a comment |
$begingroup$
Find a solution to the following system of simultaneous equations. All letters stand for integers (positive, zero, or negative), and different letters are different integers.
The preferred solution will be the one in which the difference between the largest and smallest of the values is the least.
C+E+R+O = 0
U+N+O = 1
D+O+S = 2
T+R+E+S = 3
C+U+A+T+R+O = 4
C+I+N+C+O = 5
S+E+I+S = 6
S+I+E+T+E = 7
O+C+H+O = 8
N+U+E+V+E = 9
D+I+E+Z = 10
mathematics arithmetic
$endgroup$
Find a solution to the following system of simultaneous equations. All letters stand for integers (positive, zero, or negative), and different letters are different integers.
The preferred solution will be the one in which the difference between the largest and smallest of the values is the least.
C+E+R+O = 0
U+N+O = 1
D+O+S = 2
T+R+E+S = 3
C+U+A+T+R+O = 4
C+I+N+C+O = 5
S+E+I+S = 6
S+I+E+T+E = 7
O+C+H+O = 8
N+U+E+V+E = 9
D+I+E+Z = 10
mathematics arithmetic
mathematics arithmetic
edited Mar 19 at 1:10
Bernardo Recamán Santos
asked Mar 19 at 0:30
Bernardo Recamán SantosBernardo Recamán Santos
2,7611349
2,7611349
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This system of equations is underdetermined, and it has 3 degrees of freedom.
Denoting these with $x$, $y$ and $z$, a possible substitution of the original letters is:
$textA=19-5x-3y-2z$
$textC=z$
$textD=10-5x-y+z$
$textE=6-2x-y$
$textH=24-8x-2y+z$
$textI=y$
$textN=13-4x-2y-z$
$textO=-8+4x+y-z$
$textR=2-2x$
$textS=x$
$textT=-5+3x+y$
$textU=-4+y+2z$
$textV=-12+8x+3y-z$
$textZ=-6+7x+y-z$
At this point I don't have any better idea than quasi-randomly trying $x$, $y$ and $z$ values to see if these expressions indeed produce distinct values, and if they do, calculate the span of them.
To provide a working example, $x=0$, $y=-1$, $z=1$ seems to produce distinct numbers in the range of $[-16; 27]$, so that produces a span of 43. I doubt this is minimal, feel free to use this input for further finetuning.
Update
$textspan([0,-1,-2])=39$
$textspan([2,3,-6])=32$
$textspan([2,5,1])=26$
$textspan([-3,14,-9])=24$
$textspan([6,-11,12])=24$
also, confirmed with programming: $24$ is the minimal span if $max(|x|, |y|, |z|) le 120$
Update 2
Now it can easily be proven, that $24$ is the minimal span in general.
$textS-textR=3x+2$
If we want the span to be $24$ at most, any letter pairs should have a difference of at most $24$, so $|3x+2|le24$, so we get $|x|le8$.
But also $textS-textI$ and $textS-textC$ has to be at most $24$ (in its absolute value), which then gives $|y|le32$ and $|z|le32$, and since every tuplet in this range has been checked, we are done.
So the value of the letters can be any of the following two sets to achieve the minimal span of $24$:
A C D E H I N O R S T U V Z
10 -9 2 -2 11 14 6 3 8 -3 0 -8 15 -4
-2 12 3 5 10 -11 -1 -7 -10 6 2 9 -9 13
$endgroup$
$begingroup$
@JonMarkPerry, but if x=-8, |3x+2|=22
$endgroup$
– elias
Mar 19 at 9:16
$begingroup$
For my proof, the bound |x|<=8 is enough, no need to be more strict. I could not use it anyway in the next step, when trying to bound y and z.
$endgroup$
– elias
Mar 19 at 9:22
$begingroup$
I'm not stating that $|3x+2|le24$ is equivalent with $|x|le8$. I'm just saying the latter is a consequence of the former.
$endgroup$
– elias
Mar 19 at 9:27
$begingroup$
So you claim that $|3x+2|le24$ doesn't cause $|x|le8$? Could you provide a counterexample? I mean an $x$ that fulfills the first, but does not fulfill the second?
$endgroup$
– elias
Mar 19 at 9:33
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: "559"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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%2fpuzzling.stackexchange.com%2fquestions%2f80810%2fzero-one-two-three-etc%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$
This system of equations is underdetermined, and it has 3 degrees of freedom.
Denoting these with $x$, $y$ and $z$, a possible substitution of the original letters is:
$textA=19-5x-3y-2z$
$textC=z$
$textD=10-5x-y+z$
$textE=6-2x-y$
$textH=24-8x-2y+z$
$textI=y$
$textN=13-4x-2y-z$
$textO=-8+4x+y-z$
$textR=2-2x$
$textS=x$
$textT=-5+3x+y$
$textU=-4+y+2z$
$textV=-12+8x+3y-z$
$textZ=-6+7x+y-z$
At this point I don't have any better idea than quasi-randomly trying $x$, $y$ and $z$ values to see if these expressions indeed produce distinct values, and if they do, calculate the span of them.
To provide a working example, $x=0$, $y=-1$, $z=1$ seems to produce distinct numbers in the range of $[-16; 27]$, so that produces a span of 43. I doubt this is minimal, feel free to use this input for further finetuning.
Update
$textspan([0,-1,-2])=39$
$textspan([2,3,-6])=32$
$textspan([2,5,1])=26$
$textspan([-3,14,-9])=24$
$textspan([6,-11,12])=24$
also, confirmed with programming: $24$ is the minimal span if $max(|x|, |y|, |z|) le 120$
Update 2
Now it can easily be proven, that $24$ is the minimal span in general.
$textS-textR=3x+2$
If we want the span to be $24$ at most, any letter pairs should have a difference of at most $24$, so $|3x+2|le24$, so we get $|x|le8$.
But also $textS-textI$ and $textS-textC$ has to be at most $24$ (in its absolute value), which then gives $|y|le32$ and $|z|le32$, and since every tuplet in this range has been checked, we are done.
So the value of the letters can be any of the following two sets to achieve the minimal span of $24$:
A C D E H I N O R S T U V Z
10 -9 2 -2 11 14 6 3 8 -3 0 -8 15 -4
-2 12 3 5 10 -11 -1 -7 -10 6 2 9 -9 13
$endgroup$
$begingroup$
@JonMarkPerry, but if x=-8, |3x+2|=22
$endgroup$
– elias
Mar 19 at 9:16
$begingroup$
For my proof, the bound |x|<=8 is enough, no need to be more strict. I could not use it anyway in the next step, when trying to bound y and z.
$endgroup$
– elias
Mar 19 at 9:22
$begingroup$
I'm not stating that $|3x+2|le24$ is equivalent with $|x|le8$. I'm just saying the latter is a consequence of the former.
$endgroup$
– elias
Mar 19 at 9:27
$begingroup$
So you claim that $|3x+2|le24$ doesn't cause $|x|le8$? Could you provide a counterexample? I mean an $x$ that fulfills the first, but does not fulfill the second?
$endgroup$
– elias
Mar 19 at 9:33
add a comment |
$begingroup$
This system of equations is underdetermined, and it has 3 degrees of freedom.
Denoting these with $x$, $y$ and $z$, a possible substitution of the original letters is:
$textA=19-5x-3y-2z$
$textC=z$
$textD=10-5x-y+z$
$textE=6-2x-y$
$textH=24-8x-2y+z$
$textI=y$
$textN=13-4x-2y-z$
$textO=-8+4x+y-z$
$textR=2-2x$
$textS=x$
$textT=-5+3x+y$
$textU=-4+y+2z$
$textV=-12+8x+3y-z$
$textZ=-6+7x+y-z$
At this point I don't have any better idea than quasi-randomly trying $x$, $y$ and $z$ values to see if these expressions indeed produce distinct values, and if they do, calculate the span of them.
To provide a working example, $x=0$, $y=-1$, $z=1$ seems to produce distinct numbers in the range of $[-16; 27]$, so that produces a span of 43. I doubt this is minimal, feel free to use this input for further finetuning.
Update
$textspan([0,-1,-2])=39$
$textspan([2,3,-6])=32$
$textspan([2,5,1])=26$
$textspan([-3,14,-9])=24$
$textspan([6,-11,12])=24$
also, confirmed with programming: $24$ is the minimal span if $max(|x|, |y|, |z|) le 120$
Update 2
Now it can easily be proven, that $24$ is the minimal span in general.
$textS-textR=3x+2$
If we want the span to be $24$ at most, any letter pairs should have a difference of at most $24$, so $|3x+2|le24$, so we get $|x|le8$.
But also $textS-textI$ and $textS-textC$ has to be at most $24$ (in its absolute value), which then gives $|y|le32$ and $|z|le32$, and since every tuplet in this range has been checked, we are done.
So the value of the letters can be any of the following two sets to achieve the minimal span of $24$:
A C D E H I N O R S T U V Z
10 -9 2 -2 11 14 6 3 8 -3 0 -8 15 -4
-2 12 3 5 10 -11 -1 -7 -10 6 2 9 -9 13
$endgroup$
$begingroup$
@JonMarkPerry, but if x=-8, |3x+2|=22
$endgroup$
– elias
Mar 19 at 9:16
$begingroup$
For my proof, the bound |x|<=8 is enough, no need to be more strict. I could not use it anyway in the next step, when trying to bound y and z.
$endgroup$
– elias
Mar 19 at 9:22
$begingroup$
I'm not stating that $|3x+2|le24$ is equivalent with $|x|le8$. I'm just saying the latter is a consequence of the former.
$endgroup$
– elias
Mar 19 at 9:27
$begingroup$
So you claim that $|3x+2|le24$ doesn't cause $|x|le8$? Could you provide a counterexample? I mean an $x$ that fulfills the first, but does not fulfill the second?
$endgroup$
– elias
Mar 19 at 9:33
add a comment |
$begingroup$
This system of equations is underdetermined, and it has 3 degrees of freedom.
Denoting these with $x$, $y$ and $z$, a possible substitution of the original letters is:
$textA=19-5x-3y-2z$
$textC=z$
$textD=10-5x-y+z$
$textE=6-2x-y$
$textH=24-8x-2y+z$
$textI=y$
$textN=13-4x-2y-z$
$textO=-8+4x+y-z$
$textR=2-2x$
$textS=x$
$textT=-5+3x+y$
$textU=-4+y+2z$
$textV=-12+8x+3y-z$
$textZ=-6+7x+y-z$
At this point I don't have any better idea than quasi-randomly trying $x$, $y$ and $z$ values to see if these expressions indeed produce distinct values, and if they do, calculate the span of them.
To provide a working example, $x=0$, $y=-1$, $z=1$ seems to produce distinct numbers in the range of $[-16; 27]$, so that produces a span of 43. I doubt this is minimal, feel free to use this input for further finetuning.
Update
$textspan([0,-1,-2])=39$
$textspan([2,3,-6])=32$
$textspan([2,5,1])=26$
$textspan([-3,14,-9])=24$
$textspan([6,-11,12])=24$
also, confirmed with programming: $24$ is the minimal span if $max(|x|, |y|, |z|) le 120$
Update 2
Now it can easily be proven, that $24$ is the minimal span in general.
$textS-textR=3x+2$
If we want the span to be $24$ at most, any letter pairs should have a difference of at most $24$, so $|3x+2|le24$, so we get $|x|le8$.
But also $textS-textI$ and $textS-textC$ has to be at most $24$ (in its absolute value), which then gives $|y|le32$ and $|z|le32$, and since every tuplet in this range has been checked, we are done.
So the value of the letters can be any of the following two sets to achieve the minimal span of $24$:
A C D E H I N O R S T U V Z
10 -9 2 -2 11 14 6 3 8 -3 0 -8 15 -4
-2 12 3 5 10 -11 -1 -7 -10 6 2 9 -9 13
$endgroup$
This system of equations is underdetermined, and it has 3 degrees of freedom.
Denoting these with $x$, $y$ and $z$, a possible substitution of the original letters is:
$textA=19-5x-3y-2z$
$textC=z$
$textD=10-5x-y+z$
$textE=6-2x-y$
$textH=24-8x-2y+z$
$textI=y$
$textN=13-4x-2y-z$
$textO=-8+4x+y-z$
$textR=2-2x$
$textS=x$
$textT=-5+3x+y$
$textU=-4+y+2z$
$textV=-12+8x+3y-z$
$textZ=-6+7x+y-z$
At this point I don't have any better idea than quasi-randomly trying $x$, $y$ and $z$ values to see if these expressions indeed produce distinct values, and if they do, calculate the span of them.
To provide a working example, $x=0$, $y=-1$, $z=1$ seems to produce distinct numbers in the range of $[-16; 27]$, so that produces a span of 43. I doubt this is minimal, feel free to use this input for further finetuning.
Update
$textspan([0,-1,-2])=39$
$textspan([2,3,-6])=32$
$textspan([2,5,1])=26$
$textspan([-3,14,-9])=24$
$textspan([6,-11,12])=24$
also, confirmed with programming: $24$ is the minimal span if $max(|x|, |y|, |z|) le 120$
Update 2
Now it can easily be proven, that $24$ is the minimal span in general.
$textS-textR=3x+2$
If we want the span to be $24$ at most, any letter pairs should have a difference of at most $24$, so $|3x+2|le24$, so we get $|x|le8$.
But also $textS-textI$ and $textS-textC$ has to be at most $24$ (in its absolute value), which then gives $|y|le32$ and $|z|le32$, and since every tuplet in this range has been checked, we are done.
So the value of the letters can be any of the following two sets to achieve the minimal span of $24$:
A C D E H I N O R S T U V Z
10 -9 2 -2 11 14 6 3 8 -3 0 -8 15 -4
-2 12 3 5 10 -11 -1 -7 -10 6 2 9 -9 13
edited Mar 19 at 9:24
answered Mar 19 at 7:40
eliaselias
8,90332455
8,90332455
$begingroup$
@JonMarkPerry, but if x=-8, |3x+2|=22
$endgroup$
– elias
Mar 19 at 9:16
$begingroup$
For my proof, the bound |x|<=8 is enough, no need to be more strict. I could not use it anyway in the next step, when trying to bound y and z.
$endgroup$
– elias
Mar 19 at 9:22
$begingroup$
I'm not stating that $|3x+2|le24$ is equivalent with $|x|le8$. I'm just saying the latter is a consequence of the former.
$endgroup$
– elias
Mar 19 at 9:27
$begingroup$
So you claim that $|3x+2|le24$ doesn't cause $|x|le8$? Could you provide a counterexample? I mean an $x$ that fulfills the first, but does not fulfill the second?
$endgroup$
– elias
Mar 19 at 9:33
add a comment |
$begingroup$
@JonMarkPerry, but if x=-8, |3x+2|=22
$endgroup$
– elias
Mar 19 at 9:16
$begingroup$
For my proof, the bound |x|<=8 is enough, no need to be more strict. I could not use it anyway in the next step, when trying to bound y and z.
$endgroup$
– elias
Mar 19 at 9:22
$begingroup$
I'm not stating that $|3x+2|le24$ is equivalent with $|x|le8$. I'm just saying the latter is a consequence of the former.
$endgroup$
– elias
Mar 19 at 9:27
$begingroup$
So you claim that $|3x+2|le24$ doesn't cause $|x|le8$? Could you provide a counterexample? I mean an $x$ that fulfills the first, but does not fulfill the second?
$endgroup$
– elias
Mar 19 at 9:33
$begingroup$
@JonMarkPerry, but if x=-8, |3x+2|=22
$endgroup$
– elias
Mar 19 at 9:16
$begingroup$
@JonMarkPerry, but if x=-8, |3x+2|=22
$endgroup$
– elias
Mar 19 at 9:16
$begingroup$
For my proof, the bound |x|<=8 is enough, no need to be more strict. I could not use it anyway in the next step, when trying to bound y and z.
$endgroup$
– elias
Mar 19 at 9:22
$begingroup$
For my proof, the bound |x|<=8 is enough, no need to be more strict. I could not use it anyway in the next step, when trying to bound y and z.
$endgroup$
– elias
Mar 19 at 9:22
$begingroup$
I'm not stating that $|3x+2|le24$ is equivalent with $|x|le8$. I'm just saying the latter is a consequence of the former.
$endgroup$
– elias
Mar 19 at 9:27
$begingroup$
I'm not stating that $|3x+2|le24$ is equivalent with $|x|le8$. I'm just saying the latter is a consequence of the former.
$endgroup$
– elias
Mar 19 at 9:27
$begingroup$
So you claim that $|3x+2|le24$ doesn't cause $|x|le8$? Could you provide a counterexample? I mean an $x$ that fulfills the first, but does not fulfill the second?
$endgroup$
– elias
Mar 19 at 9:33
$begingroup$
So you claim that $|3x+2|le24$ doesn't cause $|x|le8$? Could you provide a counterexample? I mean an $x$ that fulfills the first, but does not fulfill the second?
$endgroup$
– elias
Mar 19 at 9:33
add a comment |
Thanks for contributing an answer to Puzzling 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%2fpuzzling.stackexchange.com%2fquestions%2f80810%2fzero-one-two-three-etc%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