首页 > 最新文献

Notes on Number Theory and Discrete Mathematics最新文献

英文 中文
Recurrence relations connecting mock theta functions and restricted partition functions 模拟函数与限制配分函数的递归关系
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-05-16 DOI: 10.7546/nntdm.2023.29.2.360-371
M. Rana, H. Kaur, K. Garg
In this paper, we provide some recurrence relations connecting restricted partition functions and mock theta functions. Elementary manipulations are used including Jacobi triple product identity, Euler’s pentagonal number theorem, and Ramanujan’s theta functions for finding the recurrence relations.
在本文中,我们提供了一些连接限制配分函数和mock theta函数的递推关系。使用基本运算,包括雅可比三乘积恒等式、欧拉五边形数定理和Ramanujanθ函数来寻找递推关系。
{"title":"Recurrence relations connecting mock theta functions and restricted partition functions","authors":"M. Rana, H. Kaur, K. Garg","doi":"10.7546/nntdm.2023.29.2.360-371","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.360-371","url":null,"abstract":"In this paper, we provide some recurrence relations connecting restricted partition functions and mock theta functions. Elementary manipulations are used including Jacobi triple product identity, Euler’s pentagonal number theorem, and Ramanujan’s theta functions for finding the recurrence relations.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42051893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the multiplicative group generated by Big{{[sqrt {2}n]over n}~mid~ninmathbb{N} Big}. V 在由Big {{[sqrt 2n{] }over n }mid n inmathbb{N}Big}生成的乘法组上。v
Q4 MATHEMATICS Pub Date : 2023-05-12 DOI: 10.7546/nntdm.2023.29.2.348-353
I. Kátai, B. M. Phong
Let $f,g$ be completely multiplicative functions, $vert f(n)vert=vert g(n)vert =1 (ninmathbb{N})$. Assume that $${1over {log x}}sum_{nle x}{vert g([sqrt{2}n])-Cf(n)vertover n}to 0 quad (xtoinfty).$$ Then $$f(n)=g(n)=n^{itau},quad C=(sqrt{2})^{itau}, tauin mathbb{R}.$$
设$f,g$是完全乘法函数$vert f(n)vert=vert g(n)vert =1 (ninmathbb{N})$。假设$${1over {log x}}sum_{nle x}{vert g([sqrt{2}n])-Cf(n)vertover n}to 0 quad (xtoinfty).$$那么 $$f(n)=g(n)=n^{itau},quad C=(sqrt{2})^{itau}, tauin mathbb{R}.$$
{"title":"On the multiplicative group generated by Big{{[sqrt {2}n]over n}~mid~ninmathbb{N} Big}. V","authors":"I. Kátai, B. M. Phong","doi":"10.7546/nntdm.2023.29.2.348-353","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.348-353","url":null,"abstract":"Let $f,g$ be completely multiplicative functions, $vert f(n)vert=vert g(n)vert =1 (ninmathbb{N})$. Assume that $${1over {log x}}sum_{nle x}{vert g([sqrt{2}n])-Cf(n)vertover n}to 0 quad (xtoinfty).$$ Then $$f(n)=g(n)=n^{itau},quad C=(sqrt{2})^{itau}, tauin mathbb{R}.$$","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135337321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
p-Analogue of biperiodic Pell and Pell–Lucas polynomials 双周期Pell和Pell - lucas多项式的p-类似
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-05-11 DOI: 10.7546/nntdm.2023.29.2.336-347
B. Kuloğlu, E. Özkan, A. Shannon
In this study, a binomial sum, unlike but analogous to the usual binomial sums, is expressed with a different definition and termed the p-integer sum. Based on this definition, p-analogue Pell and Pell–Lucas polynomials are established and the generating functions of these new polynomials are obtained. Some theorems and propositions depending on the generating functions are also expressed. Then, by association with these, the polynomials of so-called ‘incomplete’ number sequences have been obtained, and elegant summation relations provided. The paper has also been placed in the appropriate historical context for ease of further development.
在这项研究中,二项式和不同于但类似于通常的二项式总和,用不同的定义表示,称为p-整数和。在此定义的基础上,建立了p-相似Pell多项式和Pell–Lucas多项式,并得到了这些新多项式的生成函数。还表达了一些依赖于生成函数的定理和命题。然后,通过与它们的关联,得到了所谓“不完全”数列的多项式,并提供了优雅的求和关系。为了便于进一步发展,该文件也被置于适当的历史背景下。
{"title":"p-Analogue of biperiodic Pell and Pell–Lucas polynomials","authors":"B. Kuloğlu, E. Özkan, A. Shannon","doi":"10.7546/nntdm.2023.29.2.336-347","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.336-347","url":null,"abstract":"In this study, a binomial sum, unlike but analogous to the usual binomial sums, is expressed with a different definition and termed the p-integer sum. Based on this definition, p-analogue Pell and Pell–Lucas polynomials are established and the generating functions of these new polynomials are obtained. Some theorems and propositions depending on the generating functions are also expressed. Then, by association with these, the polynomials of so-called ‘incomplete’ number sequences have been obtained, and elegant summation relations provided. The paper has also been placed in the appropriate historical context for ease of further development.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48582017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the k-Fibonacci and k-Lucas spinors 在k-Fibonacci和k-Lucas旋量上
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-05-09 DOI: 10.7546/nntdm.2023.29.2.322-335
Munesh Kumari, K. Prasad, R. Frontczak
In this paper, we introduce a new family of sequences called the k-Fibonacci and k-Lucas spinors. Starting with the Binet formulas we present their basic properties, such as Cassini’s identity, Catalan’s identity, d’Ocagne’s identity, Vajda’s identity, and Honsberger’s identity. In addition, we discuss their generating functions. Finally, we obtain sum formulae and relations between k-Fibonacci and k-Lucas spinors.
在本文中,我们引入了一个新的序列族,称为k-Fibonacci和k-Lucas旋量。从比奈公式开始,我们给出了它们的基本性质,如卡西尼恒等式、加泰罗尼亚语恒等式、奥卡涅恒等式、瓦伊达恒等式和洪斯伯格恒等式。此外,我们还讨论了它们的生成函数。最后,我们得到了k-Fibonacci和k-Lucas旋量的和公式及它们之间的关系。
{"title":"On the k-Fibonacci and k-Lucas spinors","authors":"Munesh Kumari, K. Prasad, R. Frontczak","doi":"10.7546/nntdm.2023.29.2.322-335","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.322-335","url":null,"abstract":"In this paper, we introduce a new family of sequences called the k-Fibonacci and k-Lucas spinors. Starting with the Binet formulas we present their basic properties, such as Cassini’s identity, Catalan’s identity, d’Ocagne’s identity, Vajda’s identity, and Honsberger’s identity. In addition, we discuss their generating functions. Finally, we obtain sum formulae and relations between k-Fibonacci and k-Lucas spinors.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45342390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Unrestricted Tribonacci and Tribonacci–Lucas quaternions 无限制Tribonacci和Tribonacci-Lucas四元数
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-05-09 DOI: 10.7546/nntdm.2023.29.2.310-321
Gonca Kızılaslan, Leyla Karabulut
We define a generalization of Tribonacci and Tribonacci–Lucas quaternions with arbitrary Tribonacci numbers and Tribonacci–Lucas numbers coefficients, respectively. We get generating functions and Binet’s formulas for these quaternions. Furthermore, several sum formulas and a matrix representation are obtained.
我们定义了分别具有任意Tribonacci数和Tribonacci-Lucas数系数的Tribonacc和Tribonaci–Lucas四元数的推广。我们得到了这些四元数的生成函数和Binet公式。此外,还得到了几个求和公式和一个矩阵表示。
{"title":"Unrestricted Tribonacci and Tribonacci–Lucas quaternions","authors":"Gonca Kızılaslan, Leyla Karabulut","doi":"10.7546/nntdm.2023.29.2.310-321","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.310-321","url":null,"abstract":"We define a generalization of Tribonacci and Tribonacci–Lucas quaternions with arbitrary Tribonacci numbers and Tribonacci–Lucas numbers coefficients, respectively. We get generating functions and Binet’s formulas for these quaternions. Furthermore, several sum formulas and a matrix representation are obtained.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45234967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A class of solutions of the equation d(n2) = d(φ(n)) 方程d(n2) = d(φ(n))的一类解
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-05-02 DOI: 10.7546/nntdm.2023.29.2.284-309
Zahra Amroune, D. Bellaouar, Abdelmadjid Boudaoud
For any positive integer $n$ let $dleft( nright) $ and $varphi left( nright) $ be the number of divisors of $n$ and the Euler's phi function of $n$, respectively. In this paper we present some notes on the equation $dleft( n^{2}right) =dleft( varphi left( nright) right).$ In fact, we characterize a class of solutions that have at most three distinct prime factors. Moreover, we show that Dickson's conjecture implies that $dleft( n^{2}right) =dleft( varphi left( nright) right) $ infinitely often.
对于任意正整数$n$,设$dleft( nright) $和$varphi left( nright) $分别为$n$和$n$的欧拉函数的除数。在本文中,我们给出了关于方程$dleft( n^{2}right) =dleft( varphi left( nright) right).$的一些注意事项。事实上,我们刻画了一类至多有三个不同素数因子的解。此外,我们还证明了Dickson猜想暗示$dleft( n^{2}right) =dleft( varphi left( nright) right) $无限频繁。
{"title":"A class of solutions of the equation d(n2) = d(φ(n))","authors":"Zahra Amroune, D. Bellaouar, Abdelmadjid Boudaoud","doi":"10.7546/nntdm.2023.29.2.284-309","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.284-309","url":null,"abstract":"For any positive integer $n$ let $dleft( nright) $ and $varphi left( nright) $ be the number of divisors of $n$ and the Euler's phi function of $n$, respectively. In this paper we present some notes on the equation $dleft( n^{2}right) =dleft( varphi left( nright) right).$ In fact, we characterize a class of solutions that have at most three distinct prime factors. Moreover, we show that Dickson's conjecture implies that $dleft( n^{2}right) =dleft( varphi left( nright) right) $ infinitely often.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41760036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
New properties of divisors of natural number 自然数除数的新性质
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-05-02 DOI: 10.7546/nntdm.2023.29.2.276-283
Hamilton Brito da Silva
The divisors of a natural number are very important for several areas of mathematics, representing a promising field in number theory. This work sought to analyze new relations involving the divisors of natural numbers, extending them to prime numbers. These are relations that may have an interesting application for counting the number of divisors of any natural number and understanding the behavior of prime numbers. They are not a primality test, but they can be a possible tool for this and could also be useful for understanding the Riemann’s zeta function that is strongly linked to the distribution of prime numbers.
自然数的除数在数学的几个领域都很重要,代表了数论的一个有前途的领域。这项工作试图分析涉及自然数的除数的新关系,并将它们扩展到素数。这些关系对于计算任何自然数的除数和理解素数的行为可能有一个有趣的应用。它们不是质数测试,但它们可以是一个可能的工具,也可以用于理解黎曼的ζ函数,它与质数的分布密切相关。
{"title":"New properties of divisors of natural number","authors":"Hamilton Brito da Silva","doi":"10.7546/nntdm.2023.29.2.276-283","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.276-283","url":null,"abstract":"The divisors of a natural number are very important for several areas of mathematics, representing a promising field in number theory. This work sought to analyze new relations involving the divisors of natural numbers, extending them to prime numbers. These are relations that may have an interesting application for counting the number of divisors of any natural number and understanding the behavior of prime numbers. They are not a primality test, but they can be a possible tool for this and could also be useful for understanding the Riemann’s zeta function that is strongly linked to the distribution of prime numbers.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48086009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Representations of positive integers as sums of arithmetic progressions, II 正整数作为等差数列和的表示,2
Q4 MATHEMATICS Pub Date : 2023-04-27 DOI: 10.7546/nntdm.2023.29.2.260-275
Chungwu Ho, Tian-Xiao He, Peter J.-S. Shiue
As mentioned in the first part of this paper, our paper was motivated by two classical papers on the representations of integers as sums of arithmetic progressions. One of them is a paper by Sir Charles Wheatstone and the other is a paper by James Joseph Sylvester. Part I of the paper, though contained some extensions of Wheatstone’s work, was primarily devoted to extensions of Sylvester’s Theorem. In this part of the paper, we will pay more attention on the problems initiated by of Wheatstone on the representations of powers of integers as sums of arithmetic progressions and the relationships among the representations for different powers of the integer. However, a large part in this portion of the paper will be devoted to the extension of a clever method recently introduced by S. B. Junaidu, A. Laradji, and A. Umar and the problems related to the extension. This is because that this extension, not only will be our main tool for study ing the relationships of the representations of different powers of an integer, but also seems to be interesting in its own right. In the process of doing this, we need to use a few results from the first part of the paper. On the other hand, some of our results in this part will also provide certain new information on the problems studied in the first part. However, for readers who are interested primarily in the results of this part, we have repeated some basic facts from Part I of the paper so that the reader can read this part independently from the first part.
正如本文第一部分所提到的,我们的论文是由两篇关于整数表示为等差数列和的经典论文所激发的。其中一篇是查尔斯·惠斯通爵士的论文另一篇是詹姆斯·约瑟夫·西尔维斯特的论文。论文的第一部分,虽然包含了惠斯通工作的一些扩展,但主要是对西尔维斯特定理的扩展。在这一部分中,我们将更多地关注惠斯通提出的关于整数幂表示为等差数列和的问题,以及整数不同幂表示之间的关系。然而,本文这一部分的很大一部分将致力于扩展最近由S. B. Junaidu、a . Laradji和a . Umar引入的一种聪明方法,以及与此扩展相关的问题。这是因为这个扩展,不仅是我们研究整数的不同幂表示的关系的主要工具,而且它本身似乎也很有趣。在这个过程中,我们需要用到论文第一部分的一些结果。另一方面,我们在这一部分的一些结果也将为第一部分研究的问题提供一些新的信息。然而,对于主要对这一部分的结果感兴趣的读者,我们重复了论文第一部分的一些基本事实,以便读者可以独立于第一部分来阅读这一部分。
{"title":"Representations of positive integers as sums of arithmetic progressions, II","authors":"Chungwu Ho, Tian-Xiao He, Peter J.-S. Shiue","doi":"10.7546/nntdm.2023.29.2.260-275","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.260-275","url":null,"abstract":"As mentioned in the first part of this paper, our paper was motivated by two classical papers on the representations of integers as sums of arithmetic progressions. One of them is a paper by Sir Charles Wheatstone and the other is a paper by James Joseph Sylvester. Part I of the paper, though contained some extensions of Wheatstone’s work, was primarily devoted to extensions of Sylvester’s Theorem. In this part of the paper, we will pay more attention on the problems initiated by of Wheatstone on the representations of powers of integers as sums of arithmetic progressions and the relationships among the representations for different powers of the integer. However, a large part in this portion of the paper will be devoted to the extension of a clever method recently introduced by S. B. Junaidu, A. Laradji, and A. Umar and the problems related to the extension. This is because that this extension, not only will be our main tool for study ing the relationships of the representations of different powers of an integer, but also seems to be interesting in its own right. In the process of doing this, we need to use a few results from the first part of the paper. On the other hand, some of our results in this part will also provide certain new information on the problems studied in the first part. However, for readers who are interested primarily in the results of this part, we have repeated some basic facts from Part I of the paper so that the reader can read this part independently from the first part.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":"328 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136121799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Representations of positive integers as sums of arithmetic progressions, I 正整数作为算术级数和的表示,I
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-04-27 DOI: 10.7546/nntdm.2023.29.2.241-259
Chungwu Ho, Tian-Xiao He, P. Shiue
This is the first part of a two-part paper. Our paper was motivated by two classical papers: A paper of Sir Charles Wheatstone published in 1844 on representing certain powers of an integer as sums of arithmetic progressions and a paper of J. J. Sylvester published in 1882 for determining the number of ways a positive integer can be represented as the sum of a sequence of consecutive integers. There have been many attempts to extend Sylvester Theorem to the number of representations for an integer as the sums of different types of sequences, including sums of certain arithmetic progressions. In this part of the paper, we will make yet one more extension: We will describe a procedure for computing the number of ways a positive integer can be represented as the sums of all possible arithmetic progressions, together with an example to illustrate how this procedure can be carried out. In the process of doing this, we will also give an extension of Wheatstone’s work. In the second part of the paper, we will continue on the problems initiated by Wheatstone by studying certain relationships among the representations for different powers of an integer as sums of arithmetic progressions.
这是由两部分组成的论文的第一部分。我们的论文受到两篇经典论文的启发:查尔斯·惠斯通爵士于1844年发表的一篇关于将整数的某些幂表示为算术级数和的论文,以及J·J·西尔维斯特于1882年发表的关于确定正整数表示为连续整数序列和的方法的论文。已经有许多尝试将西尔维斯特定理扩展到整数的表示数,作为不同类型序列的和,包括某些算术级数的和。在本文的这一部分,我们将进行另一个扩展:我们将描述一个计算正整数可以表示为所有可能的算术级数之和的方法的过程,以及一个示例来说明如何执行该过程。在这个过程中,我们还将对惠斯通的工作进行扩展。在本文的第二部分中,我们将继续研究惠斯通提出的问题,通过研究整数的不同幂作为算术级数和的表示之间的某些关系。
{"title":"Representations of positive integers as sums of arithmetic progressions, I","authors":"Chungwu Ho, Tian-Xiao He, P. Shiue","doi":"10.7546/nntdm.2023.29.2.241-259","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.241-259","url":null,"abstract":"This is the first part of a two-part paper. Our paper was motivated by two classical papers: A paper of Sir Charles Wheatstone published in 1844 on representing certain powers of an integer as sums of arithmetic progressions and a paper of J. J. Sylvester published in 1882 for determining the number of ways a positive integer can be represented as the sum of a sequence of consecutive integers. There have been many attempts to extend Sylvester Theorem to the number of representations for an integer as the sums of different types of sequences, including sums of certain arithmetic progressions. In this part of the paper, we will make yet one more extension: We will describe a procedure for computing the number of ways a positive integer can be represented as the sums of all possible arithmetic progressions, together with an example to illustrate how this procedure can be carried out. In the process of doing this, we will also give an extension of Wheatstone’s work. In the second part of the paper, we will continue on the problems initiated by Wheatstone by studying certain relationships among the representations for different powers of an integer as sums of arithmetic progressions.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49506814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The quaternion-type cyclic-Fibonacci sequences in groups 群中的四元数型循环Fibonacci序列
IF 0.3 Q4 MATHEMATICS Pub Date : 2023-04-27 DOI: 10.7546/nntdm.2023.29.2.226-240
N. Yilmaz, E. K. Çetinalp, Ö. Deveci
In this paper, we define the six different quaternion-type cyclic-Fibonacci sequences and present some properties, such as, the Cassini formula and generating function. Then, we study quaternion-type cyclic-Fibonacci sequences modulo m. Also we present the relationships between the lengths of periods of the quaternion-type cyclic-Fibonacci sequences of the first, second, third, fourth, fifth and sixth kinds modulo m and the generating matrices of these sequences. Finally, we introduce the quaternion-type cyclic-Fibonacci sequences in finite groups. We calculate the lengths of periods for these sequences of the generalized quaternion groups and obtain quaternion-type cyclic-Fibonacci orbits of the quaternion groups Q8 and Q16 as applications of the results.
本文定义了六种不同的四元数类型的循环Fibonacci序列,并给出了一些性质,如Cassini公式和生成函数。然后,我们研究了模m的四元数型循环Fibonacci序列,并给出了模m为第一类、第二类、第三类、第四类、第五类和第六类的四元数字型循环Fibonacci序列的周期长度与这些序列的生成矩阵之间的关系。最后,我们引入有限群中的四元数型循环Fibonacci序列。我们计算了这些广义四元数群序列的周期长度,并得到了四元数组Q8和Q16的四元数型循环Fibonacci轨道作为结果的应用。
{"title":"The quaternion-type cyclic-Fibonacci sequences in groups","authors":"N. Yilmaz, E. K. Çetinalp, Ö. Deveci","doi":"10.7546/nntdm.2023.29.2.226-240","DOIUrl":"https://doi.org/10.7546/nntdm.2023.29.2.226-240","url":null,"abstract":"In this paper, we define the six different quaternion-type cyclic-Fibonacci sequences and present some properties, such as, the Cassini formula and generating function. Then, we study quaternion-type cyclic-Fibonacci sequences modulo m. Also we present the relationships between the lengths of periods of the quaternion-type cyclic-Fibonacci sequences of the first, second, third, fourth, fifth and sixth kinds modulo m and the generating matrices of these sequences. Finally, we introduce the quaternion-type cyclic-Fibonacci sequences in finite groups. We calculate the lengths of periods for these sequences of the generalized quaternion groups and obtain quaternion-type cyclic-Fibonacci orbits of the quaternion groups Q8 and Q16 as applications of the results.","PeriodicalId":44060,"journal":{"name":"Notes on Number Theory and Discrete Mathematics","volume":" ","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48744224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Notes on Number Theory and Discrete Mathematics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1