Keywords
Mulatu’s number; Mulatu’s sequence; γ-Mulatu summable; Mulatu’s series; Mulatu’s characteristics number; generating function.
Mulatu’s number; Mulatu’s sequence; γ-Mulatu summable; Mulatu’s series; Mulatu’s characteristics number; generating function.
Changes are done based up on reviewers comment. On the abstract, contributions of Mulatu's number. On the introduction, works on Fibonacci and Lucas numbers and ideas describing importance of generating function are added . On lemma 1, type error(gcd (41) is replaced by gcd (4,1)). On theorem 1, examples are included. A proof on relationship between Mulatu's numbers and golden ratio is included. Lastly, some references are added.
See the authors' detailed response to the review by Hakan Akkuş
See the authors' detailed response to the review by Hayder R. Hashim
See the authors' detailed response to the review by Priyabrata Mandal
See the authors' detailed response to the review by FUNDA TAŞDEMİR
Mulatu numbers are a recently introduced sequence by Mulatu Lemma, a Professor of Mathematics at Savannah State University in Savannah, Georgia.1,2 These numbers have been introduced in different studies.3,4 Mulatu’s numbers defined as 4, 1, 5, 6, 11, 17, 28, 45, 73, …. Mathematically, such sequence can be written as follow.
Mulatu Lemma’s work has sparked curiosity in many scholars, encouraging them to dive deeper into this field. He’s especially recognized for a special sequence of numbers that bears his name, known for its intriguing patterns. Mulatu’s contributions continue to inspire and engage anyone interested in the beauty of mathematics.5,6
Mulatu’s sequence is a series of numbers where each new term is found by adding the two before it. It’s the latest example of a recursive sequence, meaning each term is built from the previous ones. Taking a closer look at Mulatu’s sequence opens the door to a wealth of intriguing patterns and mathematical properties.5 Over the years, researchers have discovered many interesting trends within it. For instance, the Fibonacci sequence starts with 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, and continues on, while the Lucas sequence begins with 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, and grows from there.7 Both of these sequences showcase the elegance and intricacy of numbers.
A crucial historical and applicative baseline of Fibonacci and Luca numbers is provided by the work “Fibonacci and Lucas Numbers with Applications” (2001). Moreover, delving into contemporary scholarship has revealed a much broader and more active field. Particularly, in the extensive generalizations and interdisciplinary connections have been studied. For instance, Akkuş, Özkan, and their collaborators have extended these concepts to new sequences, applying them to areas like fractal analysis and hyperbolic quaternions. Other research, including work by Falcón and Plaza on Fibonacci k-numbers and the relationships that Adédji, Bachabi, and Togbé have found between Fibonacci, Lucas, and other number sequences (like Thabit numbers), further illustrates the ongoing effort to uncover deeper properties, for more see Refs. 8–14.
Previous works also discussed many of the Fibonacci and Luca numbers,2,7,15,16 but only some characterizations of Mulatu’s numbers.2,5,6 Thus, in this paper, we focused on these less studied numbers, Mulatu’s numbers.
So as to fill this gap, we found novel characterizations of Mulatu numbers. Mulatu, Fibonacci and Lucas numbers are related using divisibility. We studied Mulatu numbers as a sequence, a number and a series as well. A generating function is a powerful mathematical tool that bridges discrete sequences and continuous analysis, transforming complex problems about infinite lists of numbers into tractable algebraic problems concerning formal power series. A generated function is found for the Mulatu sequence. Furthermore, Mulatu numbers and the set of natural numbers are related after phrases Mulatu summable, -Mulatu summable and Mulatu characteristic number are defined.
Regarding characterizations of Mulatu numbers, we have used the GNU Octave (version 4.0.0)17 to conceptualize theorems by taking numerical examples before formal proofs are given.
We have produced new results on Mulatu’s numbers and on the interrelationships between Fibonacci’s and Lucas’s numbers. We are interested in the generic area of gradient-free optimization when derivative information for the function is unavailable or calculation of the derivatives is computationally difficult, and the Golden section search method is one such algorithm that uses the Golden ratio as an input.18 Hence, in addition, we related the Mulatu sequence with the so-called golden ratio, which is most applicable in numerical optimization, specifically to find an approximate optimizer with a small error.
In this study, we applied various mathematical proof techniques, including the principle of mathematical induction, proof by contradiction, and direct proof, to investigate multiple characterizations. To conceptualize and formulate conjectures, and conduct numerical examples prior to presenting formal proofs we utilized GNU Octave (version 4.0.0) software.17 This combination of theoretical and computational approaches enabled a comprehensive exploration of Mulatu numbers.
Any two consecutive Mulatu numbers are relatively prime.
Mathematically, the lemma is for any non-negative integer where gcd denotes greatest common divisor.
We use induction on
For Assume the lemma holds for That is
Claim: for all
From the Euclidean algorithm, we have:
Now, This implies that
for all Therefore, the lemma holds by the principle of mathematical induction.
Adding any ten consecutive Mulatu numbers together will always result in a number that is divisible by 11.
Let for any number . We then show that is divisible by .
Using the definition of Mulatu numbers, we have for in the set of natural numbers, where denotes the Fibonacci number.
This completes the proof.
Examples: The sum of any ten consecutive Mulatu’s numbers (starting from anywhere) is divisible by 11.
Multiplying any Mulatu’s number by two and subtracting the next Mulatu’s number in the sequence for a number greater than or equal to two will result in the answer being Mulatu’s number, that is, ,
Claim: ,
Now,
When adding consecutive, even-positioned Mulatu numbers beginning with , for , the result is a number that is one less than the Mulatu number succeeding the last Mulatu number in the sum. This provides a general formula for a simple way to find the sum of any finite even-positioned Mulatu number.
When adding consecutive, odd-positioned Mulatu’s numbers beginning with , only this time, the result is a number that is four less than the Mulatu number following the last even number in the sum. This provides a general formula for a simple way to find the sum of any finite odd-positioned Mulatu number.
We use induction on .
When any four consecutive numbers in the Mulatu sequence are considered, the difference between the squares of the two numbers in the middle is equal to the product of the two outer numbers. Mathematically,
For ,
By using Theorem 5 above and the relation , the result follows.
Adding any number of consecutive Mulatu numbers will result in a number that is one less than the Mulatu number of two places beyond the last summand. This provides a general formula for a simple way to find the sum of any number of Mulatu numbers.
Let , and be the Mulatu’s, Fibonacci’s, and Lucas’s numbers for each . The number is divisible by 8.
We use induction on .
For and . This implies that
is divisible by 8.
Assume that the statement holds for . As , we have
Thus, . Similarly, and .
Hence, the theorem holds by the principle of mathematical induction.
Half of the sum of any two even consecutive Mulatu numbers yields Mulatu’s number preceding the larger one. i.e.,
The above equation represents the statement of the theorem as it is easy to show that every (3n) th Mulatu number is even for any non-negative integer n.
We use induction on .
For Let it be true for . That is
This assumption with the definition of Mulatu’s sequence leads:
for all
The following definitions are given to study Mulatu numbers in relation with natural numbers, and to define a characteristic number to it.
a) Two natural numbers are said to be Mulatu summable if their sum is a Mulatu number.
b) A natural number is said to be -Mulatu summable if a natural number exists such that is a Mulatu number.
Example: and are Mulatu summable, but and are not Mulatu summable. Moreover, is -Mulatu summable for all , where is the Mulatu number and is -Mulatu summable for
Let be the smallest natural number such that a natural number is -Mulatu summable. Then, is said to be the Mulatu characteristic of , denoted by
The Mulatu characteristics neither preserve nor reverse any inequality.
Let and be natural numbers with . Suppose that the Mulatu characteristic either preserve or reverse an inequality. That is, the Mulatu characteristics preserve or reverse an inequality. Thus, it must preserve or reverse the inequality . Thus, or for each .
Neither is true because, for instance, but (2) 2 = (3). For the remaining inequalities, we can see counter examples but ; and , with . Thus, the negation of the given statement is not true, and this completes the proof.
Let and for be consecutive natural numbers such that 2 is -Mulatu summable and is -Mulatu summable, respectively, and let and be Mulatu summable.
We use induction on .
For and . Assuming it holds for and Theorem 8, we get
Example: What is the successor to and in Theorem 10?
The answer is and respectively.
The golden ratio is defined by taking a line segment and dividing it into two parts: the longer part (L) and the shorter part (S). The ratio of L to S is the same as the ratio of the entire line segment to L. Letting this ratio , leads , whose solution is the golden ratio, .
The golden ratio pops up in so many places, from mathematics to art and nature. It’s like a secret thread that ties together beauty and balance. People often find it aesthetically pleasing, whether it’s in a stunning painting, an elegant building, or the way a sunflower blooms.7,16
Furthermore, what’s particularly cool is that when we simplify the reciprocal of , it turns out to be just one less than itself. This means . It’s quite special that and its reciprocal are two numbers for which both their difference and their product equal one.
Surprisingly, Mulatu numbers have a remarkable connection to the golden ratio. When we divide one Mulatu number by the one before it, the result gets closer and closer to as the numbers increase.
This implies that .
To give a formal proof of this limit, we can consider the sequence:
. Assume that that Then we are going to show that As goes to infinity, the sequence should converge to . This leads to the equation:
This implies that:
. That is This completes the proof.
Conversely, if Mulatu’s number is divided by the succeeding Mulatu number, the result is close to the reciprocal of . Again, the larger the two numbers used, the closer the result to the reciprocal of .
In this section, we give a generating function for the sequence .
The series is called Mulatu’s series.
Mulatu’s series is divergent.
Using the ratio test, Thus, it diverges.
is a generating function for the Mulatu’s sequence
In this work, we found many novel characterizations of Mulatu numbers. We produced relationships among Mulatu’s, Fibonacci’s, and Lucas’s numbers and with the set of natural numbers as well. Namely, we categorized two natural numbers or a natural number as the Mulatu summable or -Mulatu summable, respectively. Moreover, we have also shown that, similar to Fibonacci’s numbers, Mulatu’s numbers are related to the so-called golden ratio, which is most applicable in numerical optimization. Finally, we provide a generating function for the Mulatu numbers. These findings play a crucial role in both theoretical and applied mathematics.
We hereby declare that the information provided above is accurate, and that this research was conducted in compliance with all applicable ethical guidelines and institutional policies. Since this study did not involve any human or animal participants, there was no need for ethical approval or consent.
| Views | Downloads | |
|---|---|---|
| F1000Research | - | - |
|
PubMed Central
Data from PMC are received and updated monthly.
|
- | - |
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Number theory
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Number theory, special sequences
Is the work clearly and accurately presented and does it cite the current literature?
Partly
Is the study design appropriate and is the work technically sound?
Yes
Are sufficient details of methods and analysis provided to allow replication by others?
Yes
If applicable, is the statistical analysis and its interpretation appropriate?
Not applicable
Are all the source data underlying the results available to ensure full reproducibility?
Partly
Are the conclusions drawn adequately supported by the results?
Yes
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Number theory, special sequences
Is the work clearly and accurately presented and does it cite the current literature?
Yes
Is the study design appropriate and is the work technically sound?
Yes
Are sufficient details of methods and analysis provided to allow replication by others?
Yes
If applicable, is the statistical analysis and its interpretation appropriate?
I cannot comment. A qualified statistician is required.
Are all the source data underlying the results available to ensure full reproducibility?
Partly
Are the conclusions drawn adequately supported by the results?
Yes
References
1. Akkuş H, Kuloğlu B, Özkan E: Analytical Characterization of Self-Similarity in k-Cullen Sequences Through Generating Functions and Fibonacci Scaling. Fractal and Fractional. 2025; 9 (6). Publisher Full TextCompeting Interests: No competing interests were disclosed.
Reviewer Expertise: Number theory, Algebra, Applied mathematic
Is the work clearly and accurately presented and does it cite the current literature?
Yes
Is the study design appropriate and is the work technically sound?
Yes
Are sufficient details of methods and analysis provided to allow replication by others?
Yes
If applicable, is the statistical analysis and its interpretation appropriate?
Not applicable
Are all the source data underlying the results available to ensure full reproducibility?
No source data required
Are the conclusions drawn adequately supported by the results?
Yes
Competing Interests: No competing interests were disclosed.
Is the work clearly and accurately presented and does it cite the current literature?
No
Is the study design appropriate and is the work technically sound?
No
Are sufficient details of methods and analysis provided to allow replication by others?
Partly
If applicable, is the statistical analysis and its interpretation appropriate?
Partly
Are all the source data underlying the results available to ensure full reproducibility?
Partly
Are the conclusions drawn adequately supported by the results?
No
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Number theory, Diophantine equations, Special sequences, etc.
Is the work clearly and accurately presented and does it cite the current literature?
Partly
Is the study design appropriate and is the work technically sound?
Yes
Are sufficient details of methods and analysis provided to allow replication by others?
Yes
If applicable, is the statistical analysis and its interpretation appropriate?
Not applicable
Are all the source data underlying the results available to ensure full reproducibility?
No source data required
Are the conclusions drawn adequately supported by the results?
Yes
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Number theory
Is the work clearly and accurately presented and does it cite the current literature?
No
Is the study design appropriate and is the work technically sound?
Yes
Are sufficient details of methods and analysis provided to allow replication by others?
No
If applicable, is the statistical analysis and its interpretation appropriate?
Not applicable
Are all the source data underlying the results available to ensure full reproducibility?
Yes
Are the conclusions drawn adequately supported by the results?
Yes
Competing Interests: No competing interests were disclosed.
Reviewer Expertise: Number Theory
Alongside their report, reviewers assign a status to the article:
| Invited Reviewers | ||||||
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
|
Version 3 (revision) 24 Feb 26 |
read | read | ||||
|
Version 2 (revision) 17 Apr 25 |
read | read | read | read | read | |
|
Version 1 31 Oct 24 |
read | |||||
Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list:
Sign up for content alerts and receive a weekly or monthly email with all newly published articles
Already registered? Sign in
The email address should be the one you originally registered with F1000.
You registered with F1000 via Google, so we cannot reset your password.
To sign in, please click here.
If you still need help with your Google account password, please click here.
You registered with F1000 via Facebook, so we cannot reset your password.
To sign in, please click here.
If you still need help with your Facebook account password, please click here.
If your email address is registered with us, we will email you instructions to reset your password.
If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance.
Comments on this article Comments (0)