1) The best way to solve this would not be through using the geometric progression formula. Too tedious. Best way to solve it is through intuition. First number is -1/2, next is 1/4, and then -1/8 and so on and so forth, so essentially when you add the first and second term you get -1/4, so the answer has to be in negative realm. So the summation is essentially less than 1/4 for when t(n) = (-1^k)*(2^-k) = (-1/2)^k

2) There is a slight problem with the question; it has to state MUST or COULD be integers...because if you factor out 450 = 2*3^2*5^2, so y should be of any such form; 2^2*3*5, so it can also be 2^5*3^4*5^4 and so on so forth. Now 2^5*3^4*5^4 is divisible by all three of them provided y is greater than 2*3^2*5^2 which is the smallest such form. All you need to do is create 450y such that it can be cube rooted. So there are infinitely many such forms all of which are divisible by the three of them if the question was; "which of the following could be integers?". If the question was "which of the following must be integers" then clearly the answer is 1 only.