0 like 0 dislike
0 like 0 dislike
is this enough for the proof

1 Answer

0 like 0 dislike
0 like 0 dislike
I might be misreading something, but how can you pick 2^(k) elements from S, which seems to have only k elements?

I'm not sure I follow your proof (I can look at it more closely later), but note that every positive element of S is just a string of 2s in base 3.

No related questions found

24.8k questions

103k answers


33.7k users

OhhAskMe is a math solving hub where high school and university students ask and answer loads of math questions, discuss the latest in math, and share their knowledge. It’s 100% free!