http://z5lcip2ba3ec6v5za5snjzncpvr6ocyvqnkox2alerut6ruozpjtvkqd.onion/math/catalog
[bold: Challenge ] : Can you prove that the algorithms shown in the video obey the familiar rules of working with numbers >(a+b)+c=a+(b+c), a+0=a, a+(-a)=0, a+b=b+a, >(a*b)*c=a*(b*c), a*(b+c)=a*b+a*c, (a+b)*c=a*c+b*c >a*1=a, 1*a=a, a*b=b*a or in other words, that the n-adic integers are a commutative ring...