Integers without divisors in a given progression

An asymptotic formula is given for the number of integers n ≤ x which do not have divisors in a fixed arithmetical progression. This extends a previous result of Banks et al. (Forum Math 20:1005–1037, 2008) who considered the case of progressions with prime difference.     

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).     

Integers with dense divisors 2

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 t-dense iff max_1?i<τ(n)d_i+1(n)/d_i(n)?t. Let D(x,t) be the number of positive integers not exceeding x whose divisors are t-dense. We show that for x?3, and , we have , where , and d(w) is a continuous function which satisfies d(w)?1/w for w?1. We also consider other counting functions closely related to D(x,t).     

Integers with consecutive divisors in small ratio

An elementary construction of a sequence of positive integers is given. The sequence settles a question of Erdös concerning integers with consecutive divisors in small ratio.     

Equivalence without determinantal divisors

A simple number-theoretic lemma is proved, and then used to develop the theory of equivalence for matrices over principal ideal rings without recourse to the concept of determinantal divisors.     

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.     

Nonsymmetric problem of divisors in an arithmetic progression

We investigate the distribution of values of a nonsymmetric divisor functiond(a,b; n) in an arithmetic progression with increasing difference. Odessa University, Odessa. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 51, No. 6, pp. 753–761, June, 1999.     

Near rings without zero divisors

Near rings without zero divisors, and a dual structure, near codomains, are studied. It is shown that a near ring is a near field if and only if it is an integral near ring, a near codomain, and has a non-zero distributive element. If the additive group (N, +) of a near integral domainN is cohopfian, then (N, +) possesses a fixed point free automorphism which is either torsion free or of prime order. This generalizes a well-known theorem of Ligh for finite near integral domains. A result ofGanesan [1] on the non-zero divisors in a finite ring is generalized to near rings.     

The Titchmarsh problem with integers having a given number of prime divisors

The asymptotics for the number of representations ofN asN→∞ is expressed as the sum of a number havingk prime divisors and a product of two natural numbers. The asymptotics is found fork≤(2−ε) ln lnN and (2+ε) ln lnN≤k≤b ln lnN, whereε>0. The results obtained are uniform with respect tok. Translated fromMatematicheskie Zametki, Vol. 59, No. 4, pp. 585–602, April, 1996. This research was partially supported by the Russian Foundation for Basic Research under grant No. 93-01-00260.     

On common monic divisors having a given canonical diagonal form for matrix polynomials

Under certain restrictions we give a condition for the existence of common monic divisors having a given diagonal form for nonsingular matrix polynomials, and we propose a method of finding them. Translated fromMatematicheskie Metody i Fiziko-Mekhanicheskie Polya, No. 37, 1994, pp. 28–32.     

Binary lie algebras without strong zero divisors

Translated from Algebra i Logika, Vol. 30, No. 2, pp. 226–251, March–April, 1991.     

Integers without large prime factors in short intervals: Conditional results

Under the Riemann hypothesis and the conjecture that the order of growth of the argument of ζ(1/2 + it) is bounded by $\left( {\log t} \right)^{\frac{1} {2} + o\left( 1 \right)}$\left( {\log t} \right)^{\frac{1} {2} + o\left( 1 \right)} , we show that for any given α > 0 the interval $(X,X + \sqrt X (\log X)^{{1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-\nulldelimiterspace} 2} + o\left( 1 \right)} ]$(X,X + \sqrt X (\log X)^{{1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-\nulldelimiterspace} 2} + o\left( 1 \right)} ] contains an integer having no prime factor exceeding X ^α for all X sufficiently large.     

Fuzzy semi-orders: The case of t-norms without zero divisors

For crisp relations the concept of a semi-order can be stated in a number of equivalent ways. When trying to extend this concept to the fuzzy setting, we observe that the (generalized) definitions fail to be equivalent. In this contribution, we discuss which is the most natural definition of a fuzzy semi-order, and study the hierarchy among the alternative definitions, in particular when using a t-norm without zero divisors.