2016-10-09 03:49:01 -0500 | received badge | ● Self-Learner (source) |
2016-10-09 03:49:01 -0500 | received badge | ● Teacher (source) |
2016-10-01 16:05:17 -0500 | answered a question | Cryptographic Mathematics Update: |
2016-10-01 16:04:16 -0500 | commented question | Cryptographic Mathematics i=7 n=2 for n in range(2,100): i=i+gcd(n,i) print i |
2016-10-01 16:02:34 -0500 | commented answer | Cryptographic Mathematics i=7 n=2 for n in range(2,100): i=i+gcd(n,i) print i |
2016-10-01 14:38:39 -0500 | received badge | ● Student (source) |
2016-10-01 14:36:54 -0500 | commented answer | Cryptographic Mathematics could you please post the code of Sage? |
2016-10-01 14:18:14 -0500 | asked a question | Cryptographic Mathematics Q: Programme Rowland’s formula and verify his results. Try different starting values and see what happens. In Sage math cloud, I did this: Could you help, please? |
2016-10-01 14:18:14 -0500 | asked a question | Cryptographic Mathematics Q: Programme Rowland’s formula and verify his results. Try different starting values and see what happens. In Sage math cloud, I did this: i=7 n=2 for n in [1..10]: i=i+gcd(n,i) print i Could you help, please? |