# Almost-prime values of reducible polynomials at prime arguments

## TL;DR

This paper extends sieve methods to analyze almost-prime values of reducible polynomials at prime inputs, generalizing prior work on single irreducible polynomials and providing new insights into their prime-related behavior.

## Contribution

It introduces a generalized approach using Irving's sieve to study reducible polynomials at prime arguments, broadening the scope of previous results.

## Key findings

- Established bounds on almost-prime values of reducible polynomials at prime inputs
- Extended Irving's sieve method to a broader class of polynomials
- Generalized prior results on irreducible polynomials to reducible cases

## Abstract

We adopt A. J. Irving's sieve method to study the almost-prime values produced by products of irreducible polynomials evaluated at prime arguments. This generalizes the previous results of Irving and Kao, who separately examined the almost-prime values of a single irreducible polynomial evaluated at prime arguments.