scientific article; zbMATH DE number 1054230
The Smarandache function \(S(n)\) is defined as \(S(n)=\) the smallest positive integer such that \(S(n)!\) is divisible by \(n\); and the Fibonacci recurrence formula is given by \(F_n= F_{n-1}+ F_{n-2}\) \((n\geq 2)\) which for \(F_0= F_1=1\) defines the Fibonacci series. This article is concerned with isolated occurrences of triplets \(n\), \(n-1\), \(n-2\) for which \(S(n)= S(n-1)+ S(n-2)\). Are there infinitely many such triplets? Is there a method of finding such triplets that would indicate that there are in fact infinitely many of them? Conjecture. There are infinitely many triplets \(n\), \(n-1\), \(n-2\) such that \(S(n)= S(n-1)+ S(n-2)\). M. Mudge, in a letter to R. Muller (05/14/96), states that: ``John Humphries has found a set of three numbers, greater than 415662, whose Smarandache function satisfies the Fibonacci recurrence, i.e. \(S(2091204)=67\), \(S(2091205)=202\), \(S(2091206)=269\), and \(67+202=269\).
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351897)
