期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
On the primitive divisors of the recurrent sequence un+1=(4cos^2(2π/7)-1)un-un-1 with applications to group theory 被引量:1
1
作者 Maxim Vsemirnov 《Science China Mathematics》 SCIE CSCD 2018年第11期2101-2110,共10页
Consider the sequence of algebraic integers un given by the starting values u0=0,u1=1 and the recurrence u_(n+1)=(4cos^2(2π/7)-1)u_n-u_(n-1).We prove that for any n ■{1,2,3,5,8,12,18,28,30}the n-th term of the seque... Consider the sequence of algebraic integers un given by the starting values u0=0,u1=1 and the recurrence u_(n+1)=(4cos^2(2π/7)-1)u_n-u_(n-1).We prove that for any n ■{1,2,3,5,8,12,18,28,30}the n-th term of the sequence has a primitive divisor in Z[2 cos(2π/7)].As a consequence we deduce that for any sufficiently large n there exists a prime power q such that the groupcan be generated by a pair x,y with χ~2=y^3=(xy)~7=1 and the order of the commutator[x,y]is exactly n.The latter result answers in affirmative a question of Holt and Plesken. 展开更多
关键词 recurrent sequences primitive divisors Hurwitz groups
原文传递
On the multiplicity of binary recurrences
2
作者 董晓蕾 沈灏 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2003年第2期183-189,共7页
Let A∈N,B∈Z with gcd(A,B)=1,B{-1,0,1}. For the binary recurrence (Lucas sequence) of the form u 0=0, u 1=1, u n+2 =Au n+1 +Bu n, let N 1(A,B,k) be the number of the terms n of |u n|=k, where k∈N. In this paper, usi... Let A∈N,B∈Z with gcd(A,B)=1,B{-1,0,1}. For the binary recurrence (Lucas sequence) of the form u 0=0, u 1=1, u n+2 =Au n+1 +Bu n, let N 1(A,B,k) be the number of the terms n of |u n|=k, where k∈N. In this paper, using a new result of Bilu, Hanrot and Voutier on primitive divisors, we proved that N 1(A,B,k)≤1 except N 1(1,-2,1)=5[n=1,2,3,5,13], N 1(1,-3,1)=3, N 1(1,-5,1)=3,N 1(1,B,1)=2(B{-2,-3,-5}), N 1(12,-55,1)=2, N 1(12,-377,1)=2, N 1(A,B,1)=2(A 2+B=±1, A>1), N 1(1,-2,3)=2, N 1(A,B,A)=2(A 2+2B=±1,A>1. For Lehmer sequence, we got a similar result. In addition, we also obtained some applications of the above results to some Diophantime equations. 展开更多
关键词 binary recurrences diophantine equations MULTIPLICITIES Lucas and Lehmer sequences primitive divisors cryptographic problems
下载PDF
On m-ovoids of finite classical polar spaces with an irreducible transitive automorphism group
3
作者 Tao Feng Weicong Li Ran Tao 《Science China Mathematics》 SCIE CSCD 2024年第3期683-712,共30页
In this paper, we classify the m-ovoids of finite classical polar spaces that admit a transitive automorphism group acting irreducibly on the ambient vector space. In particular, we obtain several new infinite familie... In this paper, we classify the m-ovoids of finite classical polar spaces that admit a transitive automorphism group acting irreducibly on the ambient vector space. In particular, we obtain several new infinite families of transitive m-ovoids. 展开更多
关键词 transitive m-ovoids irreducible action finite classical polar spaces primitive divisor
原文传递
On the Exponential Diophantine Equation x^2 + (3a^2 -1)~m = (4a^2 -1)~n 被引量:1
4
作者 胡永忠 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2007年第2期236-240,共5页
We apply a new, deep theorem of Bilu, Hanrot & Voutier and some fine results on the representation of the solutions of quadratic Diophantine equations to solve completely the exponential Diophantine equation x^2+(3... We apply a new, deep theorem of Bilu, Hanrot & Voutier and some fine results on the representation of the solutions of quadratic Diophantine equations to solve completely the exponential Diophantine equation x^2+(3a^2-1)^m = (4a^2-1)^n when 3a^2-1 is a prime or a prime power. 展开更多
关键词 exponential Diophantine equations Lucas sequences primitive divisors Kronecker symbol.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部