geometry!!!!
posted by bravo .
Let A be a subset of T={1,2,…,100} subject to the condition that if 2 distinct elements a and b are in A, then a+b is not in A. What is the maximum value of A, which is the number of elements in A?

geometry!!!! 
Steve
Looks like 51 to me.
If 49 is in A, 50,51 cannot be in A
If 48 is in A, 50,51,52 cannot be in A.
if n<50 is in A, we must exclude 51n elements from A.
So, including 50,51,...100 in A, we get 51 elements.
Respond to this Question
Similar Questions

elmentary math for educators
Suppose B is proper subset of C. If n(c)=8, what is the maximum number of elements n B? 
Math(Subsets)
Part 1 I have to use symbols in my anwser Suppose B is proper subset of C If n(c)=8, what is the maxium number of elements in n (B) What is the least possible numbers of Elements in B? 
geometry!!!!
Let A be a subset of T={1,2,…,100} subject to the condition that if 2 distinct elements a and b are in A, then a+b is not in A. What is the maximum value of A, which is the number of elements in A? 
mathematics
Let A be a subset of T={1,2,…,100} subject to the condition that if 2 distinct elements a and b are in A, then a+b is not in A. What is the maximum value of A, which is the number of elements in A? 
geometry!!! please help me!!!!
Determine the least positive integer n for which the following condition holds: No matter how the elements of the set of the first n positive integers, i.e. {1,2,…n}, are colored in red or blue, there are (not necessarily distinct) … 
Maths
For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums? 
math please helppppppp
For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums? 
MATHS
For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums? 
MATHS!!!Please HELP..:'(
For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums? 
math
Consider the set {1,2,3,4,5,6,7,8,9,10}. For each subset, calculate the sum of the elements in the subset. How many distinct sums can we get?