期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
关于Diophantine m-tuples的个数(英文)
1
作者 劳会学 《数学进展》 CSCD 北大核心 2010年第3期277-282,共6页
对于一个由m个正整数构成的数组,若其中任意两个正整数的乘积都等于一个完全平方数减去1,则称这个数组为Diophantine m-tuples.最近,Dujella获得了关于Diophantine2-tuples及3-tuples个数的渐进公式.本文改进了的相关结果.
关键词 DIOPHANTINE m-tuples 渐进公式 除数函数
原文传递
A Property of m-Tuplings Morse Sequence
2
作者 NIU Min WEN Zhixiong 《Wuhan University Journal of Natural Sciences》 CAS 2006年第3期473-476,共4页
The m-tuplings Morse sequence, as a fixed point of a constant length substitution, was discussed. An equivalent definition was given by the property of the m-adie development of the integers. Using the combinatorial p... The m-tuplings Morse sequence, as a fixed point of a constant length substitution, was discussed. An equivalent definition was given by the property of the m-adie development of the integers. Using the combinatorial properties of the m-tuplings Morse sequence, we mainly obtain this sequenee is an admissible sequence and the other two sequenees generated by it are also admissible sequences, which extends the conclusion that the Thue-Morse sequence is an admissible sequences. 展开更多
关键词 m-tuplings Morse sequence admissible sequence Thue-Morse sequence
下载PDF
m-可乘序列谱测度的关联维数 被引量:3
3
作者 牛敏 文志雄 《数学物理学报(A辑)》 CSCD 北大核心 2007年第5期862-870,共9页
作者利用关联函数的递减速度与Fourier谱特征之间的关系,计算出无穷m-可乘序列谱测度的关联维数.且通过对m-可乘序列关联函数的研究,验证了其谱测度是奇异连续的结论.
关键词 m-可乘序列 m-tuplings Morse序列 关联维数 谱测度
下载PDF
Complete Solution of Diophantine Pairs Induced by Some Fibonacci Formula
4
作者 Jinseo Park 《Algebra Colloquium》 SCIE CSCD 2023年第1期121-132,共12页
A set[ai,a2,...,am)of positive integers is called a Diophantine m-tuple if aiaj+1 is a perfect square for all 1≤i<j≤m.Let(a,b,c)be the Diophantine triple with c>max(a,b].In this paper,we find the condition for... A set[ai,a2,...,am)of positive integers is called a Diophantine m-tuple if aiaj+1 is a perfect square for all 1≤i<j≤m.Let(a,b,c)be the Diophantine triple with c>max(a,b].In this paper,we find the condition for the reduction of third element c,and using this result,we prove the extendibility of Diophantine pair[F_(k)-1F_(k+1),F_(k-2)F_(k+2)],where Fn is the n-th Fibonacci number. 展开更多
关键词 Diophantine m-tuple Fibonacci numbers Pell equation
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部