Motivated by an old question investigated by Erd\H{o}s (colloquially referred to as the ''Multiplication Table'' problem) and recent developments in its study by Ford and Tenenbaum, we investigate the fundamental problem of locating the divisors of ''most'' integers in certain intervals. We generalize Erd\H{o}s' problem to a certain class of Arithmetical Semigroups using Ford's techniques. We generalize this problem in a different direction by providing explicit estimates of "restricted multiplication tables" in various interesting cases.M.Sc
this paper. After some preliminaries in Section 3, where we discuss arithmetical properties of eleme...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46612/1/222_2005_Article_BF01388495.pd
AbstractLet be an arithmetical function and S = x1, xn a set of distinct positive integers. Let ((xi...
Motivated by an old question investigated by Erd\H{o}s (colloquially referred to as the ''Multiplica...
In 1955 Erd??s posed the multiplication table problem: Given a large integer N, how many distinct pr...
In this note, we generalize the concept of multiplication table by connecting with lattice points. ...
We estimate the density of integers which have more than one divisor in an interval (y, z] with z ≈ ...
ErdÅ s once asked about the function M(n) which counts the number of distinct products in an nxn mul...
In this edition of ‘Adventures’ we study a curious problem concerning the divisors of a certain num...
Dedicated to the memory of Professor Ivan Korec Abstract. The notion of a regular system of divisors...
71 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.We investigate several problem...
AbstractWith emphasis on some natural asymptotic enumeration questions, a study is made of various a...
A digital semigroup D is a subsemigroup of (N,+ ) such that if d 2 D then fx 2 Nnf0g j ℓ(x) = ℓ(d)g ...
There is a body of work in the literature on various restricted sums of the number of divisors of an...
International audienceWe carry out a detailed investigation of congruence half-factorial Krull monoi...
this paper. After some preliminaries in Section 3, where we discuss arithmetical properties of eleme...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46612/1/222_2005_Article_BF01388495.pd
AbstractLet be an arithmetical function and S = x1, xn a set of distinct positive integers. Let ((xi...
Motivated by an old question investigated by Erd\H{o}s (colloquially referred to as the ''Multiplica...
In 1955 Erd??s posed the multiplication table problem: Given a large integer N, how many distinct pr...
In this note, we generalize the concept of multiplication table by connecting with lattice points. ...
We estimate the density of integers which have more than one divisor in an interval (y, z] with z ≈ ...
ErdÅ s once asked about the function M(n) which counts the number of distinct products in an nxn mul...
In this edition of ‘Adventures’ we study a curious problem concerning the divisors of a certain num...
Dedicated to the memory of Professor Ivan Korec Abstract. The notion of a regular system of divisors...
71 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.We investigate several problem...
AbstractWith emphasis on some natural asymptotic enumeration questions, a study is made of various a...
A digital semigroup D is a subsemigroup of (N,+ ) such that if d 2 D then fx 2 Nnf0g j ℓ(x) = ℓ(d)g ...
There is a body of work in the literature on various restricted sums of the number of divisors of an...
International audienceWe carry out a detailed investigation of congruence half-factorial Krull monoi...
this paper. After some preliminaries in Section 3, where we discuss arithmetical properties of eleme...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46612/1/222_2005_Article_BF01388495.pd
AbstractLet be an arithmetical function and S = x1, xn a set of distinct positive integers. Let ((xi...