✦ LIBER ✦

Some new results on k-free numbers

✍ Scribed by Zaizhao Meng

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 169 KB
Volume: 121
Category: Article
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2006.01.010

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we obtain an improved asymptotic formula on the frequency of k-free numbers with a given difference. We also give a new upper bound of Barban-Davenport-Halberstam type for the k-free numbers in arithmetic progressions.

📜 SIMILAR VOLUMES

On Gaps Between k-Free Numbers

✍ O. Trifonov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 337 KB

An elementary proof is given that for \(k \geqslant 3\) there exists a constant \(c=c(k)\) such that for \(x\) sufficiently large (depending on \(k\) ), the interval \(\left(x, x+c x^{1,12 k+1} \log x\right.\) ] contains a \(k\)-free number. This result improves on a previous result of M. Filaseta (

Some results on the achromatic number

✍ Cairnie, Niall; Edwards, Keith 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ( k 2 ) ≤ m. We show that the problem of dete

An elementary approach to short interval

An elementary approach to short interval results for k-free numbers

✍ Michael Filaseta 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 701 KB

Some results on Ramsey numbers using sum

Some results on Ramsey numbers using sumfree sets

✍ Samira Y. Kettoola; J.D. Roberts 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Some new results on neural network appro

Some new results on neural network approximation

✍ K. Hornik 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 346 KB

We show that standardfeedforward networks with asl ew as a single hidden layer can uniformly approximate continuousfunctions on compacta provided that the activation function if; is locally R iemann integrable and nonpolynomial, and have universal LP(Jl) approximation capabilities for finite and com

New results on rectilinear crossing numb

New results on rectilinear crossing numbers and plane embeddings

✍ Daniel Bienstock; Nathaniel Dean 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 561 KB

## Abstract We show that if a graph has maximum degree __d__ and crossing number __k__, its rectilinear crossing number is at most __O__(__dk__^2^). Hence for graphs of bounded degree, the crossing number and the rectilinear crossing number are bounded as functions of one another. We also obtain a