Positive proportion of short intervals containing a prescribed number of primes

We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap \mathbb{P}|=m\rbrace|\gg_{m,\lambda} x.$$ The value of $\varepsilon(m)$ and the implicit constant on $\lambda$ and $m$ may be made explicit. This is an improvement of an author's previous result. Moreover, we will show that a careful investigation of the proof, apart from some slight changes, can lead to analogous estimates when considering the parameters $m$ and $\lambda$ to vary as functions of $x$ or restricting the primes to belong to specific subsets.Comment: 7 page

On numbers n with polynomial image coprime with the nth term of a linear recurrence

Let F be an integral linear recurrence, G be an integer-valued polynomial splitting over the rationals, and h be a positive integer. Also, let AF,G,h be the set of all natural numbers n such that gcd(F(n), G(n)) = h. We prove that AF,G,h has a natural density. Moreover, assuming F is non-degenerate and G has no fixed divisors, we show that d(AF,G,1) = 0 if and only if AF,G,1 is finite