|
| |
|
|
A094185
|
|
Number of solutions to n == xy (mod z) == yz (mod x) == zx (mod y) with 0 < x < y < z.
|
|
1
| |
|
|
1, 6, 12, 24, 24, 49, 41, 59, 61, 100, 56, 132, 76, 127, 122, 165, 87, 223, 95, 207, 176, 190, 110, 318, 187, 232, 211, 342, 137, 440, 127, 327
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Possner (see also Knuth) asks for solutions when n=2. There is at least one solution for all positive n: (x,y,z) = (n+1, n^2+2n, n^3+3n^2+n). All solutions appear to be in the polytope n < x <= 2n^2+n, x < y <= 2n^3+2n^2-n, y < z <= n^5+2n^4+2n^3+n^2-n. Many solutions, especially for prime n, are such that n divides x, y and z. See A094595.
|
|
|
REFERENCES
| M. F. Possner, Problem 11021, Amer. Math. Monthly, 110 (2003), p. 542
D. E. Knuth, Solution 11021, Amer. Math. Monthly, 112 (2005), p. 279
|
|
|
EXAMPLE
| a(2) = 6 because there are 6 solutions: (x,y,z) = (3, 8, 22), (3, 10, 14), (4, 5, 18), (4, 6, 11), (6, 14, 82) and (6, 22, 26).
|
|
|
MATHEMATICA
| Table[cnt=0; Do[d=Divisors[x*y-n]; Do[z=d[[i]]; If[z>y, If[Mod[x*z, y]==n && Mod[y*z, x]==n, cnt++; ]], {i, Length[d]}], {x, n+1, n(2n+1)}, {y, x+1, n(2n^2+2n-1)}]; cnt, {n, 10}]
|
|
|
CROSSREFS
| Cf. A094595 (number of solutions to 1 = nxy (mod z) = nyz (mod x) = nzx (mod y) with 0<x<y<z).
Sequence in context: A172079 A081512 A096387 * A074902 A096366 A188158
Adjacent sequences: A094182 A094183 A094184 * A094186 A094187 A094188
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| T. D. Noe (noe(AT)sspectra.com), May 06 200, revised May 13 2004
|
| |
|
|
