Digital roots of numbers have several interesting properties, most of which are well-known. In this paper, our goal is to prove some lesser known results concerning the digital roots of powers of numbers in an arithme...Digital roots of numbers have several interesting properties, most of which are well-known. In this paper, our goal is to prove some lesser known results concerning the digital roots of powers of numbers in an arithmetic progression. We will also state some theorems concerning the digital roots of Fermat numbers and star numbers. We will conclude our paper by an interesting application.展开更多
In this paper we will extend the well-known chain of inequalities involving the Pythagorean means, namely the harmonic, geometric, and arithmetic means to the more refined chain of inequalities by including the logari...In this paper we will extend the well-known chain of inequalities involving the Pythagorean means, namely the harmonic, geometric, and arithmetic means to the more refined chain of inequalities by including the logarithmic and identric means using nothing more than basic calculus. Of course, these results are all well-known and several proofs of them and their generalizations have been given. See [1-6] for more information. Our goal here is to present a unified approach and give the proofs as corollaries of one basic theorem.展开更多
The Pascal matrix and the Fibonacci matrix are among the most well-known and the most widely-used tools in elementary algebra. In this paper, after a brief introduction where we give the basic definitions and the hist...The Pascal matrix and the Fibonacci matrix are among the most well-known and the most widely-used tools in elementary algebra. In this paper, after a brief introduction where we give the basic definitions and the historical backgrounds of these concepts, we propose an algorithm that will generate the elements of these matrices. In fact, we will show that the indicated algorithm can be used to construct the elements of any power series matrix generated by any polynomial (see Definition 1), and hence, it is a generalization of the specific algorithms that give us the Pascal and the Fibonacci matrices.展开更多
文摘Digital roots of numbers have several interesting properties, most of which are well-known. In this paper, our goal is to prove some lesser known results concerning the digital roots of powers of numbers in an arithmetic progression. We will also state some theorems concerning the digital roots of Fermat numbers and star numbers. We will conclude our paper by an interesting application.
文摘In this paper we will extend the well-known chain of inequalities involving the Pythagorean means, namely the harmonic, geometric, and arithmetic means to the more refined chain of inequalities by including the logarithmic and identric means using nothing more than basic calculus. Of course, these results are all well-known and several proofs of them and their generalizations have been given. See [1-6] for more information. Our goal here is to present a unified approach and give the proofs as corollaries of one basic theorem.
文摘The Pascal matrix and the Fibonacci matrix are among the most well-known and the most widely-used tools in elementary algebra. In this paper, after a brief introduction where we give the basic definitions and the historical backgrounds of these concepts, we propose an algorithm that will generate the elements of these matrices. In fact, we will show that the indicated algorithm can be used to construct the elements of any power series matrix generated by any polynomial (see Definition 1), and hence, it is a generalization of the specific algorithms that give us the Pascal and the Fibonacci matrices.
