B-free numbers in short arithmetic progressions

Given a sequence B of relatively prime positive integers with the sum of inverses finite, we investigate the problem of finding B-free numbers in short arithmetic progressions.     

On almost prime k-tuples

Let k?2 and ai,bi(1?i?k) be integers such that ai>0 and _∏1?i<j?k(aibj−ajbi)≠0. Let Ω(m) denote the total number of prime factors of m. Suppose has no fixed prime divisors. Results of the form where rk is asymptotic to klogk have been obtained by using sieve methods, in particular weighted sieves. In this paper, we use another kind of weighted sieve due to Selberg to obtain improved admissible values for rk.     

Values of the Euler function free of kth powers

We establish an asymptotic formula for the number of positive integers n?x for which φ(n) is free of kth powers.     

A new family of k-Fibonacci numbers

In the present paper, we give a new family of k-Fibonacci numbers and establish some properties of the relation to the ordinary Fibonacci numbers. Furthermore, we describe the recurrence relations and the generating functions of the new family for k=2 and k=3, and presents a few identity formulas for the family and the ordinary Fibonacci numbers.     

Barban-Davenport-Halberstam average sum and exceptional zero of L-functions

We prove a formula for the Barban-Davenport-Halberstam average sum

     

k-Hypermonogenic automorphic forms

In this paper we deal with monogenic and k-hypermonogenic automorphic forms on arithmetic subgroups of the Ahlfors-Vahlen group. Monogenic automorphic forms are exactly the 0-hypermonogenic automorphic forms. In the first part we establish an explicit relation between k-hypermonogenic automorphic forms and Maaß wave forms. In particular, we show how one can construct from any arbitrary non-vanishing monogenic automorphic form a Clifford algebra valued Maaß wave form. In the second part of the paper we compute the Fourier expansion of the k-hypermonogenic Eisenstein series which provide us with the simplest non-vanishing examples of k-hypermonogenic automorphic forms.     

On k-planar crossing numbers

The k-planar crossing number of a graph is the minimum number of crossings of its edges over all possible drawings of the graph in k planes. We propose algorithms and methods for k-planar drawings of general graphs together with lower bound techniques. We give exact results for the k-planar crossing number of K_2k+1,q, for k?2. We prove tight bounds for complete graphs. We also study the rectilinear k-planar crossing number.     

On integers of the forms k−2 and k2+1

In this paper we prove that if (r,12)?3, then the set of positive odd integers k such that k^r−2ⁿ has at least two distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k^r2ⁿ+1 is also true.     

Sums and products with smooth numbers

We estimate the sizes of the sumset A+A and the productset A⋅A in the special case that A=S(x,y), the set of positive integers n?x free of prime factors exceeding y.     

Further results on the euler and Genocchi numbers

Summary We characterize the ordinary generating functions of the Genocchi and median Genocchi numbers as unique solutions of some functional equations and give a direct algebraic proof of several continued fraction expansions for these functions. New relations between these numbers are also obtained.     

On the distribution of square-full and cube-full numbers

There are many results on the distribution of square-full and cube-full numbers. In this article the distribution of these numbers are studied in more detail. Suchk-full numbers (k=2,3) are considered which are at the same time 1-free (1k+2). At first an asymptotic result is given for the numberN _k,1(x) ofk-full and 1-free numbers not exceedingx. Then the distribution of these numbers in short intervals is investigated. We obtain different estimations of the differenceN _k,1(x+h)–N_k,1(x) in the casesk=2, 1=4,5,6,7,18 andk=3, 1=5,6,7, 18.     

Odd multiperfect numbers of abundancy 4

Euler's structure theorem for any odd perfect number is extended to odd multiperfect numbers of abundancy power of 2. In addition, conditions are found for classes of odd numbers not to be 4-perfect: some types of cube, some numbers divisible by 9 as the maximum power of 3, and numbers where 2 is the maximum even prime power.     

Lower bounds for numbers of ABC-hits

By an ABC-hit, we mean a triple (a,b,c) of relatively prime positive integers such that a+b=c and rad(abc)<c. Denote by N(X) the number of ABC-hits (a,b,c) with c?X. In this paper we discuss lower bounds for N(X). In particular we prove that for every ?>0 and X large enough N(X)?exp((logX)^1/2−?).     

A remark on sociable numbers of odd order

Write s(n) for the sum of the proper divisors of the natural number n. We call n sociable if the sequence n, s(n), s(s(n)), … is purely periodic; the period is then called the order of sociability of n. The ancients initiated the study of order 1 sociables (perfect numbers) and order 2 sociables (amicable numbers), and investigations into higher-order sociable numbers began at the end of the 19th century. We show that if k is odd and fixed, then the number of sociable n?x of order k is bounded by as x→∞. This improves on the previously best-known bound of , due to Kobayashi, Pollack, and Pomerance.     

There are infinitely many Perrin pseudoprimes

This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the proof of the infinitude of Carmichael numbers, along with zero-density estimates for Hecke L-functions.     

Additive functions on arithmetic progressions with large moduli

In this paper we study additive functions on arithmetic progressions with large moduli. We are able to improve some former results given by Elliott.     

A Bombieri-Vinogradov type exponential sum result with applications

We prove a Bombieri-Vinogradov type result for linear exponential sums over primes. Then we apply it to show that, for any irrational α and some θ>0, there are infinitely many primes p such that p+2 has at most two prime factors and ‖αp+β‖<p−θ.     

Density of sets of natural numbers and the Lévy group

Let N denote the set of positive integers. The asymptotic density of the set A⊆N is d(A)=limn→∞|A∩[1,n]|/n, if this limit exists. Let AD denote the set of all sets of positive integers that have asymptotic density, and let SN denote the set of all permutations of the positive integers N. The group L^? consists of all permutations f∈SN such that A∈AD if and only if f(A)∈AD, and the group L^* consists of all permutations f∈L^? such that d(f(A))=d(A) for all A∈AD. Let be a one-to-one function such that d(f(N))=1 and, if A∈AD, then f(A)∈AD. It is proved that f must also preserve density, that is, d(f(A))=d(A) for all A∈AD. Thus, the groups L^? and L^* coincide.     

Practical numbers in Lucas sequences

Abstract

A practical number is a positive integer n such that all the positive integers m ≤ n can be written as a sum of distinct divisors of n. Let (u_n)_n≥0 be the Lucas sequence satisfying u₀ = 0, u₁ = 1, and u_n+2 = au_n+1 + bu_n for all integers n ≥ 0, where a and b are fixed nonzero integers. Assume a(b + 1) even and a² + 4b > 0. Also, let be the set of all positive integers n such that |u_n| is a practical number. Melfi proved that is infinite. We improve this result by showing that #(x) ? x/log x for all x ≥ 2, where the implied constant depends on a and b. We also pose some open questions regarding .