Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How to prove or disprove this statement:

For all $c<z<0<s$, there exists $0<k\leq i$, $0\leq j<s+i$, such that all conditions hold simultaneously:

  1. $z=is+i(i-1)/2-j-k(s+i+2j)-k(k-1)/2$,
  2. $z<c+s+i+2j+k+1$ and $0<is+i(i-1)/2-j-(k-1)(s+i+2j)-(k-1)(k-2)/2$
  3. for all $0\leq m<i$ and $0<n<k$, a) holds

a) $ms+m(m-1)/2\neq is+i(i-1)/2-j-n(s+i+2j)-n(n-1)/2$

All variables are integers. I have tried computationally to find a counterexample but without luck.


This would imply the existence of several Self-avoiding walk on $\mathbb{Z}$ . (but not the converse.)

share|improve this question
7  
Seems like an extremely uninteresting question, which no one would ever want to think about. Maybe if we knew how you stumbled upon all those formulas, we'd find it worth a thought. –  Gerry Myerson Mar 1 '12 at 2:09
3  
I sort of appreciate the quirky humor involved in the current title, but I also think that I have a strange sense of humor. –  mixedmath Mar 1 '12 at 8:24
    
It's basically the same algorithm as in my answer here, but in 1 dimension: mathoverflow.net/questions/88659/… –  user26004 Mar 1 '12 at 8:25
2  
+1: for the title! –  Aryabhata Mar 1 '12 at 19:54
6  
@mmm: please stop with these ridiculous edits. You are needlessly bumping this question up to the front page, and those edits can be seen as vandalism. –  Willie Wong Mar 2 '12 at 9:03

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.