proposed
approved
proposed
approved
editing
proposed
\\ The following program would get stuck in nontrivial loops. However, we assume that the conjecture 3 in Ufnarovski & Ã…hlander paper holds ("The differential equation n ^(k) = n has only trivial solutions p^p for primes p").
Cf. A003415 (arithmetic derivative of n), A099307 (least k such that the k-th arithmetic derivative of n is zero), A099309 (complement, numbers whose k-th arithmetic derivative is nonzero for all k), A351078 (first noncomposite reached when iterating the derivative from these numbers), A351079 (the largest term on such paths).
Cf. also A256750, (number of iterations needed to reach either 0 or a number with a factor of the form p^p), A327969, A351088.
See A003415.
\\ The following program would get stuck in nontrivial loops. However, we assume that the conjecture 3 in Ufnarovski & Ã…hlander paper holds ("The differential equation n (k) = n has only trivial solutions p ^p for primes p").
proposed
approved
editing
proposed
editing
proposed