| [ QuizWit ] in KIDS 글 쓴 이(By): iLUSiON (띠띠빤쮸) 날 짜 (Date): 2007년 7월 13일 금요일 오전 03시 36분 11초 제 목(Title): Re: [Q] 서로다른 연속된 자연수의 합. this is a boring problem.... something to do with complement of numbers. for k= 1 + (k-1) = 2+ (k-2)... so for arbitary k, there are always O(k/2) unique representations. now for each given unique representation, check if we have futhre unique representations. that is for k= m + (m-k), do we have unique representions for m and (m-k). if we let N(k) to be the # of unique representions, we set up recurssive formula somehow. probably the simplest way might be N(k) = bla bla bla + bla bla bla * N(k/P), where P is some interger. My guess is N(k) > O(k/2) + O(k/4) + O(k/8) + O(k/16)..... ;) iLUSiON - le plus grand de tous http://cyworld.nate.com/ilusion |