MatsGranvik

Twiddlewood conjecture

Jul 22nd, 2018
355
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.30 KB | None | 0 0
  1. (*program 1 start*)
  2. Clear[nn, a, n, d, h, T2, T4, k, m];
  3. nn = 25;
  4. mm = 7;
  5. a[n_] := If[n < 1, 0, Sum[d*MoebiusMu@d, {d, Divisors[n]}]];
  6. h = 2;
  7. TableForm[
  8. T2 = Table[
  9. Table[Table[
  10. If[Mod[n, k] == 0, a[GCD[n/k, m]]*a[GCD[k, m + h]], 0], {k, 1,
  11. n}], {m, 1, nn}], {n, mm, mm}]]
  12. h = 4;
  13. TableForm[
  14. T4 = Table[
  15. Table[Table[
  16. If[Mod[n, k] == 0, a[GCD[n/k, m]]*a[GCD[k, m + h]], 0], {k, 1,
  17. n}], {m, 1, nn}], {n, mm, mm}]]
  18. (*program 1 end*)
  19.  
  20. (*program 2 start*)
  21. Clear[nn, a, n, d, h, T2, T4, k, m, mm];
  22. TableForm[Table[
  23. nn = mm;
  24. a[n_] := If[n < 1, 0, Sum[d*MoebiusMu@d, {d, Divisors[n]}]];
  25. TableForm[{Table[{n, a[n]}, {n, 1, mm}]}];
  26. TableForm[{aa = Table[{n, a[GCD[n, mm]]}, {n, 1, mm}]}];
  27. h = 2;
  28. TableForm[
  29. T2 = Table[
  30. Table[Table[
  31. If[Mod[n, k] == 0, a[GCD[n/k, m]]*a[GCD[k, m + h]], 0], {k, 1,
  32. n}], {m, 1, nn}], {n, mm, mm}]];
  33. TableForm[
  34. bb2 = mm - Sort[Position[T2, aa[[mm, 2]]], #1[[3]] < #2[[3]] &]];
  35. h = 4;
  36. TableForm[
  37. T4 = Table[
  38. Table[Table[
  39. If[Mod[n, k] == 0, a[GCD[n/k, m]]*a[GCD[k, m + h]], 0], {k, 1,
  40. n}], {m, 1, nn}], {n, mm, mm}]];
  41. TableForm[
  42. bb4 = mm - Sort[Position[T4, aa[[mm, 2]]], #1[[3]] < #2[[3]] &]];
  43. {mm, Length[bb2 - bb4], {bb4 - bb2}}, {mm, 1, 100}]]
  44. (*program 2 end*)
Advertisement
Add Comment
Please, Sign In to add comment