Collaborative Calculation and Data Science

colby

sagemath

cornellcollege

facebook

github

google

twitter

depaul

solve 3n+1 Problem. `h(x)=4*x+1` and `v(x)=(2*x-1)/3 or (4*x-1)/3` iterate to Collatz-Odd-Tree

Conjecture: when n>1 and 0< b< sqrt(n)-1, Mersenne number 2^(n^2±b)-1 is always composite. 

2019-09-02, Cody Luo (cody@ustc.edu), a programmer who graduated from the University of Science and Technology of China, the webmaster of 2293.ml, gave a proof of Goldbach's Conjecture at github.com/a-boy/playmath (Sagemath Jupyter document), using the method of "distributing distinct prime factors", found and proved two concise inequalities.

RamseyNumber(k+1,v+1)-1≡0,k,k+1mod(2k+1)

cody luo