Please figure out this Pan digital PrinceIt is as easy as A B C, Figure out U V C from the given relationshipFind the values of U, V, C based on the given relationship…useful for upcoming puzzlesFind this Unique UVC Palindrome ( ignoring signs and decimal) from Given Fractional RelationshipPalindromic Pan digital Special Square wants you to reveal its RootFamous Number Displays Dual Cubic Relationships..Figure it outFind the three digit Prime number P from the given unusual relationshipsUVC wants to give you a Helping Hand in Solving these Unique Set of Pan digital Fractional-Decimal RelationsWe are Unique Friends. Our Special Squares Share a Common Bond…Figure us outDevil goes Pan Digital..Sometimes Lucky..Sometimes not..Figure him outFrom the given Square - Factorial Relationship, deduce the unknowns
Do French speakers not use the subjunctive informally?
Should I tell my insurance company I'm making payments on my new car?
Does the UK have a written constitution?
Was touching your nose a greeting in second millenium Mesopotamia?
How to positively portray high and mighty characters?
Short story with brother-sister conjoined twins as protagonists?
Analog is Obtuse!
Is my Rep in Stack-Exchange Form?
Does anycast addressing add additional latency in any way?
Does the Paladin's Aura of Protection affect only either her or ONE ally in range?
How to get cool night-vision without lame drawbacks?
Layout of complex table
Mount a folder with a space on Linux
Averting Real Women Don’t Wear Dresses
Why does adding parentheses prevent an error?
How can I convince my reader that I will not use a certain trope?
"Strength" of free falling objects' ground-impact
Fitting a mixture of two normal distributions for a data set?
Pull-up sequence accumulator counter
How well known and how commonly used was Huffman coding in 1979?
Why is C++ initial allocation so much larger than C's?
What is the line crossing the Pacific Ocean that is shown on maps?
Why is the Turkish president's surname spelt in Russian as Эрдоган, with г?
Should I hide continue button until tasks are completed?
Please figure out this Pan digital Prince
It is as easy as A B C, Figure out U V C from the given relationshipFind the values of U, V, C based on the given relationship…useful for upcoming puzzlesFind this Unique UVC Palindrome ( ignoring signs and decimal) from Given Fractional RelationshipPalindromic Pan digital Special Square wants you to reveal its RootFamous Number Displays Dual Cubic Relationships..Figure it outFind the three digit Prime number P from the given unusual relationshipsUVC wants to give you a Helping Hand in Solving these Unique Set of Pan digital Fractional-Decimal RelationsWe are Unique Friends. Our Special Squares Share a Common Bond…Figure us outDevil goes Pan Digital..Sometimes Lucky..Sometimes not..Figure him outFrom the given Square - Factorial Relationship, deduce the unknowns
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
Given:
P, R, I, N, C, E, T, O, M are all distinct digits varying from 1 to 9.
PCRON, PRINCETOM are two concatenated numbers.
PCRON is the highest possible number you can have fulfilling the following relation:
$$(PCRON)^2=PRINCETOM.$$
Please give your deductive reasoning to figure out the Pan digital Square.
Only few calculations will be needed.
mathematics logical-deduction no-computers
$endgroup$
add a comment |
$begingroup$
Given:
P, R, I, N, C, E, T, O, M are all distinct digits varying from 1 to 9.
PCRON, PRINCETOM are two concatenated numbers.
PCRON is the highest possible number you can have fulfilling the following relation:
$$(PCRON)^2=PRINCETOM.$$
Please give your deductive reasoning to figure out the Pan digital Square.
Only few calculations will be needed.
mathematics logical-deduction no-computers
$endgroup$
add a comment |
$begingroup$
Given:
P, R, I, N, C, E, T, O, M are all distinct digits varying from 1 to 9.
PCRON, PRINCETOM are two concatenated numbers.
PCRON is the highest possible number you can have fulfilling the following relation:
$$(PCRON)^2=PRINCETOM.$$
Please give your deductive reasoning to figure out the Pan digital Square.
Only few calculations will be needed.
mathematics logical-deduction no-computers
$endgroup$
Given:
P, R, I, N, C, E, T, O, M are all distinct digits varying from 1 to 9.
PCRON, PRINCETOM are two concatenated numbers.
PCRON is the highest possible number you can have fulfilling the following relation:
$$(PCRON)^2=PRINCETOM.$$
Please give your deductive reasoning to figure out the Pan digital Square.
Only few calculations will be needed.
mathematics logical-deduction no-computers
mathematics logical-deduction no-computers
edited Jun 8 at 19:04
Uvc
asked Jun 8 at 14:43
UvcUvc
2,3364 silver badges27 bronze badges
2,3364 silver badges27 bronze badges
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Size considerations (starting from the left)
$PRINCETOM<1,000,000,000Rightarrow PCRON<sqrt1,000,000,000=31,623Rightarrow Pleq3$. If $P=2$ or $P=3$, then the nine-digit number $PCRON^2$ begins with something at least 4, contradiction. So $P=1$.
$PRINCETOMleq198,765,432Rightarrow PCRONleqsqrt198,765,432=14,098Rightarrow Cleq4$. All the digits are distinct and nonzero, so in fact $Cleq3$ and $Cneq1$, i.e. $C$ must be 2 or 3.
$12,345leq PCRONleq13,987Rightarrow PRINCETOMgeq152,399,025Rightarrow Rgeq5$.
Modular considerations (starting from the right)
$N^2equiv M$ modulo 10, and $Mneq N$, so $N$ must be one of $2,3,7,8$ with $M$ being respectively one of $4,9$. (We know $Mneq1$ which means $Nneq9$.)
$(ON)^2equiv OM$ modulo 100, i.e. $20*O*N+N^2equiv 10*O+M$. So $ON$ must be one of $23,27,43,63,83$, which means $N$ must be 3 or 7 and for sure $M=9$.
Case checking
So far we have:
$P=1$, $M=9$, $C$ is 2 or 3, $N$ is 3 or 7, $R$ is 5 or 6 or 7 or 8, $O$ is 2 or 4 or 6.
Let's try
$C=3$, then $N=7$, so $O=2$, and $PCRON$ is one of $13527,13627,13827$. The squares of all three of these numbers have repeated digits, so it's impossible.
So
$C=2$, which means $O$ is 4 or 6 and $N=3$, so $PCRON$ is one of $12543,12643,12743,12843,12563,12763,12863$. Only one of these has a square with no repeated digits, namely $12543^2=157326849$.
Final answer
$P=1,C=2,N=3,O=4,R=5,E=6,I=7,T=8,M=9$.
$endgroup$
1
$begingroup$
Hat-tip to Brandon J, who saw some of these ideas before I did, but didn't make as strong deductions as he could have :-)
$endgroup$
– Rand al'Thor
Jun 8 at 18:15
$begingroup$
E is missing....that’s ok..actually if you saw the clue in the puzzle, it is only 3 step simple process. I will reveal it when I post the answer.
$endgroup$
– Uvc
Jun 8 at 18:21
$begingroup$
@Uvc Oops, added E. Presumably the clue in the puzzle is "highest possible number fulfilling"? I didn't understand why you wrote that, since there's only one possibility so no need to choose the highest.
$endgroup$
– Rand al'Thor
Jun 8 at 18:25
$begingroup$
Yes..that’s right..otherwise there are 3 more solutions..this clue makes it a cinch to figure out the number because of restricted choices
$endgroup$
– Uvc
Jun 8 at 18:32
$begingroup$
3 more solutions refer to other squares involving same 5 digits on the right..not for this one..but that clue leads to quicker resolution.
$endgroup$
– Uvc
Jun 8 at 19:32
|
show 1 more comment
$begingroup$
Partial answer that I'm saving for now
(For convenience, I will call $PCRON$ "the root" and $PRINCETOM$ "the square".
We can first deduce that the digit N
is not 6. It's a weird math thing that if you multiply two numbers that end in 6, the last number will also be 6. Since the last digit of the square is not N, then N is not six.
We can also do some quick tests to find the approximate range
of the square. $sqrt(500,000,000)$ is approximately 22,360. Since the first digit of the root and the square match, we should go lower.
Let's try that:
$sqrt(100,000,000)$ is $10,000$, so it looks like P is going to be 1.
We can then determine that C is
either 2 or 3. This is because the smallest possible 5-digit number that does not repeat digits and starts with 1 and 4 is 14,235, and $14,235*14,235$ is too big: $202,635,225$.
$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/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%2f84828%2fplease-figure-out-this-pan-digital-prince%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$
Size considerations (starting from the left)
$PRINCETOM<1,000,000,000Rightarrow PCRON<sqrt1,000,000,000=31,623Rightarrow Pleq3$. If $P=2$ or $P=3$, then the nine-digit number $PCRON^2$ begins with something at least 4, contradiction. So $P=1$.
$PRINCETOMleq198,765,432Rightarrow PCRONleqsqrt198,765,432=14,098Rightarrow Cleq4$. All the digits are distinct and nonzero, so in fact $Cleq3$ and $Cneq1$, i.e. $C$ must be 2 or 3.
$12,345leq PCRONleq13,987Rightarrow PRINCETOMgeq152,399,025Rightarrow Rgeq5$.
Modular considerations (starting from the right)
$N^2equiv M$ modulo 10, and $Mneq N$, so $N$ must be one of $2,3,7,8$ with $M$ being respectively one of $4,9$. (We know $Mneq1$ which means $Nneq9$.)
$(ON)^2equiv OM$ modulo 100, i.e. $20*O*N+N^2equiv 10*O+M$. So $ON$ must be one of $23,27,43,63,83$, which means $N$ must be 3 or 7 and for sure $M=9$.
Case checking
So far we have:
$P=1$, $M=9$, $C$ is 2 or 3, $N$ is 3 or 7, $R$ is 5 or 6 or 7 or 8, $O$ is 2 or 4 or 6.
Let's try
$C=3$, then $N=7$, so $O=2$, and $PCRON$ is one of $13527,13627,13827$. The squares of all three of these numbers have repeated digits, so it's impossible.
So
$C=2$, which means $O$ is 4 or 6 and $N=3$, so $PCRON$ is one of $12543,12643,12743,12843,12563,12763,12863$. Only one of these has a square with no repeated digits, namely $12543^2=157326849$.
Final answer
$P=1,C=2,N=3,O=4,R=5,E=6,I=7,T=8,M=9$.
$endgroup$
1
$begingroup$
Hat-tip to Brandon J, who saw some of these ideas before I did, but didn't make as strong deductions as he could have :-)
$endgroup$
– Rand al'Thor
Jun 8 at 18:15
$begingroup$
E is missing....that’s ok..actually if you saw the clue in the puzzle, it is only 3 step simple process. I will reveal it when I post the answer.
$endgroup$
– Uvc
Jun 8 at 18:21
$begingroup$
@Uvc Oops, added E. Presumably the clue in the puzzle is "highest possible number fulfilling"? I didn't understand why you wrote that, since there's only one possibility so no need to choose the highest.
$endgroup$
– Rand al'Thor
Jun 8 at 18:25
$begingroup$
Yes..that’s right..otherwise there are 3 more solutions..this clue makes it a cinch to figure out the number because of restricted choices
$endgroup$
– Uvc
Jun 8 at 18:32
$begingroup$
3 more solutions refer to other squares involving same 5 digits on the right..not for this one..but that clue leads to quicker resolution.
$endgroup$
– Uvc
Jun 8 at 19:32
|
show 1 more comment
$begingroup$
Size considerations (starting from the left)
$PRINCETOM<1,000,000,000Rightarrow PCRON<sqrt1,000,000,000=31,623Rightarrow Pleq3$. If $P=2$ or $P=3$, then the nine-digit number $PCRON^2$ begins with something at least 4, contradiction. So $P=1$.
$PRINCETOMleq198,765,432Rightarrow PCRONleqsqrt198,765,432=14,098Rightarrow Cleq4$. All the digits are distinct and nonzero, so in fact $Cleq3$ and $Cneq1$, i.e. $C$ must be 2 or 3.
$12,345leq PCRONleq13,987Rightarrow PRINCETOMgeq152,399,025Rightarrow Rgeq5$.
Modular considerations (starting from the right)
$N^2equiv M$ modulo 10, and $Mneq N$, so $N$ must be one of $2,3,7,8$ with $M$ being respectively one of $4,9$. (We know $Mneq1$ which means $Nneq9$.)
$(ON)^2equiv OM$ modulo 100, i.e. $20*O*N+N^2equiv 10*O+M$. So $ON$ must be one of $23,27,43,63,83$, which means $N$ must be 3 or 7 and for sure $M=9$.
Case checking
So far we have:
$P=1$, $M=9$, $C$ is 2 or 3, $N$ is 3 or 7, $R$ is 5 or 6 or 7 or 8, $O$ is 2 or 4 or 6.
Let's try
$C=3$, then $N=7$, so $O=2$, and $PCRON$ is one of $13527,13627,13827$. The squares of all three of these numbers have repeated digits, so it's impossible.
So
$C=2$, which means $O$ is 4 or 6 and $N=3$, so $PCRON$ is one of $12543,12643,12743,12843,12563,12763,12863$. Only one of these has a square with no repeated digits, namely $12543^2=157326849$.
Final answer
$P=1,C=2,N=3,O=4,R=5,E=6,I=7,T=8,M=9$.
$endgroup$
1
$begingroup$
Hat-tip to Brandon J, who saw some of these ideas before I did, but didn't make as strong deductions as he could have :-)
$endgroup$
– Rand al'Thor
Jun 8 at 18:15
$begingroup$
E is missing....that’s ok..actually if you saw the clue in the puzzle, it is only 3 step simple process. I will reveal it when I post the answer.
$endgroup$
– Uvc
Jun 8 at 18:21
$begingroup$
@Uvc Oops, added E. Presumably the clue in the puzzle is "highest possible number fulfilling"? I didn't understand why you wrote that, since there's only one possibility so no need to choose the highest.
$endgroup$
– Rand al'Thor
Jun 8 at 18:25
$begingroup$
Yes..that’s right..otherwise there are 3 more solutions..this clue makes it a cinch to figure out the number because of restricted choices
$endgroup$
– Uvc
Jun 8 at 18:32
$begingroup$
3 more solutions refer to other squares involving same 5 digits on the right..not for this one..but that clue leads to quicker resolution.
$endgroup$
– Uvc
Jun 8 at 19:32
|
show 1 more comment
$begingroup$
Size considerations (starting from the left)
$PRINCETOM<1,000,000,000Rightarrow PCRON<sqrt1,000,000,000=31,623Rightarrow Pleq3$. If $P=2$ or $P=3$, then the nine-digit number $PCRON^2$ begins with something at least 4, contradiction. So $P=1$.
$PRINCETOMleq198,765,432Rightarrow PCRONleqsqrt198,765,432=14,098Rightarrow Cleq4$. All the digits are distinct and nonzero, so in fact $Cleq3$ and $Cneq1$, i.e. $C$ must be 2 or 3.
$12,345leq PCRONleq13,987Rightarrow PRINCETOMgeq152,399,025Rightarrow Rgeq5$.
Modular considerations (starting from the right)
$N^2equiv M$ modulo 10, and $Mneq N$, so $N$ must be one of $2,3,7,8$ with $M$ being respectively one of $4,9$. (We know $Mneq1$ which means $Nneq9$.)
$(ON)^2equiv OM$ modulo 100, i.e. $20*O*N+N^2equiv 10*O+M$. So $ON$ must be one of $23,27,43,63,83$, which means $N$ must be 3 or 7 and for sure $M=9$.
Case checking
So far we have:
$P=1$, $M=9$, $C$ is 2 or 3, $N$ is 3 or 7, $R$ is 5 or 6 or 7 or 8, $O$ is 2 or 4 or 6.
Let's try
$C=3$, then $N=7$, so $O=2$, and $PCRON$ is one of $13527,13627,13827$. The squares of all three of these numbers have repeated digits, so it's impossible.
So
$C=2$, which means $O$ is 4 or 6 and $N=3$, so $PCRON$ is one of $12543,12643,12743,12843,12563,12763,12863$. Only one of these has a square with no repeated digits, namely $12543^2=157326849$.
Final answer
$P=1,C=2,N=3,O=4,R=5,E=6,I=7,T=8,M=9$.
$endgroup$
Size considerations (starting from the left)
$PRINCETOM<1,000,000,000Rightarrow PCRON<sqrt1,000,000,000=31,623Rightarrow Pleq3$. If $P=2$ or $P=3$, then the nine-digit number $PCRON^2$ begins with something at least 4, contradiction. So $P=1$.
$PRINCETOMleq198,765,432Rightarrow PCRONleqsqrt198,765,432=14,098Rightarrow Cleq4$. All the digits are distinct and nonzero, so in fact $Cleq3$ and $Cneq1$, i.e. $C$ must be 2 or 3.
$12,345leq PCRONleq13,987Rightarrow PRINCETOMgeq152,399,025Rightarrow Rgeq5$.
Modular considerations (starting from the right)
$N^2equiv M$ modulo 10, and $Mneq N$, so $N$ must be one of $2,3,7,8$ with $M$ being respectively one of $4,9$. (We know $Mneq1$ which means $Nneq9$.)
$(ON)^2equiv OM$ modulo 100, i.e. $20*O*N+N^2equiv 10*O+M$. So $ON$ must be one of $23,27,43,63,83$, which means $N$ must be 3 or 7 and for sure $M=9$.
Case checking
So far we have:
$P=1$, $M=9$, $C$ is 2 or 3, $N$ is 3 or 7, $R$ is 5 or 6 or 7 or 8, $O$ is 2 or 4 or 6.
Let's try
$C=3$, then $N=7$, so $O=2$, and $PCRON$ is one of $13527,13627,13827$. The squares of all three of these numbers have repeated digits, so it's impossible.
So
$C=2$, which means $O$ is 4 or 6 and $N=3$, so $PCRON$ is one of $12543,12643,12743,12843,12563,12763,12863$. Only one of these has a square with no repeated digits, namely $12543^2=157326849$.
Final answer
$P=1,C=2,N=3,O=4,R=5,E=6,I=7,T=8,M=9$.
edited Jun 8 at 18:24
answered Jun 8 at 18:14
Rand al'ThorRand al'Thor
73.9k15 gold badges244 silver badges490 bronze badges
73.9k15 gold badges244 silver badges490 bronze badges
1
$begingroup$
Hat-tip to Brandon J, who saw some of these ideas before I did, but didn't make as strong deductions as he could have :-)
$endgroup$
– Rand al'Thor
Jun 8 at 18:15
$begingroup$
E is missing....that’s ok..actually if you saw the clue in the puzzle, it is only 3 step simple process. I will reveal it when I post the answer.
$endgroup$
– Uvc
Jun 8 at 18:21
$begingroup$
@Uvc Oops, added E. Presumably the clue in the puzzle is "highest possible number fulfilling"? I didn't understand why you wrote that, since there's only one possibility so no need to choose the highest.
$endgroup$
– Rand al'Thor
Jun 8 at 18:25
$begingroup$
Yes..that’s right..otherwise there are 3 more solutions..this clue makes it a cinch to figure out the number because of restricted choices
$endgroup$
– Uvc
Jun 8 at 18:32
$begingroup$
3 more solutions refer to other squares involving same 5 digits on the right..not for this one..but that clue leads to quicker resolution.
$endgroup$
– Uvc
Jun 8 at 19:32
|
show 1 more comment
1
$begingroup$
Hat-tip to Brandon J, who saw some of these ideas before I did, but didn't make as strong deductions as he could have :-)
$endgroup$
– Rand al'Thor
Jun 8 at 18:15
$begingroup$
E is missing....that’s ok..actually if you saw the clue in the puzzle, it is only 3 step simple process. I will reveal it when I post the answer.
$endgroup$
– Uvc
Jun 8 at 18:21
$begingroup$
@Uvc Oops, added E. Presumably the clue in the puzzle is "highest possible number fulfilling"? I didn't understand why you wrote that, since there's only one possibility so no need to choose the highest.
$endgroup$
– Rand al'Thor
Jun 8 at 18:25
$begingroup$
Yes..that’s right..otherwise there are 3 more solutions..this clue makes it a cinch to figure out the number because of restricted choices
$endgroup$
– Uvc
Jun 8 at 18:32
$begingroup$
3 more solutions refer to other squares involving same 5 digits on the right..not for this one..but that clue leads to quicker resolution.
$endgroup$
– Uvc
Jun 8 at 19:32
1
1
$begingroup$
Hat-tip to Brandon J, who saw some of these ideas before I did, but didn't make as strong deductions as he could have :-)
$endgroup$
– Rand al'Thor
Jun 8 at 18:15
$begingroup$
Hat-tip to Brandon J, who saw some of these ideas before I did, but didn't make as strong deductions as he could have :-)
$endgroup$
– Rand al'Thor
Jun 8 at 18:15
$begingroup$
E is missing....that’s ok..actually if you saw the clue in the puzzle, it is only 3 step simple process. I will reveal it when I post the answer.
$endgroup$
– Uvc
Jun 8 at 18:21
$begingroup$
E is missing....that’s ok..actually if you saw the clue in the puzzle, it is only 3 step simple process. I will reveal it when I post the answer.
$endgroup$
– Uvc
Jun 8 at 18:21
$begingroup$
@Uvc Oops, added E. Presumably the clue in the puzzle is "highest possible number fulfilling"? I didn't understand why you wrote that, since there's only one possibility so no need to choose the highest.
$endgroup$
– Rand al'Thor
Jun 8 at 18:25
$begingroup$
@Uvc Oops, added E. Presumably the clue in the puzzle is "highest possible number fulfilling"? I didn't understand why you wrote that, since there's only one possibility so no need to choose the highest.
$endgroup$
– Rand al'Thor
Jun 8 at 18:25
$begingroup$
Yes..that’s right..otherwise there are 3 more solutions..this clue makes it a cinch to figure out the number because of restricted choices
$endgroup$
– Uvc
Jun 8 at 18:32
$begingroup$
Yes..that’s right..otherwise there are 3 more solutions..this clue makes it a cinch to figure out the number because of restricted choices
$endgroup$
– Uvc
Jun 8 at 18:32
$begingroup$
3 more solutions refer to other squares involving same 5 digits on the right..not for this one..but that clue leads to quicker resolution.
$endgroup$
– Uvc
Jun 8 at 19:32
$begingroup$
3 more solutions refer to other squares involving same 5 digits on the right..not for this one..but that clue leads to quicker resolution.
$endgroup$
– Uvc
Jun 8 at 19:32
|
show 1 more comment
$begingroup$
Partial answer that I'm saving for now
(For convenience, I will call $PCRON$ "the root" and $PRINCETOM$ "the square".
We can first deduce that the digit N
is not 6. It's a weird math thing that if you multiply two numbers that end in 6, the last number will also be 6. Since the last digit of the square is not N, then N is not six.
We can also do some quick tests to find the approximate range
of the square. $sqrt(500,000,000)$ is approximately 22,360. Since the first digit of the root and the square match, we should go lower.
Let's try that:
$sqrt(100,000,000)$ is $10,000$, so it looks like P is going to be 1.
We can then determine that C is
either 2 or 3. This is because the smallest possible 5-digit number that does not repeat digits and starts with 1 and 4 is 14,235, and $14,235*14,235$ is too big: $202,635,225$.
$endgroup$
add a comment |
$begingroup$
Partial answer that I'm saving for now
(For convenience, I will call $PCRON$ "the root" and $PRINCETOM$ "the square".
We can first deduce that the digit N
is not 6. It's a weird math thing that if you multiply two numbers that end in 6, the last number will also be 6. Since the last digit of the square is not N, then N is not six.
We can also do some quick tests to find the approximate range
of the square. $sqrt(500,000,000)$ is approximately 22,360. Since the first digit of the root and the square match, we should go lower.
Let's try that:
$sqrt(100,000,000)$ is $10,000$, so it looks like P is going to be 1.
We can then determine that C is
either 2 or 3. This is because the smallest possible 5-digit number that does not repeat digits and starts with 1 and 4 is 14,235, and $14,235*14,235$ is too big: $202,635,225$.
$endgroup$
add a comment |
$begingroup$
Partial answer that I'm saving for now
(For convenience, I will call $PCRON$ "the root" and $PRINCETOM$ "the square".
We can first deduce that the digit N
is not 6. It's a weird math thing that if you multiply two numbers that end in 6, the last number will also be 6. Since the last digit of the square is not N, then N is not six.
We can also do some quick tests to find the approximate range
of the square. $sqrt(500,000,000)$ is approximately 22,360. Since the first digit of the root and the square match, we should go lower.
Let's try that:
$sqrt(100,000,000)$ is $10,000$, so it looks like P is going to be 1.
We can then determine that C is
either 2 or 3. This is because the smallest possible 5-digit number that does not repeat digits and starts with 1 and 4 is 14,235, and $14,235*14,235$ is too big: $202,635,225$.
$endgroup$
Partial answer that I'm saving for now
(For convenience, I will call $PCRON$ "the root" and $PRINCETOM$ "the square".
We can first deduce that the digit N
is not 6. It's a weird math thing that if you multiply two numbers that end in 6, the last number will also be 6. Since the last digit of the square is not N, then N is not six.
We can also do some quick tests to find the approximate range
of the square. $sqrt(500,000,000)$ is approximately 22,360. Since the first digit of the root and the square match, we should go lower.
Let's try that:
$sqrt(100,000,000)$ is $10,000$, so it looks like P is going to be 1.
We can then determine that C is
either 2 or 3. This is because the smallest possible 5-digit number that does not repeat digits and starts with 1 and 4 is 14,235, and $14,235*14,235$ is too big: $202,635,225$.
answered Jun 8 at 15:29
Brandon_JBrandon_J
4,9355 silver badges54 bronze badges
4,9355 silver badges54 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%2f84828%2fplease-figure-out-this-pan-digital-prince%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