2016-10-09 10:49:01 +0100 received badge ● Self-Learner (source) 2016-10-09 10:49:01 +0100 received badge ● Teacher (source) 2016-10-01 23:05:17 +0100 answered a question Cryptographic Mathematics Update: i=7 n=2 for n in range(2,100): i=i+gcd(n,i) print i  2016-10-01 23:04:16 +0100 commented question Cryptographic Mathematics i=7 n=2 for n in range(2,100): i=i+gcd(n,i) print i 2016-10-01 23:02:34 +0100 commented answer Cryptographic Mathematics i=7 n=2 for n in range(2,100): i=i+gcd(n,i) print i 2016-10-01 21:38:39 +0100 received badge ● Student (source) 2016-10-01 21:36:54 +0100 commented answer Cryptographic Mathematics could you please post the code of Sage? 2016-10-01 21:18:14 +0100 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? 2016-10-01 21:18:14 +0100 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?