From: wyniijj5@gmail.com   
      
   On Mon, 2026-01-26 at 23:51 +0800, wij wrote:   
      
      
   The proof is pretty much finalized, only 122 lines.   
   rcop3(int n) is provided with guidelines about how to prove it. But no one can   
   verify, because it is told and so believed IMPOSSIBLE! Funny! 15 lines of codes   
   with verification instructions, no one can test, and think they are expert C   
   developer!   
   Posting is just a procedure and must assume some can verify (don't make the   
   mistake, the self-illusion that I need your 'professional' verification).   
      
   https://sourceforge.net/projects/cscall/files/MisFiles/Coll-proo   
   -en.txt/download    
   ....[cut]    
         void rcop3(int n) {   
           int a=n,b=0;    
           for(; a+b!=1;) {    
             if((a%2)!=0) {    
               --a; ++b;    
             }   
             // a/b measure point A   
             if((b%2)!=0) {   
               a= 3*a;   
               b= 3*b+1;    
             }     
             a= a/2;   
             b= b/2;   
           }     
         }   
      
         // .....    
         This proof demonstrates:   
           1. The ratio a/b is decreasing.   
           2. b has limit.   
           3. a must decrease to below b because of the above reasons.   
           4. Done, n=a+b has limit (cop(n) is known to terminate for n<2¹⁶ at   
              least.   
   ---------------------------------   
      
   Funny!!!!!!!!   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)