A transfinite epistemic logic puzzle: what numbers did Cheryl give to Albert and Bernard?
$begingroup$
I expect that nearly everyone here at stackexchange is by now familiar with Cheryl's birthday problem, which spawned many variant problems, including a transfinite version due to Timothy Gowers.
In response, I have made my own transfinite epistemic logic puzzle, Cheryl's rational gift, which appears below. Can you solve it?

Cheryl Welcome, Albert and Bernard, to my birthday party, and I thank you for your gifts. To return the favor, as you entered my party, I privately made known to each of you a rational number of the form $$n-frac{1}{2^k}-frac{1}{2^{k+r}},$$ where $n$ and $k$ are positive integers and $r$ is a non-negative integer; please consider it my gift to each of you. Your numbers are different from each other, and you have received no other information about these numbers or anyone's knowledge about them beyond what I am now telling you. Let me ask, who of you has the larger number?
Albert I don't know.
Bernard Neither do I.
Albert Indeed, I still do not know.
Bernard And still neither do I.
Cheryl Well, it is no use to continue that way! I can tell you that no matter how long you continue that back-and-forth, you shall not come to know who has the larger number.
Albert What interesting new information! But alas, I still do not know whose number is larger.
Bernard And still also I do not know.
Albert I continue not to know.
Bernard I regret that I also do not know.
Cheryl Let me say once again that no matter how long you continue truthfully to tell each other in succession that you do not yet know, you will not know who has the larger number.
Albert Well, thank you very much for saving us from that tiresome trouble! But unfortunately, I still do not know who has the larger number.
Bernard And also I remain in ignorance. However shall we come to know?
Cheryl Well, in fact, no matter how long we three continue from now in the pattern we have followed so far---namely, the pattern in which you two state back-and-forth that still you do not yet know whose number is larger and then I tell you yet again that no further amount of that back-and-forth will enable you to know---then still after as much repetition of that pattern as we can stand, you will not know whose number is larger! Furthermore, I could make that same statement a second time, even after now that I have said it to you once, and it would still be true. And a third and fourth as well! Indeed, I could make that same pronouncement a hundred times altogether in succession (counting my first time as amongst the one hundred), and it would be true every time. And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!
Albert Such powerful new information! But I am very sorry to say that still I do not know whose number is larger.
Bernard And also I do not know.
Albert But wait! It suddenly comes upon me after Bernard's last remark, that finally I know who has the larger number!
Bernard Really? In that case, then I also know, and what is more, I know both of our numbers!
Albert Well, now I also know them!
Question. What numbers did Cheryl give to Albert and Bernard?
There are many remarks and solution proposals posted already as comments on my blog, but the solutions proposed there do not all agree with one another.
I shall post a solution there in a few days time, but I thought people here at Math.SE might enjoy the puzzle. I apologize if some find this question to be an inappropriate use of this site.
You may also want to see my earlier transfinite epistemic logic puzzles, with solutions there.
logic ordinals
$endgroup$
|
show 1 more comment
$begingroup$
I expect that nearly everyone here at stackexchange is by now familiar with Cheryl's birthday problem, which spawned many variant problems, including a transfinite version due to Timothy Gowers.
In response, I have made my own transfinite epistemic logic puzzle, Cheryl's rational gift, which appears below. Can you solve it?

Cheryl Welcome, Albert and Bernard, to my birthday party, and I thank you for your gifts. To return the favor, as you entered my party, I privately made known to each of you a rational number of the form $$n-frac{1}{2^k}-frac{1}{2^{k+r}},$$ where $n$ and $k$ are positive integers and $r$ is a non-negative integer; please consider it my gift to each of you. Your numbers are different from each other, and you have received no other information about these numbers or anyone's knowledge about them beyond what I am now telling you. Let me ask, who of you has the larger number?
Albert I don't know.
Bernard Neither do I.
Albert Indeed, I still do not know.
Bernard And still neither do I.
Cheryl Well, it is no use to continue that way! I can tell you that no matter how long you continue that back-and-forth, you shall not come to know who has the larger number.
Albert What interesting new information! But alas, I still do not know whose number is larger.
Bernard And still also I do not know.
Albert I continue not to know.
Bernard I regret that I also do not know.
Cheryl Let me say once again that no matter how long you continue truthfully to tell each other in succession that you do not yet know, you will not know who has the larger number.
Albert Well, thank you very much for saving us from that tiresome trouble! But unfortunately, I still do not know who has the larger number.
Bernard And also I remain in ignorance. However shall we come to know?
Cheryl Well, in fact, no matter how long we three continue from now in the pattern we have followed so far---namely, the pattern in which you two state back-and-forth that still you do not yet know whose number is larger and then I tell you yet again that no further amount of that back-and-forth will enable you to know---then still after as much repetition of that pattern as we can stand, you will not know whose number is larger! Furthermore, I could make that same statement a second time, even after now that I have said it to you once, and it would still be true. And a third and fourth as well! Indeed, I could make that same pronouncement a hundred times altogether in succession (counting my first time as amongst the one hundred), and it would be true every time. And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!
Albert Such powerful new information! But I am very sorry to say that still I do not know whose number is larger.
Bernard And also I do not know.
Albert But wait! It suddenly comes upon me after Bernard's last remark, that finally I know who has the larger number!
Bernard Really? In that case, then I also know, and what is more, I know both of our numbers!
Albert Well, now I also know them!
Question. What numbers did Cheryl give to Albert and Bernard?
There are many remarks and solution proposals posted already as comments on my blog, but the solutions proposed there do not all agree with one another.
I shall post a solution there in a few days time, but I thought people here at Math.SE might enjoy the puzzle. I apologize if some find this question to be an inappropriate use of this site.
You may also want to see my earlier transfinite epistemic logic puzzles, with solutions there.
logic ordinals
$endgroup$
$begingroup$
I gather from the tag description that the (puzzle) tag is not used for questions like this?
$endgroup$
– JDH
Apr 19 '15 at 1:29
$begingroup$
So... What ordinal would you give to a problem like this? $omega^2100$? And does the set of numbers of the form $n-dfrac1{2^k}-dfrac1{2^{k+r}}$ have order-type $omega^3$?
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 14:01
$begingroup$
@columbus8myhw Yes, Cheryl's set of numbers has order type $omega^3$ altogether, since between each pair of natural numbers, there are $omega$ many increasing $omega$-sequences, and so we have $omega$ many copies of $omega^2$.
$endgroup$
– JDH
Apr 19 '15 at 14:58
1
$begingroup$
@JDH: Nice problem!
$endgroup$
– Hanno
Apr 19 '15 at 15:15
$begingroup$
In the last sentence: "And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!", does she claim that they both don't know or that they don't both know?
$endgroup$
– Florian F
May 1 '15 at 11:00
|
show 1 more comment
$begingroup$
I expect that nearly everyone here at stackexchange is by now familiar with Cheryl's birthday problem, which spawned many variant problems, including a transfinite version due to Timothy Gowers.
In response, I have made my own transfinite epistemic logic puzzle, Cheryl's rational gift, which appears below. Can you solve it?

Cheryl Welcome, Albert and Bernard, to my birthday party, and I thank you for your gifts. To return the favor, as you entered my party, I privately made known to each of you a rational number of the form $$n-frac{1}{2^k}-frac{1}{2^{k+r}},$$ where $n$ and $k$ are positive integers and $r$ is a non-negative integer; please consider it my gift to each of you. Your numbers are different from each other, and you have received no other information about these numbers or anyone's knowledge about them beyond what I am now telling you. Let me ask, who of you has the larger number?
Albert I don't know.
Bernard Neither do I.
Albert Indeed, I still do not know.
Bernard And still neither do I.
Cheryl Well, it is no use to continue that way! I can tell you that no matter how long you continue that back-and-forth, you shall not come to know who has the larger number.
Albert What interesting new information! But alas, I still do not know whose number is larger.
Bernard And still also I do not know.
Albert I continue not to know.
Bernard I regret that I also do not know.
Cheryl Let me say once again that no matter how long you continue truthfully to tell each other in succession that you do not yet know, you will not know who has the larger number.
Albert Well, thank you very much for saving us from that tiresome trouble! But unfortunately, I still do not know who has the larger number.
Bernard And also I remain in ignorance. However shall we come to know?
Cheryl Well, in fact, no matter how long we three continue from now in the pattern we have followed so far---namely, the pattern in which you two state back-and-forth that still you do not yet know whose number is larger and then I tell you yet again that no further amount of that back-and-forth will enable you to know---then still after as much repetition of that pattern as we can stand, you will not know whose number is larger! Furthermore, I could make that same statement a second time, even after now that I have said it to you once, and it would still be true. And a third and fourth as well! Indeed, I could make that same pronouncement a hundred times altogether in succession (counting my first time as amongst the one hundred), and it would be true every time. And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!
Albert Such powerful new information! But I am very sorry to say that still I do not know whose number is larger.
Bernard And also I do not know.
Albert But wait! It suddenly comes upon me after Bernard's last remark, that finally I know who has the larger number!
Bernard Really? In that case, then I also know, and what is more, I know both of our numbers!
Albert Well, now I also know them!
Question. What numbers did Cheryl give to Albert and Bernard?
There are many remarks and solution proposals posted already as comments on my blog, but the solutions proposed there do not all agree with one another.
I shall post a solution there in a few days time, but I thought people here at Math.SE might enjoy the puzzle. I apologize if some find this question to be an inappropriate use of this site.
You may also want to see my earlier transfinite epistemic logic puzzles, with solutions there.
logic ordinals
$endgroup$
I expect that nearly everyone here at stackexchange is by now familiar with Cheryl's birthday problem, which spawned many variant problems, including a transfinite version due to Timothy Gowers.
In response, I have made my own transfinite epistemic logic puzzle, Cheryl's rational gift, which appears below. Can you solve it?

Cheryl Welcome, Albert and Bernard, to my birthday party, and I thank you for your gifts. To return the favor, as you entered my party, I privately made known to each of you a rational number of the form $$n-frac{1}{2^k}-frac{1}{2^{k+r}},$$ where $n$ and $k$ are positive integers and $r$ is a non-negative integer; please consider it my gift to each of you. Your numbers are different from each other, and you have received no other information about these numbers or anyone's knowledge about them beyond what I am now telling you. Let me ask, who of you has the larger number?
Albert I don't know.
Bernard Neither do I.
Albert Indeed, I still do not know.
Bernard And still neither do I.
Cheryl Well, it is no use to continue that way! I can tell you that no matter how long you continue that back-and-forth, you shall not come to know who has the larger number.
Albert What interesting new information! But alas, I still do not know whose number is larger.
Bernard And still also I do not know.
Albert I continue not to know.
Bernard I regret that I also do not know.
Cheryl Let me say once again that no matter how long you continue truthfully to tell each other in succession that you do not yet know, you will not know who has the larger number.
Albert Well, thank you very much for saving us from that tiresome trouble! But unfortunately, I still do not know who has the larger number.
Bernard And also I remain in ignorance. However shall we come to know?
Cheryl Well, in fact, no matter how long we three continue from now in the pattern we have followed so far---namely, the pattern in which you two state back-and-forth that still you do not yet know whose number is larger and then I tell you yet again that no further amount of that back-and-forth will enable you to know---then still after as much repetition of that pattern as we can stand, you will not know whose number is larger! Furthermore, I could make that same statement a second time, even after now that I have said it to you once, and it would still be true. And a third and fourth as well! Indeed, I could make that same pronouncement a hundred times altogether in succession (counting my first time as amongst the one hundred), and it would be true every time. And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!
Albert Such powerful new information! But I am very sorry to say that still I do not know whose number is larger.
Bernard And also I do not know.
Albert But wait! It suddenly comes upon me after Bernard's last remark, that finally I know who has the larger number!
Bernard Really? In that case, then I also know, and what is more, I know both of our numbers!
Albert Well, now I also know them!
Question. What numbers did Cheryl give to Albert and Bernard?
There are many remarks and solution proposals posted already as comments on my blog, but the solutions proposed there do not all agree with one another.
I shall post a solution there in a few days time, but I thought people here at Math.SE might enjoy the puzzle. I apologize if some find this question to be an inappropriate use of this site.
You may also want to see my earlier transfinite epistemic logic puzzles, with solutions there.
logic ordinals
logic ordinals
edited Dec 24 '18 at 9:22
Glorfindel
3,41381930
3,41381930
asked Apr 19 '15 at 1:10
JDHJDH
33k682148
33k682148
$begingroup$
I gather from the tag description that the (puzzle) tag is not used for questions like this?
$endgroup$
– JDH
Apr 19 '15 at 1:29
$begingroup$
So... What ordinal would you give to a problem like this? $omega^2100$? And does the set of numbers of the form $n-dfrac1{2^k}-dfrac1{2^{k+r}}$ have order-type $omega^3$?
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 14:01
$begingroup$
@columbus8myhw Yes, Cheryl's set of numbers has order type $omega^3$ altogether, since between each pair of natural numbers, there are $omega$ many increasing $omega$-sequences, and so we have $omega$ many copies of $omega^2$.
$endgroup$
– JDH
Apr 19 '15 at 14:58
1
$begingroup$
@JDH: Nice problem!
$endgroup$
– Hanno
Apr 19 '15 at 15:15
$begingroup$
In the last sentence: "And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!", does she claim that they both don't know or that they don't both know?
$endgroup$
– Florian F
May 1 '15 at 11:00
|
show 1 more comment
$begingroup$
I gather from the tag description that the (puzzle) tag is not used for questions like this?
$endgroup$
– JDH
Apr 19 '15 at 1:29
$begingroup$
So... What ordinal would you give to a problem like this? $omega^2100$? And does the set of numbers of the form $n-dfrac1{2^k}-dfrac1{2^{k+r}}$ have order-type $omega^3$?
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 14:01
$begingroup$
@columbus8myhw Yes, Cheryl's set of numbers has order type $omega^3$ altogether, since between each pair of natural numbers, there are $omega$ many increasing $omega$-sequences, and so we have $omega$ many copies of $omega^2$.
$endgroup$
– JDH
Apr 19 '15 at 14:58
1
$begingroup$
@JDH: Nice problem!
$endgroup$
– Hanno
Apr 19 '15 at 15:15
$begingroup$
In the last sentence: "And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!", does she claim that they both don't know or that they don't both know?
$endgroup$
– Florian F
May 1 '15 at 11:00
$begingroup$
I gather from the tag description that the (puzzle) tag is not used for questions like this?
$endgroup$
– JDH
Apr 19 '15 at 1:29
$begingroup$
I gather from the tag description that the (puzzle) tag is not used for questions like this?
$endgroup$
– JDH
Apr 19 '15 at 1:29
$begingroup$
So... What ordinal would you give to a problem like this? $omega^2100$? And does the set of numbers of the form $n-dfrac1{2^k}-dfrac1{2^{k+r}}$ have order-type $omega^3$?
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 14:01
$begingroup$
So... What ordinal would you give to a problem like this? $omega^2100$? And does the set of numbers of the form $n-dfrac1{2^k}-dfrac1{2^{k+r}}$ have order-type $omega^3$?
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 14:01
$begingroup$
@columbus8myhw Yes, Cheryl's set of numbers has order type $omega^3$ altogether, since between each pair of natural numbers, there are $omega$ many increasing $omega$-sequences, and so we have $omega$ many copies of $omega^2$.
$endgroup$
– JDH
Apr 19 '15 at 14:58
$begingroup$
@columbus8myhw Yes, Cheryl's set of numbers has order type $omega^3$ altogether, since between each pair of natural numbers, there are $omega$ many increasing $omega$-sequences, and so we have $omega$ many copies of $omega^2$.
$endgroup$
– JDH
Apr 19 '15 at 14:58
1
1
$begingroup$
@JDH: Nice problem!
$endgroup$
– Hanno
Apr 19 '15 at 15:15
$begingroup$
@JDH: Nice problem!
$endgroup$
– Hanno
Apr 19 '15 at 15:15
$begingroup$
In the last sentence: "And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!", does she claim that they both don't know or that they don't both know?
$endgroup$
– Florian F
May 1 '15 at 11:00
$begingroup$
In the last sentence: "And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!", does she claim that they both don't know or that they don't both know?
$endgroup$
– Florian F
May 1 '15 at 11:00
|
show 1 more comment
3 Answers
3
active
oldest
votes
$begingroup$
Every time Albert and Bernard go back and forth they are eliminating a new ‘r’ , and every time she tells them that no matter how many times they go back and forth they won’t get it, they are eliminating a new ‘k.’
When Cheryl makes her big rant, she if effectively telling them that for all r and k when n = 1, they won’t find it, and furthermore that the first 100 times she makes that statement they won’t find it.
She also says that after saying it 100 times, neither will know which number is larger. This means that neither Albert nor Bernard has the number 100. (something a couple other solutions missed I think.) Albert says he does not know, ruling out him having 100 + 1/4, and then Bernard says he still does not know, ruling out Bernard having 100 + 3/8 and 100 + 1/4.
When Albert says that he suddenly knows, he can either have 100 + 3/8 or 100 + 7/16. The only way for Bernard to know both of their numbers is if he has 100 + 7/16, which gives us the answer:
Albert: 100 + 3/8
Bernard: 100 + 7/16
$endgroup$
add a comment |
$begingroup$
We can map $n - 2^{-k} - 2^{-(k+r)}$ onto the ordinal $omega^2(n-1) + omega(k-1) + r$; this preserves order. So Cheryl effectively says "I have given you both distinct ordinals $a$ and $b$, both less than $omega^3$. Which is bigger?"
Albert says "$a geq 1$", Bernard says "$b geq 2$", Albert says "$a geq 3$", Bernard says "$b geq 4$".
Cheryl says "Actually $a$ and $b$ are both $geq omega$".
Albert says "$a geq omega + 1$", Bernard says "$b geq omega + 2$", Albert says "$a geq omega + 3$", Bernard says "$b geq omega + 4$".
Eventually Cheryl says "Actually both are $geq omega^2 100 + 1$".
Albert says "$a geq omega^2 100 + 2$".
Bernard says "$b geq omega^2 100 + 3$".
Albert says "Aha! In that case I know the answer, which tells you that $a < omega^2 100 + 4$".
From that, Bernard can work out Albert's number. How does he know whether Albert's number is $omega^2 100 + 2$ or $omega^2 100 + 3$? It can only be that $omega^2 100 + 3$ is Bernards's number, so he knows Albert's must be $omega^2 100 + 2$.
Translating back in to the language of the original question, this means that Albert's number is $101 - 2^{-1}- 2^{-3} = 100.375$ and Bernard's is $101 - 2^{-1}- 2^{-4} = 100.4375$.
$endgroup$
3
$begingroup$
Nitpick: According to ordinal multiplication, $100omega^2$ is not the same as $omega^2100$. $100omega^2=omega^2$, while $omega^2100>omega^2$. (Because $100omega^2=100+100+dotsb+100+100+dotsb+100+100+dotsb+dotsb$, with $100$ written $omega^2$ times. This is equal to $omega+omega+omega+dotsb=omega^2$. On the other hand, $omega^2100=omega^2+omega^2+dotsb+omega^2$, which is what you probably meant.)
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 15:21
$begingroup$
Oops, thank you, fixed! I think Gödel, Escher, Bach gets this wrong, which is where I originally learned about ordinals from.
$endgroup$
– Paul Crowley
Apr 19 '15 at 15:28
3
$begingroup$
Almost. You need to take into account Cheryl's very last sentence ("And furthermore, even after having said it 100 times… you still would not know!"), which translates to "Actually $a$, $bgeomega^2cdot100 + 1$". So $a = omega^2cdot100+2 mapsto 100.375$ and $b = omega^2cdot100 + 3 mapsto 100.4375$.
$endgroup$
– Chad Groft
Apr 19 '15 at 16:12
$begingroup$
Argh, I knew I'd make a fencepost error! Thanks, fixed!
$endgroup$
– Paul Crowley
Apr 19 '15 at 16:19
add a comment |
$begingroup$
I have posted an extended solution on my blog:
Solution to my transfinite epistemic logic puzzle.
My answer agrees with that of Joe and Kellen and Paul on the other answers here, namely, that Albert has $100frac38$ and Bernard has $100frac7{16}$.
$endgroup$
add a comment |
Your Answer
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%2f1241197%2fa-transfinite-epistemic-logic-puzzle-what-numbers-did-cheryl-give-to-albert-and%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$
Every time Albert and Bernard go back and forth they are eliminating a new ‘r’ , and every time she tells them that no matter how many times they go back and forth they won’t get it, they are eliminating a new ‘k.’
When Cheryl makes her big rant, she if effectively telling them that for all r and k when n = 1, they won’t find it, and furthermore that the first 100 times she makes that statement they won’t find it.
She also says that after saying it 100 times, neither will know which number is larger. This means that neither Albert nor Bernard has the number 100. (something a couple other solutions missed I think.) Albert says he does not know, ruling out him having 100 + 1/4, and then Bernard says he still does not know, ruling out Bernard having 100 + 3/8 and 100 + 1/4.
When Albert says that he suddenly knows, he can either have 100 + 3/8 or 100 + 7/16. The only way for Bernard to know both of their numbers is if he has 100 + 7/16, which gives us the answer:
Albert: 100 + 3/8
Bernard: 100 + 7/16
$endgroup$
add a comment |
$begingroup$
Every time Albert and Bernard go back and forth they are eliminating a new ‘r’ , and every time she tells them that no matter how many times they go back and forth they won’t get it, they are eliminating a new ‘k.’
When Cheryl makes her big rant, she if effectively telling them that for all r and k when n = 1, they won’t find it, and furthermore that the first 100 times she makes that statement they won’t find it.
She also says that after saying it 100 times, neither will know which number is larger. This means that neither Albert nor Bernard has the number 100. (something a couple other solutions missed I think.) Albert says he does not know, ruling out him having 100 + 1/4, and then Bernard says he still does not know, ruling out Bernard having 100 + 3/8 and 100 + 1/4.
When Albert says that he suddenly knows, he can either have 100 + 3/8 or 100 + 7/16. The only way for Bernard to know both of their numbers is if he has 100 + 7/16, which gives us the answer:
Albert: 100 + 3/8
Bernard: 100 + 7/16
$endgroup$
add a comment |
$begingroup$
Every time Albert and Bernard go back and forth they are eliminating a new ‘r’ , and every time she tells them that no matter how many times they go back and forth they won’t get it, they are eliminating a new ‘k.’
When Cheryl makes her big rant, she if effectively telling them that for all r and k when n = 1, they won’t find it, and furthermore that the first 100 times she makes that statement they won’t find it.
She also says that after saying it 100 times, neither will know which number is larger. This means that neither Albert nor Bernard has the number 100. (something a couple other solutions missed I think.) Albert says he does not know, ruling out him having 100 + 1/4, and then Bernard says he still does not know, ruling out Bernard having 100 + 3/8 and 100 + 1/4.
When Albert says that he suddenly knows, he can either have 100 + 3/8 or 100 + 7/16. The only way for Bernard to know both of their numbers is if he has 100 + 7/16, which gives us the answer:
Albert: 100 + 3/8
Bernard: 100 + 7/16
$endgroup$
Every time Albert and Bernard go back and forth they are eliminating a new ‘r’ , and every time she tells them that no matter how many times they go back and forth they won’t get it, they are eliminating a new ‘k.’
When Cheryl makes her big rant, she if effectively telling them that for all r and k when n = 1, they won’t find it, and furthermore that the first 100 times she makes that statement they won’t find it.
She also says that after saying it 100 times, neither will know which number is larger. This means that neither Albert nor Bernard has the number 100. (something a couple other solutions missed I think.) Albert says he does not know, ruling out him having 100 + 1/4, and then Bernard says he still does not know, ruling out Bernard having 100 + 3/8 and 100 + 1/4.
When Albert says that he suddenly knows, he can either have 100 + 3/8 or 100 + 7/16. The only way for Bernard to know both of their numbers is if he has 100 + 7/16, which gives us the answer:
Albert: 100 + 3/8
Bernard: 100 + 7/16
answered Apr 19 '15 at 15:25
Joe and KellenJoe and Kellen
1061
1061
add a comment |
add a comment |
$begingroup$
We can map $n - 2^{-k} - 2^{-(k+r)}$ onto the ordinal $omega^2(n-1) + omega(k-1) + r$; this preserves order. So Cheryl effectively says "I have given you both distinct ordinals $a$ and $b$, both less than $omega^3$. Which is bigger?"
Albert says "$a geq 1$", Bernard says "$b geq 2$", Albert says "$a geq 3$", Bernard says "$b geq 4$".
Cheryl says "Actually $a$ and $b$ are both $geq omega$".
Albert says "$a geq omega + 1$", Bernard says "$b geq omega + 2$", Albert says "$a geq omega + 3$", Bernard says "$b geq omega + 4$".
Eventually Cheryl says "Actually both are $geq omega^2 100 + 1$".
Albert says "$a geq omega^2 100 + 2$".
Bernard says "$b geq omega^2 100 + 3$".
Albert says "Aha! In that case I know the answer, which tells you that $a < omega^2 100 + 4$".
From that, Bernard can work out Albert's number. How does he know whether Albert's number is $omega^2 100 + 2$ or $omega^2 100 + 3$? It can only be that $omega^2 100 + 3$ is Bernards's number, so he knows Albert's must be $omega^2 100 + 2$.
Translating back in to the language of the original question, this means that Albert's number is $101 - 2^{-1}- 2^{-3} = 100.375$ and Bernard's is $101 - 2^{-1}- 2^{-4} = 100.4375$.
$endgroup$
3
$begingroup$
Nitpick: According to ordinal multiplication, $100omega^2$ is not the same as $omega^2100$. $100omega^2=omega^2$, while $omega^2100>omega^2$. (Because $100omega^2=100+100+dotsb+100+100+dotsb+100+100+dotsb+dotsb$, with $100$ written $omega^2$ times. This is equal to $omega+omega+omega+dotsb=omega^2$. On the other hand, $omega^2100=omega^2+omega^2+dotsb+omega^2$, which is what you probably meant.)
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 15:21
$begingroup$
Oops, thank you, fixed! I think Gödel, Escher, Bach gets this wrong, which is where I originally learned about ordinals from.
$endgroup$
– Paul Crowley
Apr 19 '15 at 15:28
3
$begingroup$
Almost. You need to take into account Cheryl's very last sentence ("And furthermore, even after having said it 100 times… you still would not know!"), which translates to "Actually $a$, $bgeomega^2cdot100 + 1$". So $a = omega^2cdot100+2 mapsto 100.375$ and $b = omega^2cdot100 + 3 mapsto 100.4375$.
$endgroup$
– Chad Groft
Apr 19 '15 at 16:12
$begingroup$
Argh, I knew I'd make a fencepost error! Thanks, fixed!
$endgroup$
– Paul Crowley
Apr 19 '15 at 16:19
add a comment |
$begingroup$
We can map $n - 2^{-k} - 2^{-(k+r)}$ onto the ordinal $omega^2(n-1) + omega(k-1) + r$; this preserves order. So Cheryl effectively says "I have given you both distinct ordinals $a$ and $b$, both less than $omega^3$. Which is bigger?"
Albert says "$a geq 1$", Bernard says "$b geq 2$", Albert says "$a geq 3$", Bernard says "$b geq 4$".
Cheryl says "Actually $a$ and $b$ are both $geq omega$".
Albert says "$a geq omega + 1$", Bernard says "$b geq omega + 2$", Albert says "$a geq omega + 3$", Bernard says "$b geq omega + 4$".
Eventually Cheryl says "Actually both are $geq omega^2 100 + 1$".
Albert says "$a geq omega^2 100 + 2$".
Bernard says "$b geq omega^2 100 + 3$".
Albert says "Aha! In that case I know the answer, which tells you that $a < omega^2 100 + 4$".
From that, Bernard can work out Albert's number. How does he know whether Albert's number is $omega^2 100 + 2$ or $omega^2 100 + 3$? It can only be that $omega^2 100 + 3$ is Bernards's number, so he knows Albert's must be $omega^2 100 + 2$.
Translating back in to the language of the original question, this means that Albert's number is $101 - 2^{-1}- 2^{-3} = 100.375$ and Bernard's is $101 - 2^{-1}- 2^{-4} = 100.4375$.
$endgroup$
3
$begingroup$
Nitpick: According to ordinal multiplication, $100omega^2$ is not the same as $omega^2100$. $100omega^2=omega^2$, while $omega^2100>omega^2$. (Because $100omega^2=100+100+dotsb+100+100+dotsb+100+100+dotsb+dotsb$, with $100$ written $omega^2$ times. This is equal to $omega+omega+omega+dotsb=omega^2$. On the other hand, $omega^2100=omega^2+omega^2+dotsb+omega^2$, which is what you probably meant.)
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 15:21
$begingroup$
Oops, thank you, fixed! I think Gödel, Escher, Bach gets this wrong, which is where I originally learned about ordinals from.
$endgroup$
– Paul Crowley
Apr 19 '15 at 15:28
3
$begingroup$
Almost. You need to take into account Cheryl's very last sentence ("And furthermore, even after having said it 100 times… you still would not know!"), which translates to "Actually $a$, $bgeomega^2cdot100 + 1$". So $a = omega^2cdot100+2 mapsto 100.375$ and $b = omega^2cdot100 + 3 mapsto 100.4375$.
$endgroup$
– Chad Groft
Apr 19 '15 at 16:12
$begingroup$
Argh, I knew I'd make a fencepost error! Thanks, fixed!
$endgroup$
– Paul Crowley
Apr 19 '15 at 16:19
add a comment |
$begingroup$
We can map $n - 2^{-k} - 2^{-(k+r)}$ onto the ordinal $omega^2(n-1) + omega(k-1) + r$; this preserves order. So Cheryl effectively says "I have given you both distinct ordinals $a$ and $b$, both less than $omega^3$. Which is bigger?"
Albert says "$a geq 1$", Bernard says "$b geq 2$", Albert says "$a geq 3$", Bernard says "$b geq 4$".
Cheryl says "Actually $a$ and $b$ are both $geq omega$".
Albert says "$a geq omega + 1$", Bernard says "$b geq omega + 2$", Albert says "$a geq omega + 3$", Bernard says "$b geq omega + 4$".
Eventually Cheryl says "Actually both are $geq omega^2 100 + 1$".
Albert says "$a geq omega^2 100 + 2$".
Bernard says "$b geq omega^2 100 + 3$".
Albert says "Aha! In that case I know the answer, which tells you that $a < omega^2 100 + 4$".
From that, Bernard can work out Albert's number. How does he know whether Albert's number is $omega^2 100 + 2$ or $omega^2 100 + 3$? It can only be that $omega^2 100 + 3$ is Bernards's number, so he knows Albert's must be $omega^2 100 + 2$.
Translating back in to the language of the original question, this means that Albert's number is $101 - 2^{-1}- 2^{-3} = 100.375$ and Bernard's is $101 - 2^{-1}- 2^{-4} = 100.4375$.
$endgroup$
We can map $n - 2^{-k} - 2^{-(k+r)}$ onto the ordinal $omega^2(n-1) + omega(k-1) + r$; this preserves order. So Cheryl effectively says "I have given you both distinct ordinals $a$ and $b$, both less than $omega^3$. Which is bigger?"
Albert says "$a geq 1$", Bernard says "$b geq 2$", Albert says "$a geq 3$", Bernard says "$b geq 4$".
Cheryl says "Actually $a$ and $b$ are both $geq omega$".
Albert says "$a geq omega + 1$", Bernard says "$b geq omega + 2$", Albert says "$a geq omega + 3$", Bernard says "$b geq omega + 4$".
Eventually Cheryl says "Actually both are $geq omega^2 100 + 1$".
Albert says "$a geq omega^2 100 + 2$".
Bernard says "$b geq omega^2 100 + 3$".
Albert says "Aha! In that case I know the answer, which tells you that $a < omega^2 100 + 4$".
From that, Bernard can work out Albert's number. How does he know whether Albert's number is $omega^2 100 + 2$ or $omega^2 100 + 3$? It can only be that $omega^2 100 + 3$ is Bernards's number, so he knows Albert's must be $omega^2 100 + 2$.
Translating back in to the language of the original question, this means that Albert's number is $101 - 2^{-1}- 2^{-3} = 100.375$ and Bernard's is $101 - 2^{-1}- 2^{-4} = 100.4375$.
edited Apr 19 '15 at 16:19
answered Apr 19 '15 at 14:55
Paul CrowleyPaul Crowley
26619
26619
3
$begingroup$
Nitpick: According to ordinal multiplication, $100omega^2$ is not the same as $omega^2100$. $100omega^2=omega^2$, while $omega^2100>omega^2$. (Because $100omega^2=100+100+dotsb+100+100+dotsb+100+100+dotsb+dotsb$, with $100$ written $omega^2$ times. This is equal to $omega+omega+omega+dotsb=omega^2$. On the other hand, $omega^2100=omega^2+omega^2+dotsb+omega^2$, which is what you probably meant.)
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 15:21
$begingroup$
Oops, thank you, fixed! I think Gödel, Escher, Bach gets this wrong, which is where I originally learned about ordinals from.
$endgroup$
– Paul Crowley
Apr 19 '15 at 15:28
3
$begingroup$
Almost. You need to take into account Cheryl's very last sentence ("And furthermore, even after having said it 100 times… you still would not know!"), which translates to "Actually $a$, $bgeomega^2cdot100 + 1$". So $a = omega^2cdot100+2 mapsto 100.375$ and $b = omega^2cdot100 + 3 mapsto 100.4375$.
$endgroup$
– Chad Groft
Apr 19 '15 at 16:12
$begingroup$
Argh, I knew I'd make a fencepost error! Thanks, fixed!
$endgroup$
– Paul Crowley
Apr 19 '15 at 16:19
add a comment |
3
$begingroup$
Nitpick: According to ordinal multiplication, $100omega^2$ is not the same as $omega^2100$. $100omega^2=omega^2$, while $omega^2100>omega^2$. (Because $100omega^2=100+100+dotsb+100+100+dotsb+100+100+dotsb+dotsb$, with $100$ written $omega^2$ times. This is equal to $omega+omega+omega+dotsb=omega^2$. On the other hand, $omega^2100=omega^2+omega^2+dotsb+omega^2$, which is what you probably meant.)
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 15:21
$begingroup$
Oops, thank you, fixed! I think Gödel, Escher, Bach gets this wrong, which is where I originally learned about ordinals from.
$endgroup$
– Paul Crowley
Apr 19 '15 at 15:28
3
$begingroup$
Almost. You need to take into account Cheryl's very last sentence ("And furthermore, even after having said it 100 times… you still would not know!"), which translates to "Actually $a$, $bgeomega^2cdot100 + 1$". So $a = omega^2cdot100+2 mapsto 100.375$ and $b = omega^2cdot100 + 3 mapsto 100.4375$.
$endgroup$
– Chad Groft
Apr 19 '15 at 16:12
$begingroup$
Argh, I knew I'd make a fencepost error! Thanks, fixed!
$endgroup$
– Paul Crowley
Apr 19 '15 at 16:19
3
3
$begingroup$
Nitpick: According to ordinal multiplication, $100omega^2$ is not the same as $omega^2100$. $100omega^2=omega^2$, while $omega^2100>omega^2$. (Because $100omega^2=100+100+dotsb+100+100+dotsb+100+100+dotsb+dotsb$, with $100$ written $omega^2$ times. This is equal to $omega+omega+omega+dotsb=omega^2$. On the other hand, $omega^2100=omega^2+omega^2+dotsb+omega^2$, which is what you probably meant.)
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 15:21
$begingroup$
Nitpick: According to ordinal multiplication, $100omega^2$ is not the same as $omega^2100$. $100omega^2=omega^2$, while $omega^2100>omega^2$. (Because $100omega^2=100+100+dotsb+100+100+dotsb+100+100+dotsb+dotsb$, with $100$ written $omega^2$ times. This is equal to $omega+omega+omega+dotsb=omega^2$. On the other hand, $omega^2100=omega^2+omega^2+dotsb+omega^2$, which is what you probably meant.)
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 15:21
$begingroup$
Oops, thank you, fixed! I think Gödel, Escher, Bach gets this wrong, which is where I originally learned about ordinals from.
$endgroup$
– Paul Crowley
Apr 19 '15 at 15:28
$begingroup$
Oops, thank you, fixed! I think Gödel, Escher, Bach gets this wrong, which is where I originally learned about ordinals from.
$endgroup$
– Paul Crowley
Apr 19 '15 at 15:28
3
3
$begingroup$
Almost. You need to take into account Cheryl's very last sentence ("And furthermore, even after having said it 100 times… you still would not know!"), which translates to "Actually $a$, $bgeomega^2cdot100 + 1$". So $a = omega^2cdot100+2 mapsto 100.375$ and $b = omega^2cdot100 + 3 mapsto 100.4375$.
$endgroup$
– Chad Groft
Apr 19 '15 at 16:12
$begingroup$
Almost. You need to take into account Cheryl's very last sentence ("And furthermore, even after having said it 100 times… you still would not know!"), which translates to "Actually $a$, $bgeomega^2cdot100 + 1$". So $a = omega^2cdot100+2 mapsto 100.375$ and $b = omega^2cdot100 + 3 mapsto 100.4375$.
$endgroup$
– Chad Groft
Apr 19 '15 at 16:12
$begingroup$
Argh, I knew I'd make a fencepost error! Thanks, fixed!
$endgroup$
– Paul Crowley
Apr 19 '15 at 16:19
$begingroup$
Argh, I knew I'd make a fencepost error! Thanks, fixed!
$endgroup$
– Paul Crowley
Apr 19 '15 at 16:19
add a comment |
$begingroup$
I have posted an extended solution on my blog:
Solution to my transfinite epistemic logic puzzle.
My answer agrees with that of Joe and Kellen and Paul on the other answers here, namely, that Albert has $100frac38$ and Bernard has $100frac7{16}$.
$endgroup$
add a comment |
$begingroup$
I have posted an extended solution on my blog:
Solution to my transfinite epistemic logic puzzle.
My answer agrees with that of Joe and Kellen and Paul on the other answers here, namely, that Albert has $100frac38$ and Bernard has $100frac7{16}$.
$endgroup$
add a comment |
$begingroup$
I have posted an extended solution on my blog:
Solution to my transfinite epistemic logic puzzle.
My answer agrees with that of Joe and Kellen and Paul on the other answers here, namely, that Albert has $100frac38$ and Bernard has $100frac7{16}$.
$endgroup$
I have posted an extended solution on my blog:
Solution to my transfinite epistemic logic puzzle.
My answer agrees with that of Joe and Kellen and Paul on the other answers here, namely, that Albert has $100frac38$ and Bernard has $100frac7{16}$.
answered Apr 25 '15 at 23:33
JDHJDH
33k682148
33k682148
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%2f1241197%2fa-transfinite-epistemic-logic-puzzle-what-numbers-did-cheryl-give-to-albert-and%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$
I gather from the tag description that the (puzzle) tag is not used for questions like this?
$endgroup$
– JDH
Apr 19 '15 at 1:29
$begingroup$
So... What ordinal would you give to a problem like this? $omega^2100$? And does the set of numbers of the form $n-dfrac1{2^k}-dfrac1{2^{k+r}}$ have order-type $omega^3$?
$endgroup$
– Akiva Weinberger
Apr 19 '15 at 14:01
$begingroup$
@columbus8myhw Yes, Cheryl's set of numbers has order type $omega^3$ altogether, since between each pair of natural numbers, there are $omega$ many increasing $omega$-sequences, and so we have $omega$ many copies of $omega^2$.
$endgroup$
– JDH
Apr 19 '15 at 14:58
1
$begingroup$
@JDH: Nice problem!
$endgroup$
– Hanno
Apr 19 '15 at 15:15
$begingroup$
In the last sentence: "And furthermore, even after my having said it altogether one hundred times in succession, you would still not know who has the larger number!", does she claim that they both don't know or that they don't both know?
$endgroup$
– Florian F
May 1 '15 at 11:00