The Erdös-Sós conjecture for spiders

A classical result on extremal graph theory is the Erdös-Gallai theorem: if a graph on n vertices has more than edges, then it contains a path of k edges. Motivated by the result, Erdös and Sós conjectured that under the same condition, the graph should contain every tree of k edges. A spider is a rooted tree in which each vertex has degree one or two, except for the root. A leg of a spider is a path from the root to a vertex of degree one. Thus, a path is a spider of 1 or 2 legs. From the motivation, it is natural to consider spiders of 3 legs. In this paper, we prove that if a graph on n vertices has more than edges, then it contains every k-edge spider of 3 legs, and also, every k-edge spider with no leg of length more than 4, which strengthens a result of Wo?niak on spiders of diameter at most 4.     

About Distances between Points on the Plane

Mathematical Notes -     

Sommes D'Exponentielles et Entiers Sans Grand Facteur Premier

Let S(x,y) be the set S(x,y)= 1 n x : P(n) y, where P(n) denotesthe largest prime factor of n. We study , where f is a multiplicative function. When f=1and when f=µ, we widen the domain of uniform approximationusing the method of Fouvry and Tenenbaum and making explicitthe contribution of the Siegel zero. Soit S(x,y) l'ensemble S(x,y)= 1 n x : P(n) y, désigne le plus grand facteur premier den. Nous étudions , lorsque f est une fonction multiplicative. Quand f=1 et quand f=µ,nous élargissons le domaine d'approximation uniformeenutilisant la méthode développée par Fouvryet Tenenbaum et en explicitant la contribution du zérode Siegel. 1991 Mathematics Subject Classification: 11N25, 11N99.     

On the difference between the number of prime divisors at consecutive integers

Suppose thatg(n) is equal to the number of divisors ofn, counting multiplicity, or the number of divisors ofn, a≠0 is an integer, andN(x,b)=|{n∶n≤x, g(n+a)−g(n)=b orb+1}|. In the paper we prove that sup _b N(x,b)≤C(a)x)(log log 10 _x )^−1/2 and that there exists a constantC(a,μ)>0 such that, given an integerb |b|≤μ(log logx)^1/2,x≥x _o, the inequalityN(x,b)≥C(a,μ)x(log logx(^−1/2) is valid. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 579–595, October, 1999.     

Generalization of Erdős-Kac theorem

Let ω(n) is the number of distinct prime factors of the natural number n,we consider two cases where \ell is even and odd natural numbers, and then we prove a more general form of the classical Erdős-Kac theorem.     

Mean-Value Theorems in Arithmetic Semigroups

This paper reports on recent progress in the theory of multiplicative arithmetic semigroups, which has been initiated by John Knopfmacher's work on abstract analytic number theory. In particular, it deals with abstract versions of the mean-value theorems of Delange, of Wirsing, and of Halász for multiplicative functions on arithmetic semigroups G with Axiom A . The Turán Kubilius inequality is transferred to G , and methods developed by Rényi, Daboussi and Indlekofer, Lucht and Reifenrath are utilized. As byproduct a new proof of the abstract prime number theorem is obtained. This revised version was published online in June 2006 with corrections to the Cover Date.     

The Bateman–Horn conjecture: Heuristic,history, and applications

The Bateman–Horn conjecture is a far-reaching statement about the distribution of the prime numbers. It implies many known results, such as the prime number theorem and the Green–Tao theorem, along with many famous conjectures, such the twin prime conjecture and Landau’s conjecture. We discuss the Bateman–Horn conjecture, its applications, and its origins.     

Romanoff定理的定量形式

1934年,Romanoff证明了能表成2的方幂与一个素数之和形式的正整数在正整数集合中有正的比例．最近,本文作者证明了对充分大的x,能表成2的方幂与一个素数之和形式的正整数在不超过x的正整数中至少有0．0868x个．本文证明了:设 x≥5,则在不超过x的正整数中,能表成2的方幂与一个素数之和的数的个数不少于 0．005x,即给出了Romanoff定理的定量形式．     

Construction of a family of graphs with a small induced proper subgraph with minimum degree 3

We investigate the following question proposed by Erd?s: Is there a constant c such that, for each n, if G is a graph with n vertices, 2n-1edges, andδ(G)?3, then G contains an induced proper subgraph H with at least cn vertices andδ(H)?3?Previously we showed that there exists no such constant c by constructing a family of graphs whose induced proper subgraph with minimum degree 3 contains at most vertices. In this paper we present a construction of a family of graphs whose largest induced proper subgraph with minimum degree 3 is K₄. Also a similar construction of a graph with n vertices and αn+β edges is given.     

关于π(x+y)≤π(x)+π(y)的一些研究结果

§ 1.　Introduction　　Indistributionofprimenumbersthereisamorecommonconjecturethanthatof“twinprimenumbers” :Ifdispelledbycongruencerelation ,thereisanunlimitednumberofprimenumbercon coursesofanygiventype .Forexample ,itisreasonabletobelievethatthereisanunlimitednumberofprimenumberconcoursescomposedofthreeasagroup ( {6k- 1 ,6k + 1 ,6k+ 5 }and {6k+ 1 ,6k+ 5 ,6k+ 7}) ,whichcanbenamedas“threeprimenumbers” .Isthereanunlimitednumberof“n primenumbers”suchas {p +k1 ,p +k2 ,… ,p+kn-1 },whichare…     

The combinatorics of N.G. de Bruijn

In memoriam: N.G. de Bruijn.     

On Locally Repeated Values of Certain Arithmetic Functions,IV

Let (n) denote the number of prime divisors of n and let (n) denote the number of prime power divisors of n. We obtain upper bounds for the lengths of the longest intervals below x where (n), respectively (n), remains constant. Similarly we consider the corresponding problems where the numbers (n), respectively (n), are required to be all different on an interval. We show that the number of solutions g(n) to the equation m+(m)=n is an unbounded function of n, thus answering a question posed in an earlier paper in this series. A principal tool is a Turán-Kubilius type inequality for additive functions on arithmetic progressions with a large modulus.     

Some estimates in theL p metric in the central limit theorem for additive functions

The convergence of the value distributions of a normalized sequence of strongly additive arithmetic functions to the standard normal law in theL _p metric is considered. An asymptotic formula for the variance is obtained. In both cases, the remainders are expressed in terms of the third absolute moment of the additive function. Vilnius University, Naugarduko 24, 2006 Vilnius, Lithuania. Translated from Lietuvos Matematikos Rinkinys, Vol. 39, No. 1, pp. 74–80, January–March, 1999. Translated by A. Mačiulis     

A unified approach to teaching quadratic and cubic equations

A simple method for teaching the algebraic solution of cubic equations is presented. The approach is via ‘completion of the cube’. It is found that this method is readily accepted by students already familiar with completion of the square as a method for quadratic equations. Many people are surprised at how simple the algebraic solution of cubic equations turns out to be. It is not normally necessary to resort to numerical techniques for these equations.     

The Möbius function and the residue theorem

A classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[T] has infinitely many prime values unless there is a local obstruction. Replacing Z[T] with κ[u][T], where κ is a finite field, the obvious analogue of Bouniakowsky's conjecture is false. All known counterexamples can be explained by a new obstruction, and this obstruction can be used to fix the conjecture. The situation is more subtle in characteristic 2 than in odd characteristic. Here, we illustrate the general theory for characteristic 2 in some examples.     

Menger's theorem for infinite graphs with ends

A well‐known conjecture of Erd?s states that given an infinite graph G and sets A, ? V(G), there exists a family of disjoint A ? B paths ?? together with an A ? B separator X consisting of a choice of one vertex from each path in ??. There is a natural extension of this conjecture in which A, B, and X may contain ends as well as vertices. We prove this extension by reducing it to the vertex version, which was recently proved by Aharoni and Berger. © 2005 Wiley Periodicals, Inc. J Graph Theory 50: 199–211, 2005     

Chen’s Conjecture and Its Generalization

Let l1, l2, ..., lg be even integers and x be a sufficiently large number. In this paper, the authors prove that the number of positive odd integers k ≤ x such that （k ＋l1）^2, （k ＋l2）^2, ..., （k ＋lg）^2 can not be expressed as 2^n＋p^α is at least c（g）x, where p is an odd prime and the constant c（g） depends only on g.