Denote the integer on Adina’s card by and the integer on Budi’s card by .
If or , then Adina would know the answer to
the question in the first line and hence would not have asked it.
Therefore, and . Budi deduces this information
from the fact that Adina asked the question in the first line.
After Dewei answers "No" in the second line, Budi knows the following
information: the value of , that
, that , and that . According to the third line of
the dialogue, Budi is able to determine the value of from this information.
Since and , it must be that . If , then there is no way for Budi to
deduce the value of from the
information in the previous paragraph. Therefore, and .
Although we have already deduced the integers on the two cards, it is
worth pointing out that the final line of the dialogue makes sense.
Indeed, the fact that Budi determined the value of immediately after Adina’s question was
answered tells Adina that .
Otherwise, as discussed in the previous paragraph, there is no way that
Budi could have determined the value of after line 2 in the dialogue.
The smallest possible sum of three different integers from to inclusive is and the largest is . Therefore, , , and are the only possible perfect squares
that can be equal to the sum of the integers on the cards. It is not
difficult to deduce that there are exactly sets of three distinct integers from
to having a sum equal to a perfect
square. One way to approach this is to examine possibilities by
considering the largest integer in the set. For instance, if is the largest integer, then we seek
distinct positive integers and
such that is a perfect square. Since , , and so and are the only possibilities for this
sum. This means either or
. In the former case, and could be and or and in either order ( and need to be different, so is not possible). In the latter
case, and equal to and or and . Therefore, four of the sets of three
distinct positive integers are , , , and . Moreover, these four are the
only such sets that contain . All
fifteen sets are listed below.
After the dialogue, each player knows that the sum of the integers on
the three cards is a perfect square. Each player can see two cards. If a
player sees the integers and
, then the integer on their own
card could be or , but they will not be able to tell
which since in either case the sum would be a perfect square. Since
every player is able to deduce the integer on their card once they learn
that the sum is a perfect square, it is not possible for and to be two of the integers on the cards.
Therefore, the sets and
can be eliminated as
possibilities for the integers on the three cards. If a player sees the integers and , then the integer on their card could
be or , but they cannot determine which of
the two. Therefore, the three cards cannot be or .
Continuing with this sort of reasoning, all possibilities except
, , and can be eliminated from the list
above.
If the integers are , , and , then one of the players sees the cards
and . The only way for the sum to be a
perfect square is for the integer on their card to be (remember, there is only one of each
card, so they cannot be holding a card with a since they see a ). Therefore, they know the integer on
their card. The player who sees
and knows their card must have
on it since there is no other
integer that can be added to
to get a perfect square. Finally, the player who sees and knows their card must have on it by the same reasoning. Therefore,
if the cards have , , and on them (in any order), then all three
players will know the integer on their card as soon as they learn that
the sum is a perfect square.
By similar reasoning, if the integers are , , and in any order, then each player will
know the integer on their card once they learn that the sum is a square.
Similar reasoning applies if the integers are , , and in any order.
This gives a total of configurations of the cards because there are ways to distribute the three cards
among the three players for each of the three possible sets of cards.
However, it is possible that some of these configurations would lead to
Adina knowing the answer to her question immediately from the cards she
can see. To finish the argument, we will show that in any of these configurations of the cards, Adina
could not possibly know just from the cards that she sees that the sum
is or is not a perfect square.
The possible pairs of integers that Adina can see are , , , , , , , , or . These are the two-element
subsets of the three possible sets of integers on the cards. In each of
these nine cases, there is at least one possibility for the integer on
her card that would make the sum a perfect square. As well, in each of
these nine cases, if the integer on her card were , then the sum would not be a perfect
square. Therefore, if Adina sees any of these nine pairs of integers,
there is no way for her to know whether the sum is a perfect square.
Therefore, all configurations
described above are possible.
Since none of the cards have a prime number on them, the
possibilities for the integers on the cards are , , , , , and . As well, the sum of the three
integers is prime, which rules out many possibilities. By carefully
checking, one finds that there are exactly seven sets of three distinct
integers from the list , , , , that have a prime sum. They are listed
below. The
first column in the table below contains the fifteen pairs of two
distinct integers selected from ,
, , , , and , which are the possible pairs of cards
that a player can see. The right column contains the corresponding
number of three-element sets from the list above of which the given
two-element set is a subset. For example, the number occurs to the right of because is a subset of and and none of the other sets.
If a pair in the table above has a next to it, then a player who sees
those two integers will know the integer on their card after the first
four lines of dialogue. For instance, if a player sees and , they will know that their card is
since is the only one of the seven
sets above that contains and
. On the other hand, if there is a
next to a set in the table above,
then a player who sees those two integers will not be able to determine
the integer on their card after the first four lines of dialogue. For
instance, if a player sees and
, then the set of integers is
either or , so a player who sees and knows that their card is or , but cannot determine which.
We know that after the first four lines of dialogue, exactly one
player is able to determine the integer on their card. Suppose the set
of integers on the cards is . The two-element subsets of
this set are , , and . Both and have a next to them in the table above, so
this means that if the set of integers is , then two players would know
the integer on their card after the first four lines of dialogue.
Therefore, the set of integers on the cards is not . For similar reasons, the
integers cannot be .
The two-element subsets of all have a next to them in the table above, which
means that if the set of integers is , then
none of the players would know the integer on
their card after the first four lines of dialogue. Therefore, the set of
integers is not , and for
the same reason, it is not .
The three players will also deduce this information as soon as the
statements in line 5 of the dialogue are spoken. Thus, after these
statements are made, all three players know that the only possibilities
for the set of integers on the cards are those below: Furthermore, in each of these three cases, the
integer on Charlie’s card must be
since only the player with on
their card is able to deduce the integer on their card after the first 5
lines of dialogue. For instance, if the cards are , , and , then the players who have and on their card see the pairs of integers
and respectively. Since these sets
each have a next to them in the
table above, these players cannot deduce the integer on their card from
the first five lines of dialogue. However, the player whose card has a
on it sees the set , which has a next to it in the table above, so they
can deduce the integer on their card from the first five lines. By
similar reasoning, if the cards are or , then the player who is able
to deduce the integer on their card must be holding the card with on it. Therefore, the integer on
Charlie’s card is .
We have now narrowed down to
possibilities for how the cards are distributed:
4 |
8 |
1 |
8 |
4 |
1 |
6 |
10 |
1 |
10 |
6 |
1 |
8 |
10 |
1 |
10 |
8 |
1 |
Since Charlie’s card has on
it, Adina and Budi each see a and
one of , , , and . If Adina or Budi sees and , then they know that the integer on
their card is since is the only possible remaining
set that contains both and . Similarly, if one of them sees and , then they know the integer on their
card is . If they see and , then the integer on their card could
be either or , and if they see and , then the integer on their card could
be either or .
In the sixth line of dialogue, we find out that after line 5, Adina
does not know the integer on her card and Budi does know the integer on
his card. This means Adina sees either and or and , and Budi sees either and or and . Of the six possibilities in the table
above, the only two that satisfy both of these conditions are
Therefore, Charlie is holding the card with on it, and either Adina’s card has
on it and Budi’s has on it, or Adina’s card has on it and Budi’s has on it.
In fact, both of these are possible. Denote by the integer on Adina’s card, by the integer on Budi’s card, and by
the integer on Charlie’s card. We
will verify that when , , and the dialogue makes sense. Verifying
the case when , , and can be done similarly. Therefore, we
assume that , , and .
Adina sees and , neither of which is prime, so she can
ask the question in line 1 since she does not know its answer.
Budi sees that and and knows that is not prime. If , then is prime. If , then is not prime. Therefore, Budi
cannot know the answer to the question in the third line before he asks
it.
Adina sees that and
, knows that is prime, and knows is not prime. Therefore, she knows that
either or , but cannot tell which.
Budi sees that and , knows that is not prime, and knows that is prime. Therefore, he knows
that or , but cannot tell which.
Charlie sees and , knows that is one of , , , and , and knows that is prime. Since , , and are all composite, Charlie knows
at this point that .
Budi knew that either or
after he learned that was prime. He knows that Charlie
knows the values of both and
. If , then Charlie would not have been
able to determine whether or
since the sums and are both prime. Therefore,
Budi concludes that .
Adina knows that or
and she knows that Charlie
knows that . She also knows that
Charlie is able to deduce the value of from the information revealed in the
first four lines of dialogue. If , then Charlie could see an and a and would know that was one of , , , and . The sum is prime, but , , and are all composite. This means
Charlie would be able to deduce that if . Similarly (as previously argued),
if , then Charlie would be able
to deduce that . Therefore,
Charlie’s ability to deduce the value of after the first five lines does not
tell Adina the value of . As well,
whether Adina is holding or , Budi would not be able to tell
whether he is holding or after the first five lines. This is
because , , , and are all prime. Therefore, Budi’s
inability to determine the value of after the first five lines of dialogue
does not tell Adina the value of .
If and or , then Charlie would still be able to
deduce that after the first
four lines of dialogue. However, Budi would not be able to deduce the
value of after the first five
lines of dialogue. Both of these facts follow from reasoning similar to
that which is above. Therefore, once Budi announces that he has deduced
the integer on his card, Adina knows that , so she knows that .
In conclusion, the complete set of possibilities for the integers on
the cards are that Adina’s card has , Budi’s card has , and Charlie’s card has , or Adina’s card has , Budi’s card has , and Charlie’s card has .