k = 288; W[p_] := Log[k]/Log[p]; U = {}; Do[V = 2^a*3^b; If[V <= k, n = Sqrt[V + 1];
If[IntegerQ[n], AppendTo[U, {a, b, n}]]], {a, 0, W[2]}, {b, W[3]}]; SortBy[U, Last]
{{0, 1, 2}, {3, 1, 5}, {4, 1, 7}, {5, 2, 17}}
\(n^2-1=(n-1)(n+1)=2^a*3^b, b > 0\)——这里 k = 288 有 4 个解。问题来了——不管如何加大 k, 还是这 4 个解。为什么呀?
k = 25920; W[p_] := Log[k]/Log[p]; U = {}; Do[V = 2^a*3^b*5^c; If[V <= k, n = Sqrt[V + 1];
If[IntegerQ[n], AppendTo[U, {a, b, c, n}]]], {a, 0, W[2]}, {b, 0, W[3]}, {c, W[5]}]; SortBy[U, Last]
{{0, 1, 1, 4}, {4, 0, 1, 9}, {3, 1, 1, 11}, {3, 2, 1, 19}, {0, 3, 2, 26}, {6, 1, 1, 31}, {5, 1, 2, 49}, {6, 4, 1, 161}}
\(n^2-1=(n-1)(n+1)=2^a*3^b*5^c, c > 0\)——这里 k = 25920 有 8 个解。问题来了——不管如何加大 k, 还是这 8 个解。为什么呀?
k = 76545000; W[p_] := Log[k]/Log[p]; U = {}; Do[V = 2^a*3^b*5^c*7^d; If[V <= k, n = Sqrt[V + 1];
If[IntegerQ[n], AppendTo[U, {a, b, c, d, n}]]], {a, 0, W[2]}, {b, 0, W[3]}, {c, 0, W[5]}, {d, W[7]}]; SortBy[U, Last]
{{0, 0, 1, 1, 6}, {0, 2, 0, 1, 8}, {3, 1, 0, 1, 13}, {5, 0, 0, 1, 15}, {3, 1, 1, 1, 29}, {4, 1, 1, 1, 41}, {4, 3, 0, 1, 55}, {4, 2, 1, 1, 71},
{6, 1, 0, 2, 97}, {3, 0, 2, 2, 99}, {8, 2, 0, 1, 127}, {0, 5, 1, 2, 244}, {3, 2, 3, 1, 251}, {7, 2, 2, 1, 449}, {7, 1, 2, 4, 4801}, {3, 7, 4, 1, 8749}}
\(n^2-1=(n-1)(n+1)=2^a*3^b*5^c*7^d, d > 0\)——这里 k = 76545000 有 16 个解。问题来了——不管如何加大 k, 还是这 16 个解。为什么呀?
k = 384199200; W[p_] := Floor[Log[k]/Log[p]]; U = {}; Do[V = 2^a*3^b*5^c*7^d*11^f; If[V <= k, n = Sqrt[V + 1];
If[IntegerQ[n], AppendTo[U, {a, b, c, d, f, n}]]], {a, 0, W[2]}, {b, 0, W[3]}, {c, 0, W[5]}, {d, 0, W[7]}, {f, W[11]}]; SortBy[U, Last]
{{0, 2, 0, 0, 1, 10}, {3, 0, 1, 0, 1, 21}, {4, 1, 0, 0, 1, 23}, {0, 1, 1, 1, 1, 34}, {3, 1, 0, 1, 1, 43}, {7, 1, 0, 0, 1, 65}, {0, 1, 2, 1, 1, 76}, {4, 2, 1, 0, 1, 89}, {3, 3, 1, 0, 1, 109}, {5, 0, 1, 1, 1, 111},
{3, 2, 0, 2, 1, 197}, {4, 2, 2, 0, 1, 199}, {5, 1, 1, 0, 2, 241}, {6, 0, 2, 1, 1, 351}, {3, 5, 0, 0, 2, 485}, {9, 1, 1, 1, 1, 769}, {5, 2, 1, 2, 1, 881}, {4, 3, 1, 2, 1, 1079}, {6, 3, 2, 1, 2, 6049}, {5, 4, 2, 2, 2, 19601}}
\(n^2-1=(n-1)(n+1)=2^a*3^b*5^c*7^d*11^F, F > 0\)——这里 k = 384199200 有 20 个解。问题来了——不管如何加大 k, 还是这 20 个解。为什么呀?
k = 999999999999999; W[p_] := Floor[Log[k]/Log[p]]; U = {}; Do[V = 2^a*3^b*5^c*7^d*11^f*13^g; If[V <= k, n = Sqrt[V + 1];
If[IntegerQ[n], AppendTo[U, {a, b, c, d, f, g, n}]]], {a, 0, W[2]}, {b, 0, W[3]}, {c, 0, W[5]}, {d, 0, W[7]}, {f, 0, W[11]}, {g, W[13]}]; SortBy[U, Last]
{{0, 0, 0, 0, 1, 1, 12}, {0, 1, 1, 0, 0, 1, 14}, {4, 1, 0, 0, 0, 1, 25}, {3, 0, 0, 1, 0, 1, 27}, {3, 0, 2, 0, 0, 1, 51}, {3, 3, 0, 0, 0, 1, 53}, {0, 2, 1, 1, 0, 1, 64}, {5, 1, 1, 0, 0, 1, 79}, {8, 0, 1, 0, 0, 1, 129},
{3, 1, 1, 0, 1, 1, 131}, {3, 1, 0, 1, 1, 1, 155}, {3, 2, 1, 1, 0, 1, 181}, {5, 1, 1, 1, 0, 1, 209}, {0, 1, 2, 1, 1, 1, 274}, {6, 2, 0, 0, 1, 1, 287}, {5, 1, 0, 1, 0, 2, 337}, {4, 1, 1, 2, 0, 1, 391}, {4, 4, 2, 0, 0, 1, 649},
{3, 3, 2, 1, 0, 1, 701}, {7, 3, 0, 0, 1, 1, 703}, {4, 1, 0, 1, 2, 1, 727}, {0, 0, 1, 1, 2, 2, 846}, {6, 1, 4, 0, 0, 1, 1249}, {4, 3, 2, 0, 0, 2, 1351}, {5, 6, 0, 1, 0, 1, 1457}, {0, 2, 2, 1, 2, 1, 1574}, {5, 0, 3, 1, 1, 1, 2001},
{4, 1, 1, 3, 1, 1, 3431}, {7, 3, 1, 1, 1, 1, 4159}, {14, 2, 1, 1, 0, 1, 8191}, {9, 1, 2, 0, 1, 2, 8449}, {11, 0, 1, 0, 3, 1, 13311}, {5, 2, 0, 1, 3, 2, 21295}, {8, 6, 2, 1, 1, 2, 246401}}
\(n^2-1=(n-1)(n+1)=2^a*3^b*5^c*7^d*11^F*13^g, g > 0\)——这里 k = 999999999999999(?) 有 34 个解。问题来了——不管如何加大 k, 还是这 34 个解。为什么呀?
k = 999999999999999; W[p_] := Floor[Log[k]/Log[p]]; U = {}; Do[V = 2^a*3^b*5^c*7^d*11^f*13^g*17^j; If[V <= k, n = Sqrt[V + 1];
If[IntegerQ[n], AppendTo[U, {a, b, c, d, f, g, j, n}]]], {a, 0, W[2]}, {b, 0, W[3]}, {c, 0, W[5]}, {d, 0, W[7]}, {f, 0, W[11]}, {g, 0, W[13]}, {j, W[17]}]; SortBy[U, Last]
{{0, 1, 1, 0, 0, 0, 1, 16}, {6, 0, 0, 0, 0, 0, 1, 33}, {3, 2, 0, 0, 0, 0, 1, 35}, {0, 1, 0, 2, 0, 0, 1, 50}, {3, 1, 0, 0, 1, 0, 1, 67}, {3, 0, 1, 1, 0, 0, 1, 69}, {3, 1, 2, 0, 0, 0, 1, 101}, {4, 1, 0, 0, 0, 1, 1, 103},
{0, 2, 0, 1, 0, 1, 1, 118}, {0, 0, 0, 1, 2, 0, 1, 120}, {4, 1, 1, 1, 0, 0, 1, 169}, {0, 3, 0, 1, 1, 0, 1, 188}, {5, 1, 1, 1, 0, 0, 1, 239}, {5, 3, 1, 0, 0, 0, 1, 271}, {3, 2, 0, 1, 1, 0, 1, 307}, {3, 0, 1, 0, 0, 2, 1, 339},
{4, 0, 1, 0, 1, 1, 1, 441}, {10, 1, 1, 0, 0, 0, 1, 511}, {6, 1, 0, 1, 0, 1, 1, 545}, {7, 2, 0, 0, 0, 0, 2, 577}, {3, 1, 3, 0, 1, 0, 1, 749}, {3, 2, 0, 2, 0, 1, 1, 883}, {6, 1, 1, 1, 1, 0, 1, 1121}, {3, 3, 1, 1, 1, 0, 1, 1189},
{0, 4, 3, 0, 1, 0, 1, 1376}, {3, 1, 1, 1, 1, 1, 1, 1429}, {8, 0, 0, 2, 0, 1, 1, 1665}, {5, 2, 1, 0, 1, 1, 1, 1871}, {0, 4, 2, 1, 0, 0, 2, 2024}, {8, 2, 0, 0, 2, 0, 1, 2177}, {4, 1, 1, 1, 1, 0, 2, 2311}, {5, 2, 2, 2, 0, 0, 1, 2449},
{3, 1, 2, 2, 0, 1, 1, 2549}, {4, 5, 2, 1, 0, 0, 1, 3401}, {3, 1, 0, 3, 2, 0, 1, 4115}, {3, 5, 1, 0, 1, 1, 1, 4861}, {4, 1, 4, 2, 0, 0, 1, 4999}, {5, 2, 2, 0, 0, 1, 2, 5201}, {3, 3, 0, 1, 0, 1, 3, 9827}, {5, 6, 0, 3, 0, 0, 1, 11663},
{5, 2, 3, 1, 1, 1, 1, 24751}, {8, 2, 2, 1, 2, 0, 1, 28799}, {6, 1, 1, 1, 0, 4, 1, 57121}, {4, 3, 0, 4, 0, 1, 2, 62425}, {4, 7, 1, 0, 1, 2, 1, 74359}, {6, 4, 1, 4, 1, 1, 1, 388961}, {4, 2, 1, 5, 0, 3, 1, 672281}}
\(n^2-1=(n-1)(n+1)=2^a*3^b*5^c*7^d*11^F*13^g*17^j, j > 0\)——这里 k = 999999999999999(?) 有 47(?) 个解。问题来了——不管如何加大 k, 还是这 47(?) 个解。为什么呀? |