|
Search: id:A071685
|
|
|
| A071685 |
|
Non-palindromic solutions to Mod[x,Rev[x]]=0, (x>Rev[x]) which solutions are not divisible by 10. Rev[x] is the reverse of x (=A004086[x]). |
|
+0
2
|
|
| 1089, 2178, 8712, 9801, 10989, 21978, 87912, 98901, 109989, 219978, 879912, 989901, 1099989, 2199978, 8799912, 9899901, 10999989, 21999978, 87999912, 98999901, 109999989, 219999979
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
x=q*Rev[x], q is integer q><1, q><10^j and neither of x or Rev[x] is divisible with 10.
|
|
EXAMPLE
|
Palindromic solutions like 12021 or also solutions divisible by 10 were filtered out like {8380,838; q=10} or {8400,48; q=175}. All remaining solutions seem to have the form 10..999..89,98..999..01,21..999..78,87..999..12. In case of m>Rev[m], q=m/Rev[m]=4 or 9.
|
|
MATHEMATICA
|
nd[x_, y_] := 10*x+y tn[x_] := Fold[nd, 0, x] ed[x_] := IntegerDigits[x] red[x_] := Reverse[IntegerDigits[x]] Do[s=Mod[Max[{n, tn[red[n]]}], Min[{n, r=tn[red[n]]}]]; If[Equal[s, 0]&&!Equal[Mod[n, 10], 0] &&!Equal[n, r], Print[{n, r/n}]], {n, 1, 1000000}]
|
|
CROSSREFS
|
Cf. A004086, A055483, A069554.
Sequence in context: A010091 A157256 A110819 this_sequence A008919 A110843 A023093
Adjacent sequences: A071682 A071683 A071684 this_sequence A071686 A071687 A071688
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 03 2002
|
|
|
Search completed in 0.002 seconds
|
