Comments on: A CS Puzzle http://www.sids.in/blog/2008/05/a-cs-puzzle/ if I'm not having fun, I'm not doing it right Tue, 02 Aug 2011 12:41:04 +0000 hourly 1 http://wordpress.org/?v=3.3 By: sanket http://www.sids.in/blog/2008/05/a-cs-puzzle/comment-page-1/#comment-5598 sanket Tue, 20 May 2008 12:32:10 +0000 http://www.sids.in/blog/2008/05/20/a-cs-puzzle/#comment-5598 Umm.. looks more like a theory kosteen. Can I rephrase it like this? Given an infinite sequence of numbers, can we guarantee that we can find sums of subsequences that map onto all possible values of k? The mapping is in terms of multiples of k or k itself, if the sum is prime., What I am thinking is, given an infinite sequence of numbers, start at a random location and go on computing the sums. Each sum will be a multiple of some 'k' or the other (or prime). So, it is possible to at least one subsequence whose sum is divisible by a given 'k'. I don't know if this is valid at all. That aside, what is also not clear in your kosteen is: is it about being able to say that there is such a sequence or *finding* such a sequence (and then of course, saying that there is a sequence). Umm.. looks more like a theory kosteen. Can I rephrase it like this?

Given an infinite sequence of numbers, can we guarantee that we can find sums of subsequences that map onto all possible values of k? The mapping is in terms of multiples of k or k itself, if the sum is prime.,

What I am thinking is, given an infinite sequence of numbers, start at a random location and go on computing the sums. Each sum will be a multiple of some ‘k’ or the other (or prime). So, it is possible to at least one subsequence whose sum is divisible by a given ‘k’.

I don’t know if this is valid at all. That aside, what is also not clear in your kosteen is: is it about being able to say that there is such a sequence or *finding* such a sequence (and then of course, saying that there is a sequence).

]]>