clean up the example modp

scripts/modp.py

@@ -3,8 +3,11 @@ from finite_fields.modp import IntegersModP
 q = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001
 modq = IntegersModP(q)
 
-print("0x%x" % modq(2).inverse().n)
-inv2 = 0x39f6d3a994cebea4199cec0404d0ec02a9ded2017fff2dff7fffffff80000001
-assert modq(2).inverse().n == inv2
-print((2 * inv2) % q)
+two = modq(2)
+inv2 = modq(2).inverse()
+print("Inverse of 2 = 0x%x" % inv2.n)
+# This is from bellman
+inv2_bellman = 0x39f6d3a994cebea4199cec0404d0ec02a9ded2017fff2dff7fffffff80000001
+assert inv2.n == inv2_bellman
+assert (2 * inv2.n) % q == 1