咨询与建议

限定检索结果

文献类型

  • 144 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 145 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 144 篇 理学
    • 143 篇 数学
    • 1 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 7 篇 工学
    • 4 篇 计算机科学与技术...
    • 1 篇 软件工程

主题

  • 145 篇 linear forms in ...
  • 37 篇 diophantine equa...
  • 23 篇 reduction method
  • 15 篇 fibonacci number...
  • 14 篇 repdigit
  • 12 篇 baker's method
  • 10 篇 diophantine equa...
  • 9 篇 fibonacci number
  • 8 篇 thue equations
  • 7 篇 pell equation
  • 6 篇 lucas number
  • 6 篇 repdigits
  • 6 篇 diophantine m-tu...
  • 5 篇 exponential diop...
  • 5 篇 continued fracti...
  • 4 篇 lucas numbers
  • 4 篇 pillai's problem
  • 4 篇 linear recurrenc...
  • 4 篇 pellian equation...
  • 3 篇 generalized fibo...

机构

  • 9 篇 univ brasilia de...
  • 7 篇 king abdulaziz u...
  • 6 篇 nihon univ coll ...
  • 6 篇 sakarya univ dep...
  • 6 篇 univ zagreb fac ...
  • 6 篇 univ witwatersra...
  • 5 篇 unam ctr ciencia...
  • 5 篇 univ witwatersra...
  • 5 篇 purdue univ nort...
  • 4 篇 univ brasilia de...
  • 4 篇 bingol univ dept...
  • 4 篇 purdue univ n ce...
  • 4 篇 sakarya univ mat...
  • 4 篇 graz univ techno...
  • 3 篇 romanian acad si...
  • 3 篇 univ waterloo de...
  • 3 篇 purdue univ nort...
  • 3 篇 sakarya univ app...
  • 3 篇 univ valle dept ...
  • 2 篇 univ cauca dept ...

作者

  • 21 篇 luca florian
  • 14 篇 togbe alain
  • 13 篇 marques diego
  • 11 篇 erduvan fatih
  • 10 篇 keskin refik
  • 8 篇 cipu mihai
  • 7 篇 siar zafer
  • 7 篇 ddamulira mahadi
  • 7 篇 fujita yasutsugu
  • 7 篇 mignotte maurice
  • 6 篇 filipin alan
  • 6 篇 adedji kouessi n...
  • 5 篇 he bo
  • 5 篇 bravo jhon j.
  • 3 篇 alan murat
  • 3 篇 gomez carlos a.
  • 3 篇 batte herbert
  • 3 篇 akhtari shabnam
  • 3 篇 kandhil neelam
  • 3 篇 ziegler volker

语言

  • 115 篇 英文
  • 29 篇 其他
检索条件"主题词=Linear forms in logarithms"
145 条 记 录,以下是71-80 订阅
排序:
Root separation for trinomials
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2019年 95卷 151-161页
作者: Koiran, Pascal Univ Lyon EnsL UCBL CNRSInriaLIP F-69342 Lyon France
We give a separation bound for the complex roots of a trinomial f is an element of Z[X]. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of f;in particular, it is ... 详细信息
来源: 评论
ON D(-1)-QUADRUPLES
收藏 引用
PUBLICACIONS MATEMATIQUES 2012年 第2期56卷 279-304页
作者: Bonciocat, Nicolae Ciprian Cipu, Mutat Mignotte, Maurice Romanian Acad Simian Stoilow Inst Math Res Unit 5 POB 1-764 RO-014700 Bucharest Romania Univ Strasbourg UFR Math F-67084 Strasbourg France
Quadruples (a, b, c, d) of positive integers a < b < c < d with the property that the product of any two of them is one more than a perfect square are studied. Improved lower and upper bounds for the entries ... 详细信息
来源: 评论
UPPER BOUNDS FOR THE NUMBER OF SOLUTIONS TO QUARTIC THUE EQUATIONS
收藏 引用
INTERNATIONAL JOURNAL OF NUMBER THEORY 2012年 第2期8卷 335-360页
作者: Akhtari, Shabnam Univ Montreal CRM Ctr Ville Stn Montreal PQ H3C 3J7 Canada
We will give upper bounds for the number of integral solutions to quartic Thue equations. Our main tool here is a logarithmic curve phi(x, y) that allows us to use the theory of linear forms in logarithms. This paper ... 详细信息
来源: 评论
Consecutive tuples of multiplicatively dependent integers
收藏 引用
JOURNAL OF NUMBER THEORY 2022年 236卷 280-307页
作者: Vukusic, Ingrid Ziegler, Volker Univ Salzburg Hellbrunnerstr 34-I A-5020 Salzburg Austria
This paper is concerned with the existence of consecutive pairs and consecutive triples of multiplicatively dependent integers. A theorem by LeVeque on Pillai's equation implies that the only consecutive pairs of ... 详细信息
来源: 评论
k-Fibonacci powers as sums of powers of some fixed primes
收藏 引用
MONATSHEFTE FUR MATHEMATIK 2021年 第1期195卷 73-105页
作者: Gomez, Carlos A. Gomez, Jhonny C. Luca, Florian Univ Valle Dept Matemat Calle 13 100-00 Cali 25360 Colombia Univ Witwatersrand Sch Math Johannesburg South Africa King Abdulaziz Univ Res Grp Algebra Struct & Applicat Jeddah Saudi Arabia UNAM Ctr Ciencias Matemat Morelia Michoacan Mexico Univ Libre Secc Pereira Fac Ciencias Econom Belmonte Ave Las Amer Pereira Colombia
Let S = {p1,..., pt} be a fixed finite set of prime numbers listed in increasing order. In this paper, we prove that the Diophantine equation ( F (k) n)s = pa1 1 + ... + pat t, in integer unknowns n = 1, s = 1, k = 2 ... 详细信息
来源: 评论
On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors
收藏 引用
MONATSHEFTE FUR MATHEMATIK 1996年 第4期121卷 295-307页
作者: Balasubramanian, R Langevin, M Shorey, TN Waldschmidt, M TATA INST FUNDAMENTAL RES SCH MATHBOMBAY 400005MAHARASHTRAINDIA UNIV LILLE 1 MATH UFR MATH M2F-59655 VILLENEUVE DASCQFRANCE UNIV PARIS 07 F-75252 PARISFRANCE
In this paper we consider an analogue of the problem of Erdos and Woods for arithmetic progressions. A positive answer follows from the abe conjecture. Partial results are obtained unconditionally.
来源: 评论
On a conjecture of Murty-Saradha about digamma values
收藏 引用
MONATSHEFTE FUR MATHEMATIK 2022年 第1期199卷 23-43页
作者: Chatterjee, Tapas Dhillon, Sonika Indian Inst Technol Ropar Dept Math Rupnagar 140001 Punjab India
The arithmetic nature of the Euler's constant gamma is one of the biggest unsolved problems in number theory from almost three centuries. In an attempt to give a partial answer to the arithmetic nature of gamma, M... 详细信息
来源: 评论
Number of prime ideals in short intervals
收藏 引用
JOURNAL OF NUMBER THEORY 2016年 167卷 430-480页
作者: Alkan, Emre Mehreliyev, Tevekkul Koc Univ Dept Math TR-34450 Istanbul Turkey
Assuming a weaker form of the Riemann hypothesis for Dedekind zeta functions by allowing Siegel zeros, we extend a classical result of Cramer on the number of primes in short intervals to prime ideals of the ring of i... 详细信息
来源: 评论
On the number of solutions to systems of Pell equations
收藏 引用
JOURNAL OF NUMBER THEORY 2007年 第2期125卷 356-392页
作者: Cipu, Mihai Mignotte, Maurice Univ Louis Pasteur UFR Math F-67084 Strasbourg France Acad Romana Inst Math RO-014700 Bucharest Romania
We prove that, for positive integers a, b, c and d with c not equal d, a > 1, b > 1, the number of simultaneous solutions in positive integers to ax(2) - cz(2) = 1, by(2) - dz(2) = 1 is at most two. This result ... 详细信息
来源: 评论
Repdigits base b as products of two Fibonacci numbers
收藏 引用
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS 2021年 第3期52卷 861-868页
作者: Erduvan, Fatih Keskin, Refik Siar, Zafer Sakarya Univ Dept Math Sakarya Turkey Bingol Univ Dept Math Bingol Turkey
Let (F-n) be the sequence of Fibonacci numbers defined by F-0 = 0, F-1 = 1, and F-n = Fn-1 + Fn-2 for n >= 2. Let 2 <= m <= n and b = 2, 3, 4, 5, 6, 7, 8, 9. In this study, we show that if FmFn is a repdigit ... 详细信息
来源: 评论