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.     

Quasi-genera of quadratic forms

Let f be a quadratic form in n variables (n > 1) with nonzero determinant d. A prime p is said to be exceptional with respect to f if every automorph of f with rational elements, determinant ±1 and denominator prime to 2d has a denominator which is a quadratic residue of p. (Throughout, slight modifications must be made if p = 2.) Except for certain binary forms, each exceptional prime induces a splitting of the genus into two quasi-genera. Building on previous results, necessary and sufficient conditions are given that a prime p be exceptional for n = 2 and n = 3 and necessary conditions for n > 3. It is proved that there are no exceptional primes for n > 4 and only possibly in special cases for n = 4. A connection is shown between representations of integers by certain ternary forms and the existence of quasi-genera. Possible connections with spinor genera are mentioned and a few unanswered questions are posed.     

Sums of primes and quadratic linear recurrence sequences

Let u be a sequence of positive integers which grows essentially as a geometric progression. We give a criterion on u in terms of its distribution modulo d, d = 1, 2,..., under which the set of positive integers expressible by the sum of a prime number and an element of u has a positive lower density. This criterion is then checked for some second order linear recurrence sequences. It follows, for instance, that the set of positive integers of the form p ＋ [（2 ＋ √3）n], where p is a prime number and n is a positive integer, has a positive lower density. This generalizes a recent result of Enoch Lee. In passing, we show that the periods of linear recurrence sequences of order m modulo a prime number p cannot be ＂too small＂ for most prime numbers p.     

On the distribution of values of certain divisor functions

Let {?_d} be a sequence of nonnegative numbers and f(n) = Σ?_d, the sum being over divisors d of n. We say that f has the distribution function F if for all c ≥ 0, the number of integers n ≤ x for which f(n) > c is asymptotic to xF(c), and we investigate when F exists and when it is continuous.     

The estimate for mean values on prime numbers relative to \frac{4} {p} = \frac{1} {{n_1 }} + \frac{1} {{n_2 }} + \frac{1} {{n_3 }}

If n is a positive integer,let f （n） denote the number of positive integer solutions （n 1,n 2,n 3） of the Diophantine equation 4/n=1/n₁ + 1/n₂ + 1/n₃.For the prime number p,f （p） can be split into f 1 （p） + f 2 （p）,where f i （p） （i=1,2） counts those solutions with exactly i of denominators n 1,n 2,n 3 divisible by p.In this paper,we shall study the estimate for mean values ∑ p相似文献   

A characterization of the identity function with equation f(p+q+r)=f(p)+f(q)+f(r)

Let f(n) be a multiplicative function such that there exists a prime p ₀ at which f does not vanish. In this paper, we prove that if f satisfies the equation f(p+q+r)=f(p)+f(q)+f(r) for all primes p, q and r, then f(n)=n for all integers n≥1.     

Meet and join matrices in the poset of exponential divisors

It is well-known that (ℤ₊, |) = (ℤ₊, GCD, LCM) is a lattice, where | is the usual divisibility relation and GCD and LCM stand for the greatest common divisor and the least common multiple of positive integers. The number $ d = \prod\nolimits_{k = 1}^r {p_k^{d^{(k)} } } $ d = \prod\nolimits_{k = 1}^r {p_k^{d^{(k)} } } is said to be an exponential divisor or an e-divisor of $ n = \prod\nolimits_{k = 1}^r {p_k^{n^{(k)} } } $ n = \prod\nolimits_{k = 1}^r {p_k^{n^{(k)} } } (n > 1), written as d | _e n, if d ^(k) for all prime divisors p _k of n. It is easy to see that (ℤ₊\{1}, | _e is a poset under the exponential divisibility relation but not a lattice, since the greatest common exponential divisor (GCED) and the least common exponential multiple (LCEM) do not always exist.     

On the order of an automorphism of a smooth hypersurface

In this paper we give an effective criterion as to when a positive integer q is the order of an automorphism of a smooth hypersurface of dimension n and degree d, for every d ≥ 3, n ≥ 2, (n, d) ≠ (2, 4), and gcd(q, d) = gcd(q, d ? 1) = 1. This allows us to give a complete criterion in the case where q = p is a prime number. In particular, we show the following result: If X is a smooth hypersurface of dimension n and degree d admitting an automorphism of prime order p then p < (d ? 1) ⁿ⁺¹; and if p > (d ? 1) ⁿ then X is isomorphic to the Klein hypersurface, n = 2 or n + 2 is prime, and p = Φ _n+2(1 ? d) where Φ _n+2 is the (n+2)-th cyclotomic polynomial. Finally, we provide some applications to intermediate jacobians of Klein hypersurfaces.     

New oscillation criteria for third order nonlinear neutral difference equations

In this paper, we are concerned with oscillation of the third-order nonlinear neutral difference equation $\Delta (c_n [\Delta (d_n \Delta (x_n + p_n x_{n - \tau } ))]^\gamma ) + q_n f(x_{g(n)} ) = 0,n \geqslant n_0 ,$ where γ > 0 is the quotient of odd positive integers, c _n , d _n , p _n and q _n are positive sequences of real numbers, τ is a nonnegative integer, g(n) is a sequence of nonnegative integers and f ∈ C(?,?) such that uf(u) > 0 for u ≠ 0. Our results extend and improve some previously obtained ones. Some examples are considered to illustrate the main results.     

Perfect state transfer in integral circulant graphs of non-square-free order

This paper provides further results on the perfect state transfer in integral circulant graphs (ICG graphs). The non-existence of PST is proved for several classes of ICG graphs containing an isolated divisor d₀, i.e. the divisor which is relatively prime to all other divisors from d∈D?{d₀}. The same result is obtained for classes of integral circulant graphs having the NSF property (i.e. each n/d is square-free, for every d∈D). A direct corollary of these results is the characterization of ICG graphs with two divisors, which have PST. A similar characterization is obtained for ICG graphs where each two divisors are relatively prime. Finally, it is shown that ICG graphs with the number of vertices n=2p² do not have PST.     

Remarks on some zero-sum problems

Let Z denote the ring of integers and for a prime p and positive integers r and d, let f_r(P, d) denote the smallest positive integer such that given any sequence of f_r(p, d) elements in (Z/pZ(^d, there exists a subsequence of (rp) elements whose sum is zero in (Z/pZ(^d. That f₁(p, 1) = 2p − 1, is a classical result due to Erdős, Ginzburg and Ziv. Whereas the determination of the exact value of f₁(p, 2) has resisted the attacks of many well known mathematicians, we shall see that exact values of f_r(p, 1) for r ≥ 1 can be easily obtained from the above mentioned theorem of Erdős, Ginzburg and Ziv and those of f_r(p, 2) for r ≥ 2 can be established by the existing techniques developed by Alon, Dubiner and Rónyai in connection with obtaining good upper bounds for f₁(p, 2). We shall also take this opportunity to describe some of the early results in the introduction.     

Primitive divisors of some Lehmer-Pierce sequences

We study primitive prime divisors of the terms of Δ(u)=(Δn(u))_n?1, where Δn(u)=NK/Q(un−1) for K a real quadratic field, and u a unit element of its ring of integers. The methods used allow us to find the terms of the sequence that do not have a primitive prime divisor.     

On van der Waerden's theorem and the theorem of Paris and Harrington

A 2-coloring of the non-negative integers and a function h are given such that if P is any monochromatic arithmetic progression with first term a and common difference d then 6P6 ? h(a) and 6P6 ? h(d). In contrast to this the following result is noted. For any k, f there is n = n(k, f) such that whenever n is k-colored there is a monochromatic subset A of n with 6A6 > f(d), where d is the maximum of the differences between consecutive elements of A.     

Integers divisible by sums of powers of their prime factors

For each positive integer j, let βj(n):=_∑p|npj. Given a fixed positive integer k, we show that there are infinitely many positive integers n having at least two distinct prime factors and such that βj(n)|n for each j∈{1,2,…,k}.     

On Bernstein's inequality for entire functions of exponential type

It was shown by S.N. Bernstein that if f is an entire function of exponential type τ such that |f(x)|?M for −∞<x<∞, then |f^′(x)|?Mτ for −∞<x<∞. If p is a polynomial of degree at most n with |p(z)|?M for |z|=1, then f(z):=p(eiz) is an entire function of exponential type n with |f(x)|?M on the real axis. Hence, by the just mentioned inequality for functions of exponential type, |p^′(z)|?Mn for |z|=1. Lately, many papers have been written on polynomials p that satisfy the condition znp(1/z)≡p(z). They do form an intriguing class. If a polynomial p satisfies this condition, then f(z):=p(eiz) is an entire function of exponential type n that satisfies the condition f(z)≡einzf(−z). This led Govil [N.K. Govil, Lp inequalities for entire functions of exponential type, Math. Inequal. Appl. 6 (2003) 445-452] to consider entire functions f of exponential type satisfying f(z)≡eiτzf(−z) and find estimates for their derivatives. In the present paper we present some additional observations about such functions.     

Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm

In the first part of the paper, certain incomplete character sums over a finite field F_p^r are considered which in the case of finite prime fields F_p are of the form ∑^A+N−1_n=Aχ(g(n))ψ(f(n)), where A and N are integers with 1≤N<p, g and f are polynomials over F_p, and χ denotes a multiplicative and ψ an additive character of F_p. Excluding trivial cases, it is shown that the above sums are at most of the order of magnitude N^1/2p^r/4. Recently, Shparlinski showed that a polynomial f over the integers which coincides with the discrete logarithm of the finite prime field F_p for N consecutive elements of F_p must have a degree at least of the order of magnitude Np^−1/2. In this paper this result is extended to arbitrary F_p^r. The proof is based on the above new bound for incomplete hybrid character sums.     

On the distribution of the roots of certain congruences and a problem for additive arithmetic functions

The asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D varies, is investigated. Quantitative estimates are obtained by means of exponential sums combined with sieve methods. As an application of the results it is shown that if an additive arithmetic function satisfies f(an + b) ? f(cn + d) = O(1) for all positive integers n, ad ≠ bc, then f(n) = O((log n)³) must hold. This result is apparently the first bound of any kind in such a situation.     

On arithmetical functions related to the Ramanujan sum

Let m and n be positive integers, and μ the M"bius function. And let S _f(m,n) be the function defined by , where f is an arithmetical function. We show that this function has many properties like the Ramanujan sum. Firstly we study the partial summation formula involving S _f(m,n) and taking f=μ, we obtain the Dirichlet series with the coefficients Sμ(m,n) and Sμ(m,n)d(m). Moreover we show a certain property which is analogous to the orthogonality relation of the Ramanujan sums. This revised version was published online in June 2006 with corrections to the Cover Date.     

On a Problem of Fabrykowski and Subbarao Concerning Quasi Multiplicative Functions Satisfying a Congruence Property

It follows from our result that if a quasi multiplicative function f satisfies the congruence f(n + p) f(n) (mod p) for all positive integers n and for all sufficiently large primes p, then there is a non-negative integer such that f(n) = n holds for all positive integers n. In particular, this gives an answer to the conjecture of Fabrykowski and Subbarao.     

On the Bateman-Horn Conjecture

Let r be a positive integer and f₁,…,f_r be distinct polynomials in Z[X]. If f₁(n),…,f_r(n) are all prime for infinitely many n, then it is necessary that the polynomials f_i are irreducible in Z[X], have positive leading coefficients, and no prime p divides all values of the product f₁(n)···f_r(n), as n runs over Z. Assuming these necessary conditions, Bateman and Horn (Math. Comput.16 (1962), 363-367) proposed a conjectural asymptotic estimate on the number of positive integers n?x such that f₁(n),…,f_r(n) are all primes. In the present paper, we apply the Hardy-Littlewood circle method to study the Bateman-Horn conjecture when r?2. We consider the Bateman-Horn conjecture for the polynomials in any partition {f₁,…,f_s}, {f_s+1,…,f_r} with a linear change of variables. Our main result is as follows: If the Bateman-Horn conjecture on such a partition and change of variables holds true with some conjectural error terms, then the Bateman-Horn conjecture for f₁,…,f_r is equivalent to a plausible error term conjecture for the minor arcs in the circle method.