Sequences of consecutive factoradic happy numbers

From MaRDI portal



Abstract: Given a positive integer n, the factorial base representation of n is given by n=sumi=1kaicdoti!, where akeq0 and 0leqaileqi for all 1leqileqk. For egeq1, we define Se,!:mathbbZgeq0omathbbZgeq0 by Se,!(0)=0 and Se,!(n)=sumi=0naie, for neq0. For ellgeq0, we let Se,!ell(n) denote the ell-th iteration of Se,!, while Se,!0(n)=n. If pinmathbbZ+ satisfies Se,!(p)=p, then we say that p is an e-power factoradic fixed point of Se,!. Moreover, given xinmathbbZ+, if p is an e-power factoradic fixed point and if there exists ellinmathbbZgeq0 such that Se,!ell(x)=p, then we say that x is an e-power factoradic p-happy number. Note an integer n is said to be an e-power factoradic happy number if it is an e-power factoradic 1-happy number. In this paper, we prove that all positive integers are 1-power factoradic happy and, for 2leqeleq4, we prove the existence of arbitrarily long sequences of e-power factoradic p-happy numbers. A curious result establishes that for any egeq2 the e-power factoradic fixed points of Se,! that are greater than 1, always appear in sets of consecutive pairs. Our last contribution, provides the smallest sequences of m consecutive e-power factoradic happy numbers for 2leqeleq5, for some values of m.





Describes a project that uses

Uses Software






This page was built for publication: Sequences of consecutive factoradic happy numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204743)