What numbers are not in this set?

Let S S be a minimal set of positive integers with the following properties:

  • 2 S 2 \in S

  • ( n + 5 ) 2 S (n+5)^2\in S whenever n S n \in S

  • n S n\in S whenever n 2 S n^2\in S

Which of the following is not in S S ? Enter your answer as the sum of the bold numbers next to the correct answers (for example, if 2, 4, and 7 are not in S S , enter 2+8+64 = 74).

- 1 : 1

- 2 : 2

- 4 : 3

- 8 : 4

- 16 : 5

- 32 : 6

- 64 : 7

- 128 : 8

- 256 : 9

- 512 : 10

This problem was inspired by a problem on the 2017 William Lowell Putnam Exam.


The answer is 529.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Will van Noordt
Dec 31, 2017

We will construct all elements of S S :

We might observe that if n S n\in S , then n + 5 S n+5\in S , since ( n + 5 ) 2 S (n+5)^2\in S . We can extend this to the fact that n + 5 k , ( n + 5 k ) 2 S n+5k, (n+5k)^2\in S for positive integers k k (call this "statement (A)", it will be useful later).

So, since 2 S 2\in S , we know that x S x\in S if x 2 m o d 5 x \equiv 2 \mod 5 . We will now show that 3 , 4 , 11 S 3, 4, 11\in S :

Note that, by statement (A), that 4 9 2 S 49^2\in S =2401, thereby implying that 2401 + 5 k S 2401 + 5k\in S or, if k = 2 c k = 2c , 2401 + 10 c S 2401 + 10c\in S and therefore, 3 8 = 6561 S 3^8 = 6561\in S . We can see that 3 8 = 3 4 ) 2 3^8 = 3^4)^2 , and so 3 4 S 3^4\in S . We can repeat this to find that 3 2 3^2 and 3 S 3\in S .

Since 3 4 = 81 S 3^4=81\in S , we also have that 121 S 121\in S by statement (A), and therefore 11 S 11\in S .

A similar argument shows that 4 S 4 \in S :

11 S 11 \in S implies that ( 11 + 5 ) 2 = 1 6 2 = 4 4 S (11+5)^2 = 16^2 = 4^4 \in S , and so 4 2 4^2 and 4 S 4 \in S .

We can show that 1 ∉ S 1\not\in S by noting that since S S is minimal, all elements of S S can be constructed by invoking the given rules. Clearly, only the second rule would allow us to show that 1 S 1 \in S , but that would imply that 6 -6 or 4 S -4 \in S , contradicting the positivity of S S .

We can also show that no integer f f satisfying f 0 m o d 5 f \equiv 0 \mod 5 :

Note that by statement (A) and the arguments resented above, if any multiple of 5 is in S S , then all multiples of 5 are in S S . However, for any multiple of 5 to be in S S , we must already have an element of S S whose square is a multiple of 5. However, we do not have this, since if x 0 m o d 5 x \equiv 0 \mod 5 , then x 2 0 m o d 5 x^2 \equiv 0 \mod 5 . So, there are no multiples of 5 in S S .

Therefore, S S is equivalent to the set of positive integers { x > 1 : x ≢ 0 m o d 5 } \{x > 1: x \not\equiv 0 \mod 5\} . Therefore, 1 1 , 5 5 , and 10 10 are not in S S , so the answer is 1 + 16 + 512 = 529 1+16+512 = 529 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...