Skip to content

The number of shifted almost-primes with smooth values

Oct 2026 · International Journal of Number Theory · 0 citations

Abstract

Let [Formula: see text] and [Formula: see text] denote the largest and smallest prime factors of [Formula: see text], respectively. Let [Formula: see text], [Formula: see text]. For sufficiently large [Formula: see text], we show that there exists a strictly positive constant [Formula: see text] such that [Formula: see text] where [Formula: see text], [Formula: see text] and [Formula: see text] is fixed, which improves the previous result of Lü-Wang-Chen (2019) with [Formula: see text]. Let [Formula: see text] denote an almost-prime with at most [Formula: see text] prime factors, counted according to multiplicity. In particular, we prove that the pattern [Formula: see text] is realized by a positive proportion of [Formula: see text], for [Formula: see text] and [Formula: see text], which also improves an implicit result of Lü-Wang-Chen (2019) by replacing [Formula: see text] with [Formula: see text].

View source

Similar papers

Oct 2026

On Sum of Two Piatetski-Shapiro Primes and a Prime with Restricted Digits

Let [Formula: see text] and [Formula: see text], [Formula: see text]. Let also [Formula: see text]. We prove that every sufficiently large odd integer [Formula: see text] can be represented in the form [Formula: see text] where [Formula: see text] for [Formula: see text], [Formula: see text] for [Formula: see text] an...

Chen Huang · 0 citations
Oct 2026

Perfect codes in t -Cayley graphs

Let [Formula: see text] be a finite group and [Formula: see text]. Let [Formula: see text] be a collection of subsets of [Formula: see text] such that [Formula: see text] is non-empty, [Formula: see text] and [Formula: see text] for all [Formula: see text]. The t-Cayley graph of G associated with [Formula: see text], [...

Kantapong Wannatong, Yotsanan Meemark · 0 citations
Sep 2026

Amalgamated Rings with r -Clean Properties

Let [Formula: see text] be a ring with identity. An element [Formula: see text] is called [Formula: see text]-clean if it can be written as the sum of an idempotent and a von Neumann regular element of [Formula: see text]; the ring [Formula: see text] is said to be [Formula: see text]-clean if every element of [Formula...

Dian Ariesta Yuwaningsih, Hwankoo Kim, I. E. Wijayanti et al. · 0 citations
Oct 2026

On real elements and CSS -subgroups of finite groups

An element [Formula: see text] of a finite group [Formula: see text] is called a real element provided that there exists [Formula: see text] such that [Formula: see text]. A subgroup [Formula: see text] of [Formula: see text] is called a [Formula: see text]-subgroup of [Formula: see text] provided that there is a norma...

Jia-Wen He, H. Wei, Chang-Man Sun et al. · 0 citations
Oct 2026

On <i>n</i> -exact substructures

Let [Formula: see text] be an [Formula: see text]-exact category and [Formula: see text] an additive subcategory of [Formula: see text]. Let [Formula: see text] be the class of [Formula: see text]-admissible [Formula: see text]-exact sequences whose exactness is preserved by [Formula: see text] for every [Formula: see...

Yu-Tong Zhou, Xian-Hui Fu · 0 citations
Oct 2026

Characterization of some solvable groups by the number of average orders of subgroups

Let [Formula: see text] be a finite group and let [Formula: see text], the average order of its elements. Let [Formula: see text] be the set of average orders of all subgroups of [Formula: see text]. We show that if [Formula: see text] is a finite solvable group with at least three distinct prime divisors, then [Formul...

B. Taeri · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.