|
%I #7 Dec 05 2013 19:56:13
%S 1,1,3,1,2,5,1,3,5,7,1,2,3,4,9,1,5,7,11,13,19,1,2,3,4,5,6,13,1,3,5,7,
%T 9,11,13,15,1,2,4,5,7,8,10,11,13,1,3,7,9,11,13,17,19,21,31,1,2,3,4,5,
%U 6,7,8,9,10,21,1,5,7,11,13,17,19,23,25,29,31,35,1,2,3,4,5,6,7,8,9,10,11,12
%N Triangle read by rows in which the n-th row contains n smallest numbers whose product == 1 mod n.
%e 1
%e 1 3
%e 1 2 5
%e 1 3 5 7
%e 1 2 3 4 9
%e 1 5 7 11 13 19
%e ...
%o (PARI) for (n = 1, 70, rowProd = 1; x = 1; for (k = 1, n - 1, while (gcd(x, n) > 1, x = x + 1); print1(x); print1(" "); write1("a083106.txt", x); write1("a083106.txt", " "); rowProd = rowProd*x; x = x + 1); while (rowProd*x%n != 1%n, x = x + 1); print(x); write1("a083106.txt", x); write1("a083106.txt", " "); write1("a083107.txt", x); write1("a083107.txt", " "); write1("a083108.txt", rowProd*x); write1("a083108.txt", " "); write1("a083109.txt", (rowProd*x-1)/n); write1("a083109.txt", " "));
%Y Cf. A083107, A083108, A083109.
%K nonn,tabl
%O 1,3
%A _Amarnath Murthy_, Apr 22 2003
%E More terms from _David Wasserman_, Oct 08 2004
|
