Prime divisors of palindromes

Summary In this paper, we study some divisibility properties of palindromic numbers in a fixed base <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"6"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"7"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"8"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"9"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>g\ge 2$. In particular, if ${\mathcal P}_L$ denotes the set of palindromes with precisely $L$ digits, we show that for any sufficiently large value of $L$ there exists a palindrome $n\in{\mathcal P}_L$ with at least $(\log\log n)^{1+o(1)}$ distinct prime divisors, and there exists a palindrome $n\in{\mathcal P}_L$ with a prime factor of size at least $(\log n)^{2+o(1)}$.     

Prime divisors of sparse integers

We obtain a lower bound on the number of prime divisors of integers whose g-ary expansion contains a fixed number of nonzero digits. This revised version was published online in August 2006 with corrections to the Cover Date.     

Primitive divisors of elliptic divisibility sequences

Silverman proved the analogue of Zsigmondy's Theorem for elliptic divisibility sequences. For elliptic curves in global minimal form, it seems likely this result is true in a uniform manner. We present such a result for certain infinite families of curves and points. Our methods allow the first explicit examples of the elliptic Zsigmondy Theorem to be exhibited. As an application, we show that every term beyond the fourth of the Somos-4 sequence has a primitive divisor.     

Diophantine equations with products of consecutive terms in Lucas sequences

In this paper, we show that if (u_n)_n?1 is a Lucas sequence, then the Diophantine equation in integers n?1, k?1, m?2 and y with |y|>1 has only finitely many solutions. We also determine all such solutions when (u_n)_n?1 is the sequence of Fibonacci numbers and when u_n=(xⁿ-1)/(x-1) for all n?1 with some integer x>1.     

Additive problems for integers with a given number of prime divisors

The asymptotics of sums of the form Στ(|bn−a|) (summation overn<N, ω(n)=k) is studied, whereω(n) is the number of distinct prime divisors ofn, andτ(n) is the number of all divisors. Translated fromMatematicheskie Zametki, Vol. 63, No. 5, pp. 749–762, May, 1998. In conclusion, the author wishes to express his gratitude to Professor N. M. Timofeev for valuable advice. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-00502.     

Properties of large prime divisors of numbers of the form p − 1

The main result of this paper is the fact that the fraction of primes p ≤ x satisfying the condition that p ? 1 has a prime divisor q > exp(ln x/ln ln x) and the number of prime divisors of q ? 1 essentially differ from ln ln(x/n), where n = (p ? 1)/q, tends to zero as x increases.     

On numbers not of the form <Emphasis Type=”Italic”>n</Emphasis>-ω(<Emphasis Type=”Italic”>n</Emphasis>)

Summary We introduce a new class of lightlike submanifolds, namely, Screen Cauchy Riemann (SCR) lightlike submanifolds of indefinite Kaehler manifolds. Contrary to CR-lightlike submanifolds, we show that SCR-lightlike submanifolds include invariant (complex) and screen real subcases of lightlike submanifolds. We study some properties of proper totally umbilical SCR-lightlike submanifolds, their invariant (complex) and screen real subcases.     

Integers with dense divisors

Let 1=d₁(n)<d₂(n)<?<d_τ(n)=n be the sequence of all positive divisors of the integer n in increasing order. We say that the divisors of n are y-dense iff max_1?i<τ(n)d_i+1(n)/d_i(n)?y. Let D(x,y,z) be the number of positive integers not exceeding x whose divisors are y-dense and whose prime divisors are bigger than z, and let , and . We show that is equivalent, in a large region, to a function d(u,v) which satisfies a difference-differential equation. Using that equation we find that d(u,v)?(1−u/v)/(u+1) for v?3+ε. Finally, we show that d(u,v)=e^−γd(u)+O(1/v), where γ is Euler's constant and d(u)∼x⁻¹D(x,y,1), for fixed u. This leads to a new estimate for d(u).     

Galois环上本原序列压缩映射的单性

设Ω是 Ｇａｌｏｉｓ环 ＧＲ（２~ｄ,ｒ）的 Ｔｅｉｃｈｍｕｌｌｅｒ代表集,则 ＧＲ（２~ｄ,ｒ）上每条序列ａ有唯一的权位分解,　其中ａ-ｉ是Ω上序列,同时也可自然视为有限域Ｆ-（２~ｒ）,上序列．设ｆ（ｘ）是环 ＧＲ（２~ｄ,ｒ）上强本原多项式,Ｇ（ｆ（ｘ））表示 ＧＲ（２~ｄ,ｒ）上以ｆ（ｘ）为特征多项式的序列的全体,是Ｆ-（２~ｒ）上一类ｄ－１元多项式, 　本文证明了压缩映射是单射,即对 ａ＝ ｂ当且仅当对所有 ａ,ｂ ∈ Ｇ（ｆ（ｘ））．     

Exponential sums and prime divisors of sparse integers

We obtain a new lower bound on the number of prime divisors of integers whose g-ary expansion contains a fixed number of nonzero digits.      

ON GENERALIZATION OF SONAR SEQUENCES AND INTERMODULATION－FREE FREQUENCIES ASSIGNMENT SEQUENCES

ＣＨＥＮＷＥＮＤＥ（陈文德）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８０，ＣｈｉｎａａｎｄＳｔａｔｅＫｅｙＬａｂｒａｒｙｏｆＩｎｆｏｒｍａｔｉｏｎＳｅｃｕｒ...     

The algebraic independence of the sum of divisors functions

Let σj(n)=_∑d|ndj be the sum of divisors function, and let I be the identity function. When considering only one input variable n, we show that the set of functions is algebraically independent. With two input variables, we give a non-trivial identity involving the sum of divisors function, prove its uniqueness, and use it to prove that any perfect number n must have the form n=rσ(r)/(2r−σ(r)), with some restrictions on r. This generalizes the known forms for both even and odd perfect numbers.     

Distribution of Primitive λ-Roots of Composite Moduli Ⅱ

We improve estimates for the distribution of primitive λ-roots of a composite modulus q yielding an asymptotic formula for the number of primitive λ-roots in any interval Ⅰ of length |I| (>>) q1/2+∈. Similar results are obtained for the distribution of ordered pairs (x, x-1) with x a primitive λ-root, and for the number of primitive λ-roots satisfying inequalities such as |x -x-1| ≤ B.     

关于Smarandache素数列及其它的行列式

对任意正整数n≥2,Smarandache下素数列{pp(n))定义为小于或等于n的最大素数;而Smarandache上素数列{Pp(n))表示大于或等于n的最小素数.本文的主要目的是利用初等方法研究Smarandache素数列的性质,并得到由Smarandache素数列组成的行列式的一些性质.     

On Farey Fractions with Small Prime Factors

We investigate the Farey fractions, i.e., the set of irreducible fractions m /n, 0 < m < n x. We derive an asymptotic equality for the number of Farey fractions having no large prime factors.     

关于Euler e-函数和n的指数互素因子

对于任意正整数n,设n=pα11pα22…pαrr为n的标准素因数分解式,如果对于de n且de=pβ11pβ22…pβrr有(βi,αi)=1(i=1,2,…,k),则称de为n的指数互素因子.本文利用初等及解析方法研究了正整数n的所有de因子的求和及求积的计算问题,获得了两个有趣的计算公式;同时还研究了n的所有de因子个数函数,即Eu ler e函-数φe(n)的均值性质,并给出了一个较强的渐近公式.     

A remark on a paper of Luca

Summary It is proved that the set of those natural numbers which cannot be written as n-Ω(n) is of positive lower density. Here Ω(n) is the number of the prime power divisors of n. This is a refinement of a theorem of F. Luca.     

On the difference between the number of prime divisors at consecutive integers

Suppose thatg(n) is equal to the number of divisors ofn, counting multiplicity, or the number of divisors ofn, a≠0 is an integer, andN(x,b)=|{n∶n≤x, g(n+a)−g(n)=b orb+1}|. In the paper we prove that sup _b N(x,b)≤C(a)x)(log log 10 _x )^−1/2 and that there exists a constantC(a,μ)>0 such that, given an integerb |b|≤μ(log logx)^1/2,x≥x _o, the inequalityN(x,b)≥C(a,μ)x(log logx(^−1/2) is valid. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 579–595, October, 1999.