|
|
|
|
|
|
|
|
|
#19 by Alois P. Heinz at Fri Jul 07 16:48:40 EDT 2023
|
|
|
|
|
|
|
|
#18 by Dario Alpern at Fri Jul 07 16:47:46 EDT 2023
|
|
|
|
|
|
|
|
#17 by Dario Alpern at Fri Jul 07 16:47:36 EDT 2023
|
|
| LINKS
|
D. Dario Alpern, <a href="httphttps://www.alpertron.com.ar/ecmECM.htmHTM">Factorization using the Elliptic Curve Method</a>
|
|
| STATUS
|
approved
editing
|
|
|
|
|
Discussion
|
| Fri Jul 07
| 16:47
| Dario Alpern: Fixed link
|
|
|
|
|
|
|
#16 by Alois P. Heinz at Tue Jul 14 06:24:50 EDT 2020
|
|
|
|
|
|
|
|
#15 by Vaclav Kotesovec at Tue Jul 14 04:46:57 EDT 2020
|
|
|
|
|
|
|
|
#14 by Joerg Arndt at Wed Jul 08 01:34:08 EDT 2020
|
|
|
|
|
|
|
|
#13 by Joerg Arndt at Wed Jul 08 01:34:01 EDT 2020
|
|
| MATHEMATICA
|
b = {}; a = {}; Do[w = RealDigits[n]; w = First[w]; Do[AppendTo[a, w[[k]]], {k, 1, Length[w]}]; p = FromDigits[a]; m = FactorInteger[p]; AppendTo[b, Length[m]], {n, 1, 20}]; b (* Artur Jasinski, Mar 30 2008 *)
|
|
| PROG
|
(PARI) {a=""; for(n=1, 43, a=concat(a, n); print1(omega(eval(a)), ", "))})), ", "))}
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#12 by Wesley Ivan Hurt at Tue Jul 07 23:55:12 EDT 2020
|
|
|
|
|
|
|
|
#11 by Wesley Ivan Hurt at Tue Jul 07 23:55:00 EDT 2020
|
|
| NAME
|
Number of distinct prime divisors of the concatenation of 1,...,..n.
|
|
| EXAMPLE
|
123456 = 2*2*2*2*2*2*3*643, with distinct prime divisors are 2, 3 and 643. Hence, hence a(6) = 3.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#10 by Jan Mangaldan at Tue Jul 07 22:59:40 EDT 2020
|
|
|
|
|
|
|
