Prime and composite numbers as integer parts of powers

We study prime and composite numbers in the sequence of integer parts of powers of a fixed real number. We first prove a result which implies that there is a transcendental number ξ>1 for which the numbers [ξ^{n !}], n =2,3, ..., are all prime. Then, following an idea of Huxley who did it for cubics, we construct Pisot numbers of arbitrary degree such that all integer parts of their powers are composite. Finally, we give an example of an explicit transcendental number ζ (obtained as the limit of a certain recurrent sequence) for which the sequence [ζⁿ], n =1,2,..., has infinitely many elements in an arbitrary integer arithmetical progression. This revised version was published online in June 2006 with corrections to the Cover Date.     

Prime and composite integers close to powers of a number

We prove that, for any real numbers ξ ≠ 0 and ν, the sequence of integer parts [ξ2 ⁿ  + ν], n = 0, 1, 2, . . . , contains infinitely many composite numbers. Moreover, if the number ξ is irrational, then the above sequence contains infinitely many elements divisible by 2 or 3. The same holds for the sequence [ξ( − 2) ⁿ  + ν _n ], n = 0, 1, 2, . . . , where ν ₀, ν ₁, ν ₂, . . . all lie in a half open real interval of length 1/3. For this, we show that if a sequence of integers x ₁, x ₂, x ₃, . . . satisfies the recurrence relation x _n+d  = cx _n  + F(x _n+1, . . . , x _n+d-1) for each n  ≥  1, where c ≠ 0 is an integer, F(z₁,...,z_d-1) ? \mathbb Z[z₁,...,z_d-1],{F(z_1,\dots,z_{d-1}) \in \mathbb {Z}[z_1,\dots,z_{d-1}],} and lim _{n→ ∞}|x _n | = ∞, then the number |x _n | is composite for infinitely many positive integers n. The proofs involve techniques from number theory, linear algebra, combinatorics on words and some kind of symbolic computation modulo 3.     

Values of the Euler Function in Various Sequences

Let ϕ(n) and λ(n) denote the Euler and Carmichael functions, respectively. In this paper, we investigate the equation ϕ(n)^r = λ(n)^s, where r ≥ s ≥ 1 are fixed positive integers. We also study those positive integers n, not equal to a prime or twice a prime, such that ϕ(n) = p − 1 holds with some prime p, as well as those positive integers n such that the equation ϕ(n) = f(m) holds with some integer m, where f is a fixed polynomial with integer coefficients and degree degf > 1.     

On samples of independent random vectors in spaces of infinitely increasing dimension

We study the asymptotic behavior of a set of random vectors ξ_i, i = 1,..., m, whose coordinates are independent and identically distributed in a space of infinitely increasing dimension. We investigate the asymptotics of the distribution of the random vectors, the consistency of the sets M _m⁽ⁿ⁾ = ξ₁,..., ξ_m and X _n^λ = x ∈ X _n: ρ(x) ≤ λn, and the mutual location of pairs of vectors. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 12, pp. 1706–1711, December, 1998.     

On the values of the divisor function

For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we obtain lower and upper bounds for the average value of the ratio τ(n + 1)/τ(n) as n ranges through positive integers in the interval [1,x]. We also study the cardinality of the sets {τ(p − 1) : p ≤ x prime} and {τ(2ⁿ − 1) : n ≤ x}. Authors’ addresses: Florian Luca, Instituto de Matemáticas, Universidad Nacional Autónoma'de'México, C.P. 58089, Morelia, Michoacán, México; Igor E. Shparlinski, Department of Computing, Macquarie University, Sydney, NSW 2109, Australia     

On the index of composition of integers from various sets

Given an integer n ≥ 2, let λ(n) := (log n)/(log γ(n)), where γ(n) = Π _p|n p, stand for the index of composition of n, with λ(1) = 1. We study the distribution function of (λ(n) – 1) log n as n runs through particular sets of integers, such as the shifted primes, the values of a given irreducible cubic polynomial and the shifted powerful numbers. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Professor M.V. Subbarao passed away on February 15, 2006. Received: 3 March 2006 Revised: 28 October 2006     

On the Greatest Common Di visor of u − 1 and v − 1 with u and v Near ${\cal S}$- units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality holds for all but finitely many positive integers n.     

There are infinitely many limit points of the fractional parts of powers

Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα ⁿ , n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational non-integer number, this result was proved by Vijayaraghavan.     

Van der corput’s difference theorem

We obtain a sufficient condition for a subsetH of positive integers to satisfy that the equidistribution (mod 1) of the sequences (u _n+h − u _n; n=1, 2, ···) for allh ∈H implies the equidistribution of (u _n). Our condition is satisfied, for example, for the following sets: (1)H={n − m; n ∈ I, m ∈ I, n>m}, whereI is any infinite subset of integers; (2)H={| ψ (n)|; ψ(n)≠0,n ∈ Z}, where ψ is a nonconstant polynomial with integral coefficients having at least one integral zero (modq) for allq=2, 3, ···; (3)H={p+1;p is a prime} andH={p − 1;p is a prime}.     

Random Matrices: the Distribution of the Smallest Singular Values

Let ξ be a real-valued random variable of mean zero and variance 1. Let M _n (ξ) denote the n × n random matrix whose entries are iid copies of ξ and σ _n (M _n (ξ)) denote the least singular value of M _n (ξ). The quantity σ _n (M _n (ξ))² is thus the least eigenvalue of the Wishart matrix M_nM_n^*{M_nM_n^\ast}.     

On integer and fractional parts of powers of Salem numbers

Let N be a positive rational integer and let P be the set of powers of a Salem number of degree d. We prove that for any α∈P the fractional parts of the numbers , when n runs through the set of positive rational integers, are dense in the unit interval if and only if N≦ 2d − 4. We also show that for any α∈P the integer parts of the numbers αⁿ are divisible by N for infinitely many n if and only if N≦ 2d − 3. Received: 27 April 2005     

On Chow and Brauer groups of a product of Mumford curves

Let C₁,···,C_d be Mumford curves defined over a finite extension of and let X=C₁×···×C_d. We shall show the following: (1) The cycle map CH₀(X)/n → H^2d(X, μ_n^⊗d) is injective for any non-zero integer n. (2) The kernel of the canonical map CH₀(X)→Hom(Br(X),) (defined by the Brauer-Manin pairing) coincides with the maximal divisible subgroup in CH₀(X).     

An approximation property of lacunary sequences

Let f ₁ and f ₂ be two positive numbers of the field , and let f _n+2 = f _n+1 + f _n for each n ≥ 1. Let us denote by {x} the fractional part of a real number x. We prove that, for each ξ ∉ K, the inequality {ξf _n } > 2/3 holds for infinitely many positive integers n. On the other hand, we prove a result which implies that there is a transcendental number ξ such that {ξf _n } < 39/40 for each n ≥ 1. Moreover, it is shown that, for every a > 1, there is an interval of positive numbers that contains uncountably many numbers ξ such that {a ⁿ } 6 min 2/(a − 1), (34a ² − 32a + 7)/(9(2a − 1)²) for each n > 1. Here, the minimum is strictly smaller than 1 for each a > 1. In contrast, by an old result of Weyl, for any a > 1, the sequence {ξa ⁿ }, n = 1, 2, ..., is uniformly distributed in [0, 1] (and so everywhere dense in [0, 1]) for almost all real numbers ξ.     

Asymptotic separation for independent trajectories of Markov processes

We say that n independent trajectories ξ₁(t),…,ξ _n (t) of a stochastic process ξ(t)on a metric space are asymptotically separated if, for some ɛ > 0, the distance between ξ _i (t _i ) and ξ _j (t _j ) is at least ɛ, for some indices i, j and for all large enough t ₁,…,t _n , with probability 1. We prove sufficient conitions for asymptotic separationin terms of the Green function and the transition function, for a wide class of Markov processes. In particular,if ξ is the diffusion on a Riemannian manifold generated by the Laplace operator Δ, and the heat kernel p(t, x, y) satisfies the inequality p(t, x, x) ≤ Ct ^−ν/2 then n trajectories of ξ are asymptotically separated provided . Moreover, if for some α∈(0, 2)then n trajectories of ξ^(α) are asymptotically separated, where ξ^(α) is the α-process generated by −(−Δ)^α/2. Received: 10 June 1999 / Revised version: 20 April 2000 / Published online: 14 December 2000 RID="*" ID="*" Supported by the EPSRC Research Fellowship B/94/AF/1782 RID="**" ID="**" Partially supported by the EPSRC Visiting Fellowship GR/M61573     

推广的Volterra复合算子的本性范数

本文研究单位圆盘上Bergman型空间到Zygmund型空间上的一类推广的Volterra复合算子.利用符号函数ϕ和g刻画这类算子的有界性、紧性,并计算其本性范数.     

À propos de l’indice de composition des nombres

 We define the index of composition λ(n) of an integer n ⩾ 2 as λ(n) = log n/log γ(n), where γ(n) stands for the product of the primes dividing n, and first establish that λ and 1/λ both have asymptotic mean value 1. We then establish that, given any ɛ > 0 and any integer k ⩾ 2, there exist infinitely many positive integers n such that . Considering the distribution function F(z,x) := #{n < x : λ(n) > z}, we prove that, given 1 < z < 2 and ɛ > 0, then, if x is sufficiently large,

Parabolic problems for the Anderson model

Summary. This is a continuation of our previous work [6] on the investigation of intermittency for the parabolic equation (∂/∂t)u=Hu on ℝ₊×ℤ ^d associated with the Anderson Hamiltonian H=κΔ+ξ(·) for i.i.d. random potentials ξ(·). For the Cauchy problem with nonnegative homogeneous initial condition we study the second order asymptotics of the statistical moments <u(t,0) ^p > and the almost sure growth of u(t,0) as t→∞. We point out the crucial role of double exponential tails of ξ(0) for the formation of high intermittent peaks of the solution u(t,·) with asymptotically finite size. The challenging motivation is to achieve a better understanding of the geometric structure of such high exceedances which in one or another sense provide the essential contribution to the solution. Received: 10 December 1996 / In revised form: 30 September 1997     

On the pontryagin-steenrod-wu theorem

We present a short and direct proof (based on the Pontryagin-Thom construction) of the following Pontryagin-Steenrod-Wu theorem: (a) LetM be a connected orientable closed smooth (n + 1)-manifold,n≥3. Define the degree map deg: π ⁿ (M) →H ⁿ (M; ℤ) by the formula degf =f*[S ⁿ ], where [S ⁿ ] εH ⁿ (M; ℤ) is the fundamental class. The degree map is bijective, if there existsβ εH ₂(M, ℤ/2ℤ) such thatβ ·w ₂(M) ε 0. If suchβ does not exist, then deg is a 2-1 map; and (b) LetM be an orientable closed smooth (n+2)-manifold,n≥3. An elementα lies in the image of the degree map if and only ifρ ₂ α ·w ₂(M)=0, whereρ ₂: ℤ → ℤ/2ℤ is reduction modulo 2.     

On simultaneous approximation to a differentiable function and its derivative by inverse Pal-Type interpolation polynomials

Let ξ_{n −1} < ξ_{n −2} < ξ_{n − 2} < ... < ξ₁ be the zeros of the the (n−1)-th Legendre polynomial P_n−1(x) and −1=x_n<x_n−1<...<x₁=1, the zeros of the polynomial . By the theory of the inverse Pal-Type interpolation, for a function f(x)∈C _[−1,1] ¹ , there exists a unique polynomial R_n(x) of degree 2n−2 (if n is even) satisfying conditions R_n(f, ξ_k) = f (ε_k) (1 ⩽ k ⩽ n −1); R¹ _n(f,x_k)=f¹(x_k)(1≤k≤n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {R_n(f, x)} (n is even) and the main result of this paper is that if f∈C _[1,1] ^r , r≥2, n≥r+2, and n is even then |R¹ _n(f,x)−f¹(x)|=0(1)|W_n(x)|h(x)·n^3−r·E_2n−r−3(f^(r)) holds uniformly for all x∈[−1,1], where .     

A remark on the least n with χ (n) ≠ 1

Suppose that a > 2. We prove that the number of positive integers q ≦ Q such that there exists a primitive character χ modulo q with χ (n) = 1 for all n ≦ (log Q)^a is O(Q^1/(1-a)+ε). Received: 7 December 2004