[ QuizWit ] in KIDS 글 쓴 이(By): iLUSiON (띠띠빤쮸) 날 짜 (Date): 2006년 2월 14일 화요일 오후 11시 13분 39초 제 목(Title): Re: 루트2의 배수들의 정수부분 1000개 더� is it just me why i can't understand what int255 wrote. when you pose problem, clearly state the problem without any lose end. the answer is \sum_{n=1}^m n 2^{1/2} = \sqrt{2} m(m+1)/2 = m(m+1)/sqrt{2}. now what pattern you are talking about? we can change the problem a bit. let r1 and r2 be rational numbers that bound \sqrt{2} so that r1 < \sqrt{2} <r2. then i am sure you can find bound the experession in bounded pattern. hahahah... oh this is neat.... :) iLUSiON - le plus grand de tous http://cyworld.nate.com/ilusion |