One-digit products in a row of numbersCan you fill a 3x3 grid with these numbers so the products of the rows and columns are the same?Increasing rows and columnsWhat is my four digit car number?Four-by-four table with equal row and column products90s Number PuzzleIn a square, arrange the binary numbers such that no $n$:th digit is the same along a row or columnThree-digit multiplication puzzle, part III: Return of the HexHow do I make numbers 50-100 using only the numbers 2, 0, 1, 9?Squares inside a square
Need Improvement on Script Which Continuously Tests Website
How to stop the death waves in my city?
Practicality of 30 year fixed mortgage at 55 years of age
Intheritance at package visibility in Java
Is the order of words purely based on convention?
Two side-by-side squares are inscribed in a semicircle. The diameter of the semicircle is 16. What is the sum of the two squares' areas?
We are on WHV, my boyfriend was in a small collision, we are leaving in 2 weeks what happens if we don’t pay the damages?
How can I tell the difference between fishing for rolls and being involved?
Clear text passwords in Unix
Align all symbols in a LaTeX equation
What is the white pattern on trim wheel for?
Help in drawing resonance structures in case of polybasic acids
MaxDetect speed
Should the average user with no special access rights be worried about SMS-based 2FA being theoretically interceptable?
Difference between "rip up" and "rip down"
What would influence an alien race to map their planet in a way other than the traditional map of the Earth
Why weren't the Death Star plans transmitted electronically?
Why does my browser attempt to download pages from http://clhs.lisp.se instead of viewing them normally?
Windows 10 deletes lots of tiny files super slowly. Anything that can be done to speed it up?
Why was Logo created?
Another student has been assigned the same MSc thesis as mine (and already defended)
Why would an airline put 15 passengers at once on standby?
Convert a string of digits from words to an integer
Youtube not blocked by iptables
One-digit products in a row of numbers
Can you fill a 3x3 grid with these numbers so the products of the rows and columns are the same?Increasing rows and columnsWhat is my four digit car number?Four-by-four table with equal row and column products90s Number PuzzleIn a square, arrange the binary numbers such that no $n$:th digit is the same along a row or columnThree-digit multiplication puzzle, part III: Return of the HexHow do I make numbers 50-100 using only the numbers 2, 0, 1, 9?Squares inside a square
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
The digits from 1 to 9 can be arranged in a row, such that any two
neighbouring digits in this row is the product of two one-digit numbers.
Arrangement:
$$728163549$$
Is it possible to do such an arrangement using hexadecimal digits 1-9 and A-F?
Here the row has 15 digits and all numbers are treated as hexadecimal numbers.
Example: 123456789ABCDEF
12=2*9, 23=5*7, 34=4*D, 45 does not work, etc.
mathematics calculation-puzzle
$endgroup$
add a comment
|
$begingroup$
The digits from 1 to 9 can be arranged in a row, such that any two
neighbouring digits in this row is the product of two one-digit numbers.
Arrangement:
$$728163549$$
Is it possible to do such an arrangement using hexadecimal digits 1-9 and A-F?
Here the row has 15 digits and all numbers are treated as hexadecimal numbers.
Example: 123456789ABCDEF
12=2*9, 23=5*7, 34=4*D, 45 does not work, etc.
mathematics calculation-puzzle
$endgroup$
add a comment
|
$begingroup$
The digits from 1 to 9 can be arranged in a row, such that any two
neighbouring digits in this row is the product of two one-digit numbers.
Arrangement:
$$728163549$$
Is it possible to do such an arrangement using hexadecimal digits 1-9 and A-F?
Here the row has 15 digits and all numbers are treated as hexadecimal numbers.
Example: 123456789ABCDEF
12=2*9, 23=5*7, 34=4*D, 45 does not work, etc.
mathematics calculation-puzzle
$endgroup$
The digits from 1 to 9 can be arranged in a row, such that any two
neighbouring digits in this row is the product of two one-digit numbers.
Arrangement:
$$728163549$$
Is it possible to do such an arrangement using hexadecimal digits 1-9 and A-F?
Here the row has 15 digits and all numbers are treated as hexadecimal numbers.
Example: 123456789ABCDEF
12=2*9, 23=5*7, 34=4*D, 45 does not work, etc.
mathematics calculation-puzzle
mathematics calculation-puzzle
edited 9 hours ago
JMP
25.8k6 gold badges49 silver badges111 bronze badges
25.8k6 gold badges49 silver badges111 bronze badges
asked 9 hours ago
ThomasLThomasL
7902 silver badges19 bronze badges
7902 silver badges19 bronze badges
add a comment
|
add a comment
|
2 Answers
2
active
oldest
votes
$begingroup$
One solution is
$$D2379A5B6C4E18F$$
Thought process:
No product starts with $F$, so $F$ must be at the end, and the only options are $3F$ and $8F$.
The only $2$-digit numbers that are products of $1$-digit number and start with digits $A, B, C, D, E$ are $$A5, A8, A9, B4, B6, C3, C4, D2, E1.$$
Therefore we must have subsequences $E1$ and $D2$.
From this, you quickly get an answer by looking at the above table. I don't know if I was lucky, but apart from the observations above, I guessed all the rest right. Just for the sake of it, here is another one: $$D24E1879A5B6C3F$$
$endgroup$
add a comment
|
$begingroup$
As an addendum to the answer from @Arnaud:
The smallest such number is 375B6E19C4D2A8F.
According to the brute-force program I made, there are just $787$ solutions.
$endgroup$
add a comment
|
Your Answer
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/4.0/"u003ecc by-sa 4.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%2f89413%2fone-digit-products-in-a-row-of-numbers%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
One solution is
$$D2379A5B6C4E18F$$
Thought process:
No product starts with $F$, so $F$ must be at the end, and the only options are $3F$ and $8F$.
The only $2$-digit numbers that are products of $1$-digit number and start with digits $A, B, C, D, E$ are $$A5, A8, A9, B4, B6, C3, C4, D2, E1.$$
Therefore we must have subsequences $E1$ and $D2$.
From this, you quickly get an answer by looking at the above table. I don't know if I was lucky, but apart from the observations above, I guessed all the rest right. Just for the sake of it, here is another one: $$D24E1879A5B6C3F$$
$endgroup$
add a comment
|
$begingroup$
One solution is
$$D2379A5B6C4E18F$$
Thought process:
No product starts with $F$, so $F$ must be at the end, and the only options are $3F$ and $8F$.
The only $2$-digit numbers that are products of $1$-digit number and start with digits $A, B, C, D, E$ are $$A5, A8, A9, B4, B6, C3, C4, D2, E1.$$
Therefore we must have subsequences $E1$ and $D2$.
From this, you quickly get an answer by looking at the above table. I don't know if I was lucky, but apart from the observations above, I guessed all the rest right. Just for the sake of it, here is another one: $$D24E1879A5B6C3F$$
$endgroup$
add a comment
|
$begingroup$
One solution is
$$D2379A5B6C4E18F$$
Thought process:
No product starts with $F$, so $F$ must be at the end, and the only options are $3F$ and $8F$.
The only $2$-digit numbers that are products of $1$-digit number and start with digits $A, B, C, D, E$ are $$A5, A8, A9, B4, B6, C3, C4, D2, E1.$$
Therefore we must have subsequences $E1$ and $D2$.
From this, you quickly get an answer by looking at the above table. I don't know if I was lucky, but apart from the observations above, I guessed all the rest right. Just for the sake of it, here is another one: $$D24E1879A5B6C3F$$
$endgroup$
One solution is
$$D2379A5B6C4E18F$$
Thought process:
No product starts with $F$, so $F$ must be at the end, and the only options are $3F$ and $8F$.
The only $2$-digit numbers that are products of $1$-digit number and start with digits $A, B, C, D, E$ are $$A5, A8, A9, B4, B6, C3, C4, D2, E1.$$
Therefore we must have subsequences $E1$ and $D2$.
From this, you quickly get an answer by looking at the above table. I don't know if I was lucky, but apart from the observations above, I guessed all the rest right. Just for the sake of it, here is another one: $$D24E1879A5B6C3F$$
edited 8 hours ago
answered 8 hours ago
Arnaud MortierArnaud Mortier
5,76913 silver badges49 bronze badges
5,76913 silver badges49 bronze badges
add a comment
|
add a comment
|
$begingroup$
As an addendum to the answer from @Arnaud:
The smallest such number is 375B6E19C4D2A8F.
According to the brute-force program I made, there are just $787$ solutions.
$endgroup$
add a comment
|
$begingroup$
As an addendum to the answer from @Arnaud:
The smallest such number is 375B6E19C4D2A8F.
According to the brute-force program I made, there are just $787$ solutions.
$endgroup$
add a comment
|
$begingroup$
As an addendum to the answer from @Arnaud:
The smallest such number is 375B6E19C4D2A8F.
According to the brute-force program I made, there are just $787$ solutions.
$endgroup$
As an addendum to the answer from @Arnaud:
The smallest such number is 375B6E19C4D2A8F.
According to the brute-force program I made, there are just $787$ solutions.
edited 8 hours ago
answered 8 hours ago
JensJens
3966 bronze badges
3966 bronze badges
add a comment
|
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%2f89413%2fone-digit-products-in-a-row-of-numbers%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