# Thread:

1. ## Relations in a set

Hello,
Given is a positive integer $k$. Prove that out of every set of integers which has more than $3^k$ elements one can pick out a sub-set $S$ with $k+1$ elements and the following quality:
for any two subsets $A,B\subseteq S$ the sum of all elements in A is different from the sum of all elements in B.

I've been trying to play with base-system representation for a while but it leads me nowhere. Your help will be appreciated.

2. I'm not sure about this, but I do have an idea about how you could approach this. Maybe you can prove that there is a subset you can make such that all numbers are "out of reach". For example, for k = 3 and the set is all numbers up until 27, the numbers 1, 4, 9 and 27 satisfy S.
Maybe if you order them and pick the $3^0$th, $3^1$th, $3^2$th, $3^3$th, etc. ?

3. Ok, but these numbers don't have to start with 1 and increment by 1, they can be any numbers, including negatives.

4. Yeah, I know. Hence the "maybe if you order them".
I have no idea how to actually prove this, but this was something that sprang to mind.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 9, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9622909426689148, "perplexity_flag": "head"}