The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 81 – 100 of 164

Showing per page

On the least almost-prime in arithmetic progression

Jinjiang Li, Min Zhang, Yingchun Cai (2023)

Czechoslovak Mathematical Journal

Let 𝒫 r denote an almost-prime with at most r prime factors, counted according to multiplicity. Suppose that a and q are positive integers satisfying ( a , q ) = 1 . Denote by 𝒫 2 ( a , q ) the least almost-prime 𝒫 2 which satisfies 𝒫 2 a ( mod q ) . It is proved that for sufficiently large q , there holds 𝒫 2 ( a , q ) q 1 . 8345 . This result constitutes an improvement upon that of Iwaniec (1982), who obtained the same conclusion, but for the range 1 . 845 in place of 1 . 8345 .

On the least almost-prime in arithmetic progressions

Liuying Wu (2024)

Czechoslovak Mathematical Journal

Let 𝒫 2 denote a positive integer with at most 2 prime factors, counted according to multiplicity. For integers a , q such that ( a , q ) = 1 , let 𝒫 2 ( q , a ) denote the least 𝒫 2 in the arithmetic progression { n q + a } n = 1 . It is proved that for sufficiently large q , we have 𝒫 2 ( q , a ) q 1 . 825 . This result constitutes an improvement upon that of J. Li, M. Zhang and Y. Cai (2023), who obtained 𝒫 2 ( q , a ) q 1 . 8345 .

On the range of Carmichael's universal-exponent function

Florian Luca, Carl Pomerance (2014)

Acta Arithmetica

Let λ denote Carmichael’s function, so λ(n) is the universal exponent for the multiplicative group modulo n. It is closely related to Euler’s φ-function, but we show here that the image of λ is much denser than the image of φ. In particular the number of λ-values to x exceeds x / ( l o g x ) . 36 for all large x, while for φ it is equal to x / ( l o g x ) 1 + o ( 1 ) , an old result of Erdős. We also improve on an earlier result of the first author and Friedlander giving an upper bound for the distribution of λ-values.

Currently displaying 81 – 100 of 164