Difference between revisions of "2021 AIME II Problems/Problem 11"

Revision as of 09:59, 4 February 2024

Problem

A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$ , and a different number in $S$ was divisible by $7$ . The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.

However, upon hearing that all four students replied no, each student was able to determine the elements of $S$ . Find the sum of all possible values of the greatest element of $S$ .

Solution 1

Note that $\operatorname{lcm}(6,7)=42.$ It is clear that $42\not\in S$ and $84\not\in S,$ otherwise the three other elements in $S$ are divisible by neither $6$ nor $7.$

In the table below, the multiples of $6$ are colored in yellow, and the multiples of $7$ are colored in green. By the least common multiple, we obtain cycles: If $n$ is a possible maximum value of $S,$ then $n+42$ must be another possible maximum value of $S,$ and vice versa. By observations, we circle all possible maximum values of $S.$ $[asy] /* Made by MRENTHUSIASM */ size(20cm); fill((5,0)--(6,0)--(6,2)--(5,2)--cycle,yellow); fill((11,0)--(12,0)--(12,3)--(11,3)--cycle,yellow); fill((17,1)--(18,1)--(18,3)--(17,3)--cycle,yellow); fill((23,1)--(24,1)--(24,3)--(23,3)--cycle,yellow); fill((29,1)--(30,1)--(30,3)--(29,3)--cycle,yellow); fill((35,1)--(36,1)--(36,3)--(35,3)--cycle,yellow); fill((6,0)--(7,0)--(7,2)--(6,2)--cycle,green); fill((13,0)--(14,0)--(14,3)--(13,3)--cycle,green); fill((20,1)--(21,1)--(21,3)--(20,3)--cycle,green); fill((27,1)--(28,1)--(28,3)--(27,3)--cycle,green); fill((34,1)--(35,1)--(35,3)--(34,3)--cycle,green); fill((42,3)--(41,3)--(41,2)--cycle,yellow); fill((42,2)--(41,2)--(41,1)--cycle,yellow); fill((42,3)--(42,2)--(41,2)--cycle,green); fill((42,2)--(42,1)--(41,1)--cycle,green); for (real i=9.5; i<=41.5; ++i) { label("$"+string(i+0.5)+"$",(i,2.5),fontsize(9pt)); } for (real i=0.5; i<=41.5; ++i) { label("$"+string(i+42.5)+"$",(i,1.5),fontsize(9pt)); } for (real i=0.5; i<=14.5; ++i) { label("$"+string(i+84.5)+"$",(i,0.5),fontsize(9pt)); } draw(circle((6.5,1.5),0.45)); draw(circle((6.5,0.5),0.45)); draw(circle((7.5,1.5),0.45)); draw(circle((7.5,0.5),0.45)); draw(circle((8.5,1.5),0.45)); draw(circle((8.5,0.5),0.45)); draw(circle((13.5,2.5),0.45)); draw(circle((13.5,1.5),0.45)); draw(circle((13.5,0.5),0.45)); draw(circle((14.5,2.5),0.45)); draw(circle((14.5,1.5),0.45)); draw(circle((14.5,0.5),0.45)); draw(circle((20.5,2.5),0.45)); draw(circle((20.5,1.5),0.45)); draw(circle((23.5,2.5),0.45)); draw(circle((23.5,1.5),0.45)); draw(circle((29.5,2.5),0.45)); draw(circle((29.5,1.5),0.45)); draw(circle((30.5,2.5),0.45)); draw(circle((30.5,1.5),0.45)); draw(circle((35.5,2.5),0.45)); draw(circle((35.5,1.5),0.45)); draw(circle((36.5,2.5),0.45)); draw(circle((36.5,1.5),0.45)); draw(circle((37.5,2.5),0.45)); draw(circle((37.5,1.5),0.45)); draw((9,3)--(42,3)); draw((0,2)--(42,2)); draw((0,1)--(42,1)); draw((0,0)--(15,0)); for (real i=0; i<9; ++i) { draw((i,2)--(i,0)); } for (real i=9; i<16; ++i) { draw((i,3)--(i,0)); } for (real i=16; i<=42; ++i) { draw((i,3)--(i,1)); } [/asy]$ From the second row of the table above, we perform casework on the possible maximum value of $S:$ $\begin{array}{c||c|c|l} & & & \\ [-2.5ex] \textbf{Max Value} & \boldsymbol{S} & \textbf{Valid?} & \hspace{16.25mm}\textbf{Reasoning/Conclusion} \\ [0.5ex] \hline & & & \\ [-2ex] 49 & \{46,47,48,49\} & & \text{The student who gets } 46 \text{ will reply yes.} \\ 50 & \{47,48,49,50\} & \checkmark & \text{Another possibility is } S=\{89,90,91,92\}. \\ 51 & \{48,49,50,51\} & & \text{The student who gets } 51 \text{ will reply yes.} \\ 56 & \{53,54,55,56\} & & \text{The student who gets } 53 \text{ will reply yes.} \\ 57 & \{54,55,56,57\} & & \text{The student who gets } 57 \text{ will reply yes.} \\ 63 & \{60,61,62,63\} & & \text{The students who get } 60,61,62 \text{ will reply yes.} \\ 66 & \{63,64,65,66\} & & \text{The students who get } 64,65,66 \text{ will reply yes.} \\ 72 & \{69,70,71,72\} & & \text{The student who gets } 69 \text{ will reply yes.} \\ 73 & \{70,71,72,73\} & & \text{The student who gets } 73 \text{ will reply yes.} \\ 78 & \{75,76,77,78\} & & \text{The student who gets } 75 \text{ will reply yes.} \\ 79 & \{76,77,78,79\} & \checkmark & \text{Another possibility is } S=\{34,35,36,37\}. \\ 80 & \{77,78,79,80\} & & \text{The student who gets } 80 \text{ will reply yes.} \end{array}$ Finally, all possibilities for $S$ are $\{34,35,36,37\}, \{47,48,49,50\}, \{76,77,78,79\},$ and $\{89,90,91,92\},$ from which the answer is $37+50+79+92=\boxed{258}.$

Remarks

Alternatively, we can reconstruct the second table in this solution as follows, where Y and N denote the replies of "yes" and "no", respectively. Notice that this table has some kind of symmetry! $[asy] /* Made by MRENTHUSIASM */ size(20cm); for (real j=5.5; j<41.5; j+=6) { fill((j+0.5,4)--(j-0.5,4)--(j-0.5,3)--(j+0.5,3)--cycle,yellow); } for (real j=6.5; j<41.5; j+=7) { fill((j+0.5,4)--(j-0.5,4)--(j-0.5,3)--(j+0.5,3)--cycle,green); } fill((4,1)--(8,1)--(8,2)--(4,2)--cycle,mediumgray); fill((33,1)--(37,1)--(37,2)--(33,2)--cycle,mediumgray); fill((42,4)--(41,4)--(41,3)--cycle,yellow); fill((42,4)--(42,3)--(41,3)--cycle,green); for (real i=0.5; i<=41.5; ++i) { label("$"+string(i+42.5)+"$",(i,3.5),fontsize(9pt)); } draw(circle((6.5,3.5),0.45)); draw(circle((7.5,3.5),0.45)); draw(circle((8.5,3.5),0.45)); draw(circle((13.5,3.5),0.45)); draw(circle((14.5,3.5),0.45)); draw(circle((20.5,3.5),0.45)); draw(circle((23.5,3.5),0.45)); draw(circle((29.5,3.5),0.45)); draw(circle((30.5,3.5),0.45)); draw(circle((35.5,3.5),0.45)); draw(circle((36.5,3.5),0.45)); draw(circle((37.5,3.5),0.45)); label("Y",(3.5,2.5),blue); label("N",(4.5,2.5),blue); label("N",(5.5,2.5),blue); label("N",(6.5,2.5),blue); label("N",(4.5,1.5),blue); label("N",(5.5,1.5),blue); label("N",(6.5,1.5),blue); label("N",(7.5,1.5),blue); label("N",(5.5,0.5),blue); label("N",(6.5,0.5),blue); label("N",(7.5,0.5),blue); label("Y",(8.5,0.5),blue); label("Y",(10.5,2.5),blue); label("N",(11.5,2.5),blue); label("N",(12.5,2.5),blue); label("N",(13.5,2.5),blue); label("N",(11.5,1.5),blue); label("N",(12.5,1.5),blue); label("N",(13.5,1.5),blue); label("Y",(14.5,1.5),blue); label("Y",(17.5,2.5),blue); label("Y",(18.5,2.5),blue); label("Y",(19.5,2.5),blue); label("N",(20.5,2.5),blue); label("N",(20.5,1.5),blue); label("Y",(21.5,1.5),blue); label("Y",(22.5,1.5),blue); label("Y",(23.5,1.5),blue); label("Y",(26.5,2.5),blue); label("N",(27.5,2.5),blue); label("N",(28.5,2.5),blue); label("N",(29.5,2.5),blue); label("N",(27.5,1.5),blue); label("N",(28.5,1.5),blue); label("N",(29.5,1.5),blue); label("Y",(30.5,1.5),blue); label("Y",(32.5,2.5),blue); label("N",(33.5,2.5),blue); label("N",(34.5,2.5),blue); label("N",(35.5,2.5),blue); label("N",(33.5,1.5),blue); label("N",(34.5,1.5),blue); label("N",(35.5,1.5),blue); label("N",(36.5,1.5),blue); label("N",(34.5,0.5),blue); label("N",(35.5,0.5),blue); label("N",(36.5,0.5),blue); label("Y",(37.5,0.5),blue); for (real i=0; i<=42; ++i) { draw((i,4)--(i,3)); } draw((0,4)--(42,4)); draw((0,3)--(42,3)); [/asy]$
As a confirmation, we can verify that each student will be able to deduce what $S$ is upon hearing the four replies of "no" in unison. For example, if $S=\{47,48,49,50\},$ then all students will know that no one gets $46$ or $51,$ otherwise that student will reply yes (as discussed). Therefore, all students will conclude that $S$ has only one possibility.

~MRENTHUSIASM

Solution 2

We know right away that $42\not\in S$ and $84\not\in S$ as stated in Solution 1.

To get a feel for the problem, let’s write out some possible values of $S$ based on the teacher’s remarks. The first multiple of 7 that is two-digit is 14. The closest multiple of six from 14 is 12, and therefore there are two possible sets of four consecutive integers containing 12 and 14; $\{11,12,13,14\}$ and $\{12,13,14,15\}$ . Here we get our first crucial idea; that if the multiples of 6 and 7 differ by two, there will be 2 possible sets of $S$ without any student input. Similarly, if they differ by 3, there will be only 1 possible set, and if they differ by 1, 3 possible sets.

Now we read the student input. Each student says they can’t figure out what $S$ is just based on the teacher’s information, which means each student has to have a number that would be in 2 or 3 of the possible sets (This is based off of the first line of student input). However, now that each student knows that all of them have numbers that fit into more than one possible set, this means that S cannot have two possible sets because otherwise, when shifting from one set to the other, one of the end numbers would not be in the shifted set, but we know each number has to fall in two or more possible sets. For example, take $\{11,12,13,14\}$ and $\{12,13,14,15\}$ . The numbers at the end, 11 and 15, only fall in one set, but each number must fall in at least two sets. This means that there must be three possible sets of S, in which case the actual S would be the middle S. Take for example $\{33,34,35,36\}$ , $\{34,35,36,37\}$ , and $\{35,36,37,38\}$ . 37 and 34 fall in two sets while 35 and 36 fall in all three sets, so the condition is met. Now, this means that the multiple of 6 and 7 must differ by 1. Since 42 means the difference is 0, when you add/subtract 6 and 7, you will obtain the desired difference of 1, and similarly adding/subtracting 6 or 7 from 84 will also obtain the difference of 1. Thus there are four possible sets of $S$ ; $\{34,35,36,37\}$ , $\{47,48,49,50\}$ , $\{76,77,78,79\}$ and $\{89,90,91,92.\}$ . Therefore the sum of the greatest elements of the possible sets $S$ is $37+50+79+92=\boxed{258}$

~KingRavi

Solution 3

In a solution that satisfies these constraints, the multiple of 6 must be adjacent to multiple of 7. The other two numbers must be on either side.

WLOG assume the set is $\{a,6j,7k,b\}$ . The student with numbers $a$ , $6j$ , and $7k$ can think the set is $\{a-1, a,6j,7k\}$ or $\{a,6j,7k,b\}$ , and the students with number $6j$ , $7k$ , and $b$ can think the set is $\{a,6j,7k,b\}$ or $\{6j,7k,b, b+1\}$ . Therefore, none of the students know the set for sure.

Playing around with the arrangement of the multiple of 6 and multiple of 7 shows that this is the only configuration viewed as ambiguous to all the students. (Therefore when they hear nobody else knows either, they can find out it is this configuration)

Considering $S$ as $\{a,6j,7k,b\}$ ,b is 2 mod 6 and 1 mod 7, so $b$ is 8 mod 42. (since it is all 2-digit, the values are either 50 or 92).

Similarly, considering $S$ as $\{a,7j,6k,b\}$ , $b$ is 1 mod 6 and 2 mod 7, so $b$ is 37 mod 42. The values that satisfy that are 37 and 79.

The total sum of all these values is therefore $50+92+37+89=\boxed{258}$ .

This solution will even work when the bounds (in this question, 2-digit so <100) are much larger and it is impractical to perform casework.

~balav123

Solution 4 (Logic)

Consider the tuple $(a, a+1, a+2, a+3)$ as a possible $S$ . If one of the values in $S$ is $3$ or $4 \pmod{7}$ , observe the student will be able to deduce $S$ with no additional information. This is because, if a value is $b = 3 \pmod{7}$ and $S$ contains a $0 \pmod{7}$ , then the values of $S$ must be $(b-3, b-2, b-1, b)$ . Similarly, if we are given a $b \equiv 4 \pmod{7}$ and we know that $0 \pmod{7}$ is in $S$ , $S$ must be $(b, b+1, b+2, b+3).$ Hence, the only possibility for $a$ is $5, 6 \pmod{7}.$

In either case, we are guaranteed there is a $6, 0, 1 \pmod{7}$ value in $7$ . The difference comes down to if there is a $5 \pmod{7}$ value or a $1 \pmod{7}$ value. The person receiving such value will be able to determine all of $S$ but the $6, 0, 1 \pmod{7}$ people will not be able to differentiate the two cases ... yet.

Now consider which value among the consecutive integers is $c \equiv 3 \pmod{6}$ , if any. The person will know that $S$ is either $(c-3, c-2, c-1, c)$ or $(c, c+1, c+2, c+3)$ to have a $0 \pmod{6}$ value in $S$ . Neither the $6, 1 \pmod{7}$ person can be $3 \pmod{7}$ , else they can decipher what $S$ is right off the bat by considering which set has $0 \pmod{7}.$ This translates to the possible $5 \pmod{7}$ or $1 \pmod{7}$ person cannot be $0 \pmod{6}$ . We are given that $0 \pmod{7}$ and $0 \pmod{6}$ cannot be the same person. Hence we conclude one of the $6 \pmod{7}$ or $1 \pmod{7}$ must be the $0 \pmod{6}$ person.

Let the $6 \pmod{7}$ person be $0 \pmod{6}.$ Then--hypothetical-- $c \equiv 2 \pmod{7}$ person is $3 \pmod{6}.$ After the first round, the $6, 0, 1 \pmod{7}$ people realize that $2 \pmod{7}$ is not in $S$ else they would have deduced $S$ by noting $S$ was either $(c-3, c-2, c-1, c)$ or $(c, c+1, c+2, c+3)$ to have a $0 \pmod{6}$ and choosing the former based on where $0 \pmod{7}$ is. Hence they figure out $S$ by knowing $5 \pmod{7}.$ So $a \equiv 5 \pmod{7}$ and $a \equiv 5 \pmod{6}$ (from $6 \pmod{7}$ person being $0 \pmod{6}$ ).

Similarly, if $1 \pmod{7}$ person is $0 \pmod{6}$ we find that $a \equiv 6 \pmod{7}$ (so a $2 \pmod{7}$ is in $S$ ) and $a \equiv 4 \pmod{6}.$

By CRT, the possibilities are $a \equiv 5, 34 \pmod{42}.$ The sum of the greatest values of $S$ are the sum of $a + 3$ and so we get $(34 + 3) + (47 + 3) + (76 + 3) + (89 + 3) = \boxed{258}.$

~Aaryabhatta1

Video Solution

https://www.youtube.com/watch?v=7jKjilTRhs4

Animated Solution by Interstigation

https://youtu.be/TKXU33jnXkI

~Interstigation

@@ Line 4: / Line 4: @@
 However, upon hearing that all four students replied no, each student was able to determine the elements of <math>S</math>. Find the sum of all possible values of the greatest element of <math>S</math>.
 ==Solution 1==
-Let's start by listing the multiples of 6 and 7:
+Note that <math>\operatorname{lcm}(6,7)=42.</math> It is clear that <math>42\not\in S</math> and <math>84\not\in S,</math> otherwise the three other elements in <math>S</math> are divisible by neither <math>6</math> nor <math>7.</math>
-, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90, 96;
-, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 91, and 98. First of all, the multiples of 6 and 7 wouldn't work, so we can cross out 42 and 84.
-Since the students said they didn't know the answer, it must be that the set has no distinct integers from the sets. Let's list out the possible sets. Since they are in lists of 4, we need multiples of 6 or 7. Let's list them out.
-, 12, 13, 14
-, 13, 14, 15
-But if a student has 11 or 15, they would know. So that wouldn't work.
-The second set would be this: <math>\{34,35,36,37\}</math> <math>\{47,48,49,50\}</math> <math>\{76,77,78,79\}</math> <math>\{89,90,91,92\}</math>
-They couldn't know since the multiples of 7 is 35, and if you list it out, they wouldn't know about it since there are other sets such as 35, 36, 37, 38, and 33, 34, 35, 36. The people with these sets would say no, so the second set would WORK. The other sets are only 2 numbers, and since 2 numbers are sufficiently smaller than our 2nd set, we have concluded the answer is 37+50+79+92 = <math>\boxed{258}</math>.
-~Arcticturn
-==Solution 2 (Illustrations)==
-Note that <math>\mathrm{lcm}(6,7)=42.</math> It is clear that <math>42\not\in S</math> and <math>84\not\in S,</math> otherwise the three other elements in <math>S</math> are divisible by neither <math>6</math> nor <math>7.</math>
-In the table below, the multiples of <math>6</math> are colored in yellow, and the multiples of <math>7</math> are colored in green. By the least common multiple, we obtain cycles: If <math>n</math> is a possible maximum value of <math>S,</math> then <math>n+42</math> must be another possible maximum value of <math>S,</math> and vice versa. By observations, we write all possible maximum values of <math>S</math> in red.
+In the table below, the multiples of <math>6</math> are colored in yellow, and the multiples of <math>7</math> are colored in green. By the least common multiple, we obtain cycles: If <math>n</math> is a possible maximum value of <math>S,</math> then <math>n+42</math> must be another possible maximum value of <math>S,</math> and vice versa. By observations, we circle all possible maximum values of <math>S.</math>
 <asy>
 /* Made by MRENTHUSIASM */
 size(20cm);
-add(grid(42,3,white));
 fill((5,0)--(6,0)--(6,2)--(5,2)--cycle,yellow);
@@ Line 45: / Line 30: @@
 fill((42,2)--(42,1)--(41,1)--cycle,green);
-label("10",(9.5,2.5)); label("11",(10.5,2.5)); label("12",(11.5,2.5));
+for (real i=9.5; i<=41.5; ++i) {
-label("13",(12.5,2.5)); label("14",(13.5,2.5),red); label("15",(14.5,2.5),red);
+   label("$"+string(i+0.5)+"$",(i,2.5),fontsize(9pt));
-label("16",(15.5,2.5)); label("17",(16.5,2.5)); label("18",(17.5,2.5));
+}
-label("19",(18.5,2.5)); label("20",(19.5,2.5)); label("21",(20.5,2.5),red);
-label("22",(21.5,2.5)); label("23",(22.5,2.5)); label("24",(23.5,2.5),red);
+for (real i=0.5; i<=41.5; ++i) {
-label("25",(24.5,2.5)); label("26",(25.5,2.5)); label("27",(26.5,2.5));
+   label("$"+string(i+42.5)+"$",(i,1.5),fontsize(9pt));
-label("28",(27.5,2.5)); label("29",(28.5,2.5)); label("30",(29.5,2.5),red);
+}
-label("31",(30.5,2.5),red); label("32",(31.5,2.5)); label("33",(32.5,2.5));
-label("34",(33.5,2.5)); label("35",(34.5,2.5)); label("36",(35.5,2.5),red);
+for (real i=0.5; i<=14.5; ++i) {
-label("37",(36.5,2.5),red); label("38",(37.5,2.5),red); label("39",(38.5,2.5));
+   label("$"+string(i+84.5)+"$",(i,0.5),fontsize(9pt));
-label("40",(39.5,2.5)); label("41",(40.5,2.5)); label("42",(41.5,2.5));
+}
-label("43",(0.5,1.5)); label("44",(1.5,1.5)); label("45",(2.5,1.5));
-label("46",(3.5,1.5)); label("47",(4.5,1.5)); label("48",(5.5,1.5));
+draw(circle((6.5,1.5),0.45)); draw(circle((6.5,0.5),0.45));
-label("49",(6.5,1.5),red); label("50",(7.5,1.5),red); label("51",(8.5,1.5),red);
+draw(circle((7.5,1.5),0.45)); draw(circle((7.5,0.5),0.45));
-label("52",(9.5,1.5)); label("53",(10.5,1.5)); label("54",(11.5,1.5));
+draw(circle((8.5,1.5),0.45)); draw(circle((8.5,0.5),0.45));
-label("55",(12.5,1.5)); label("56",(13.5,1.5),red); label("57",(14.5,1.5),red);
+draw(circle((13.5,2.5),0.45)); draw(circle((13.5,1.5),0.45)); draw(circle((13.5,0.5),0.45));
-label("58",(15.5,1.5)); label("59",(16.5,1.5)); label("60",(17.5,1.5));
+draw(circle((14.5,2.5),0.45)); draw(circle((14.5,1.5),0.45)); draw(circle((14.5,0.5),0.45));
-label("61",(18.5,1.5)); label("62",(19.5,1.5)); label("63",(20.5,1.5),red);
+draw(circle((20.5,2.5),0.45)); draw(circle((20.5,1.5),0.45));
-label("64",(21.5,1.5)); label("65",(22.5,1.5)); label("66",(23.5,1.5),red);
+draw(circle((23.5,2.5),0.45)); draw(circle((23.5,1.5),0.45));
-label("67",(24.5,1.5)); label("68",(25.5,1.5)); label("69",(26.5,1.5));
+draw(circle((29.5,2.5),0.45)); draw(circle((29.5,1.5),0.45));
-label("70",(27.5,1.5)); label("71",(28.5,1.5)); label("72",(29.5,1.5),red);
+draw(circle((30.5,2.5),0.45)); draw(circle((30.5,1.5),0.45));
-label("73",(30.5,1.5),red); label("74",(31.5,1.5)); label("75",(32.5,1.5));
+draw(circle((35.5,2.5),0.45)); draw(circle((35.5,1.5),0.45));
-label("76",(33.5,1.5)); label("77",(34.5,1.5)); label("78",(35.5,1.5),red);
+draw(circle((36.5,2.5),0.45)); draw(circle((36.5,1.5),0.45));
-label("79",(36.5,1.5),red); label("80",(37.5,1.5),red); label("81",(38.5,1.5));
+draw(circle((37.5,2.5),0.45)); draw(circle((37.5,1.5),0.45));
-label("82",(39.5,1.5)); label("83",(40.5,1.5)); label("84",(41.5,1.5));
-label("85",(0.5,0.5)); label("86",(1.5,0.5)); label("87",(2.5,0.5));
-label("88",(3.5,0.5)); label("89",(4.5,0.5)); label("90",(5.5,0.5));
-label("91",(6.5,0.5),red); label("92",(7.5,0.5),red); label("93",(8.5,0.5),red);
-label("94",(9.5,0.5)); label("95",(10.5,0.5)); label("96",(11.5,0.5));
-label("97",(12.5,0.5)); label("98",(13.5,0.5),red); label("99",(14.5,0.5),red);
 draw((9,3)--(42,3));
@@ Line 96: / Line 75: @@
 }
 </asy>
 From the second row of the table above, we perform casework on the possible maximum value of <math>S:</math>
 <cmath>\begin{array}{c||c|c|l}
 & & & \\ [-2.5ex]
@@ Line 117: / Line 94: @@
 & \{77,78,79,80\} & & \text{The student who gets } 80 \text{ will reply yes.}
 \end{array}</cmath>
 Finally, all possibilities for <math>S</math> are <math>\{34,35,36,37\}, \{47,48,49,50\}, \{76,77,78,79\},</math> and <math>\{89,90,91,92\},</math> from which the answer is <math>37+50+79+92=\boxed{258}.</math>
@@ Line 127: / Line 103: @@
 /* Made by MRENTHUSIASM */
 size(20cm);
-add(grid(42,4,white));
 for (real j=5.5; j<41.5; j+=6)
@@ Line 145: / Line 119: @@
 fill((42,4)--(42,3)--(41,3)--cycle,green);
-label("43",(0.5,3.5)); label("44",(1.5,3.5)); label("45",(2.5,3.5));
+for (real i=0.5; i<=41.5; ++i) {
-label("46",(3.5,3.5)); label("47",(4.5,3.5)); label("48",(5.5,3.5));
+   label("$"+string(i+42.5)+"$",(i,3.5),fontsize(9pt));
-label("49",(6.5,3.5),red); label("50",(7.5,3.5),red); label("51",(8.5,3.5),red);
+}
-label("52",(9.5,3.5)); label("53",(10.5,3.5)); label("54",(11.5,3.5));
-label("55",(12.5,3.5)); label("56",(13.5,3.5),red); label("57",(14.5,3.5),red);
+draw(circle((6.5,3.5),0.45));
-label("58",(15.5,3.5)); label("59",(16.5,3.5)); label("60",(17.5,3.5));
+draw(circle((7.5,3.5),0.45));
-label("61",(18.5,3.5)); label("62",(19.5,3.5)); label("63",(20.5,3.5),red);
+draw(circle((8.5,3.5),0.45));
-label("64",(21.5,3.5)); label("65",(22.5,3.5)); label("66",(23.5,3.5),red);
+draw(circle((13.5,3.5),0.45));
-label("67",(24.5,3.5)); label("68",(25.5,3.5)); label("69",(26.5,3.5));
+draw(circle((14.5,3.5),0.45));
-label("70",(27.5,3.5)); label("71",(28.5,3.5)); label("72",(29.5,3.5),red);
+draw(circle((20.5,3.5),0.45));
-label("73",(30.5,3.5),red); label("74",(31.5,3.5)); label("75",(32.5,3.5));
+draw(circle((23.5,3.5),0.45));
-label("76",(33.5,3.5)); label("77",(34.5,3.5)); label("78",(35.5,3.5),red);
+draw(circle((29.5,3.5),0.45));
-label("79",(36.5,3.5),red); label("80",(37.5,3.5),red); label("81",(38.5,3.5));
+draw(circle((30.5,3.5),0.45));
-label("82",(39.5,3.5)); label("83",(40.5,3.5)); label("84",(41.5,3.5));
+draw(circle((35.5,3.5),0.45));
+draw(circle((36.5,3.5),0.45));
+draw(circle((37.5,3.5),0.45));
 label("Y",(3.5,2.5),blue); label("N",(4.5,2.5),blue);
@@ Line 192: / Line 168: @@
 draw((0,4)--(42,4));
 draw((0,3)--(42,3));
-</asy></li><p>
+</asy></li>
-   <li>As a confirmation, we can verify that each student will be able to deduce what <math>S</math> is upon hearing the replies of "no" in unison. <p>
+   <li>As a confirmation, we can verify that each student will be able to deduce what <math>S</math> is upon hearing the four replies of "no" in unison. For example, if <math>S=\{47,48,49,50\},</math> then all students will know that no one gets <math>46</math> or <math>51,</math> otherwise that student will reply yes (as discussed). Therefore, all students will conclude that <math>S</math> has only one possibility.</li><p>
-For example, if <math>S=\{47,48,49,50\},</math> then all students will know that no one gets <math>46</math> or <math>51,</math> otherwise that student will reply yes (as discussed). Therefore, all students will conclude that <math>S</math> has only one possibility.</li><p>
 </ol>
 ~MRENTHUSIASM
+==Solution 2==
+We know right away that <math>42\not\in S</math> and <math>84\not\in S</math> as stated in Solution 1.
+To get a feel for the problem, let’s write out some possible values of <math>S</math> based on the teacher’s remarks. The first multiple of 7 that is two-digit is 14. The closest multiple of six from 14 is 12, and therefore there are two possible sets of four consecutive integers containing 12 and 14; <math>\{11,12,13,14\}</math> and <math>\{12,13,14,15\}</math>. Here we get our first crucial idea; that if the multiples of 6 and 7 differ by two, there will be 2 possible sets of <math>S</math> without any student input. Similarly, if they differ by 3, there will be only 1 possible set, and if they differ by 1, 3 possible sets.
+Now we read the student input. Each student says they can’t figure out what <math>S</math> is just based on the teacher’s information, which means each student has to have a number that would be in 2 or 3 of the possible sets (This is based off of the first line of student input). However, now that each student knows that all of them have numbers that fit into more than one possible set, this means that S cannot have two possible sets because otherwise, when shifting from one set to the other, one of the end numbers would not be in the shifted set, but we know each number has to fall in two or more possible sets. For example, take <math>\{11,12,13,14\}</math> and <math>\{12,13,14,15\}</math>. The numbers at the end, 11 and 15, only fall in one set, but each number must fall in at least two sets. This means that there must be three possible sets of S, in which case the actual S would be the middle S.
+Take for example <math>\{33,34,35,36\}</math>, <math>\{34,35,36,37\}</math>, and <math>\{35,36,37,38\}</math>. 37 and 34 fall in two sets while 35 and 36 fall in all three sets, so the condition is met. Now, this means that the multiple of 6 and 7 must differ by 1.
+Since 42 means the difference is 0, when you add/subtract 6 and 7, you will obtain the desired difference of 1, and similarly adding/subtracting 6 or 7 from 84 will also obtain the difference of 1. Thus there are four possible sets of <math>S</math>; <math>\{34,35,36,37\}</math>, <math>\{47,48,49,50\}</math>, <math>\{76,77,78,79\}</math> and <math>\{89,90,91,92.\}</math>. Therefore the sum of the greatest elements of the possible sets <math>S</math> is <math>37+50+79+92=\boxed{258}</math>
+~KingRavi
+==Solution 3==
+In a solution that satisfies these constraints, the multiple of 6 must be adjacent to multiple of 7. The other two numbers must be on either side.
+WLOG assume the set is <math>\{a,6j,7k,b\}</math>. The student with numbers <math>a</math>, <math>6j</math>, and <math>7k</math> can think the set is <math>\{a-1, a,6j,7k\}</math> or <math>\{a,6j,7k,b\}</math>, and the students with number <math>6j</math>, <math>7k</math>, and <math>b</math> can think the set is <math>\{a,6j,7k,b\}</math> or <math>\{6j,7k,b, b+1\}</math>. Therefore, none of the students know the set for sure.
+Playing around with the arrangement of the multiple of 6 and multiple of 7 shows that this is the only configuration viewed as ambiguous to all the students. (Therefore when they hear nobody else knows either, they can find out it is this configuration)
+Considering <math>S</math> as <math>\{a,6j,7k,b\}</math>,b is 2 mod 6 and 1 mod 7, so <math>b</math> is 8 mod 42. (since it is all 2-digit, the values are either 50 or 92).
+Similarly, considering <math>S</math> as <math>\{a,7j,6k,b\}</math>, <math>b</math> is 1 mod 6 and 2 mod 7, so <math>b</math> is 37 mod 42. The values that satisfy that are 37 and 79.
+The total sum of all these values is therefore <math>50+92+37+89=\boxed{258}</math>.
+This solution will even work when the bounds (in this question, 2-digit so <100) are much larger and it is impractical to perform casework.
+~balav123
+==Solution 4 (Logic)==
+Consider the tuple <math>(a, a+1, a+2, a+3)</math> as a possible <math>S</math>. If one of the values in <math>S</math> is <math>3</math> or <math>4 \pmod{7}</math>, observe the student will be able to deduce <math>S</math> with no additional information. This is because, if a value is <math>b = 3 \pmod{7}</math> and <math>S</math> contains a <math>0 \pmod{7}</math>, then the values of <math>S</math> must be <math>(b-3, b-2, b-1, b)</math>. Similarly, if we are given a <math>b \equiv 4 \pmod{7}</math> and we know that <math>0 \pmod{7}</math> is in <math>S</math>, <math>S</math> must be <math>(b, b+1, b+2, b+3).</math> Hence, the only possibility for <math>a</math> is <math>5, 6 \pmod{7}.</math>
+In either case, we are guaranteed there is a <math>6, 0, 1 \pmod{7}</math> value in <math>7</math>. The difference comes down to if there is a <math>5 \pmod{7}</math> value or a <math>1 \pmod{7}</math> value. The person receiving such value will be able to determine all of <math>S</math> but the <math>6, 0, 1 \pmod{7}</math> people will not be able to differentiate the two cases ... yet.
+Now consider which value among the consecutive integers is <math>c \equiv 3 \pmod{6}</math>, if any. The person will know that <math>S</math> is either <math>(c-3, c-2, c-1, c)</math> or <math>(c, c+1, c+2, c+3)</math> to have a <math>0 \pmod{6}</math> value in <math>S</math>. Neither the <math>6, 1 \pmod{7}</math> person can be <math>3 \pmod{7}</math>, else they can decipher what <math>S</math> is right off the bat by considering which set has <math>0 \pmod{7}.</math> This translates to the possible <math>5 \pmod{7}</math> or <math>1 \pmod{7}</math> person cannot be <math>0 \pmod{6}</math>. We are given that <math>0 \pmod{7}</math> and <math>0 \pmod{6}</math> cannot be the same person. Hence we conclude one of the <math>6 \pmod{7}</math> or <math>1 \pmod{7}</math> must be the <math>0 \pmod{6}</math> person.
+Let the <math>6 \pmod{7}</math> person be <math>0 \pmod{6}.</math> Then--hypothetical--<math>c \equiv 2 \pmod{7}</math> person is <math>3 \pmod{6}.</math> After the first round, the <math>6, 0, 1 \pmod{7}</math> people realize that <math>2 \pmod{7}</math> is not in <math>S</math> else they would have deduced <math>S</math> by noting <math>S</math> was either <math>(c-3, c-2, c-1, c)</math> or <math>(c, c+1, c+2, c+3)</math> to have a <math>0 \pmod{6}</math> and choosing the former based on where <math>0 \pmod{7}</math> is. Hence they figure out <math>S</math> by knowing <math>5 \pmod{7}.</math> So <math>a \equiv 5 \pmod{7}</math> and <math>a \equiv 5 \pmod{6}</math> (from <math>6 \pmod{7}</math> person being <math>0 \pmod{6}</math>).
+Similarly, if  <math>1 \pmod{7}</math> person is <math>0 \pmod{6}</math> we find that <math>a \equiv 6 \pmod{7}</math> (so a <math>2 \pmod{7}</math> is in <math>S</math>) and <math>a \equiv 4 \pmod{6}.</math>
+By CRT, the possibilities are <math>a \equiv 5,  34 \pmod{42}.</math> The sum of the greatest values of <math>S</math> are the sum of <math>a + 3</math> and so we get <math>(34 + 3) + (47 + 3) + (76 + 3) + (89 + 3) = \boxed{258}.</math>
+~Aaryabhatta1
 ==Video Solution==
 https://www.youtube.com/watch?v=7jKjilTRhs4
+==Animated Solution by Interstigation==
+https://youtu.be/TKXU33jnXkI
+~Interstigation
 ==See Also==
 {{AIME box|year=2021|n=II|num-b=10|num-a=12}}
 {{MAA Notice}}

2021 AIME II (Problems • Answer Key • Resources)
Preceded by Problem 10	Followed by Problem 12
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search