On a Deterministic Property of the Category of k-almost Primes: A Deterministic Structure Based on a Linear Function for Redefining the k-almost Primes (∃ n∈ \rm N , 1≤ k ≤n) in Certain Intervals

2014/08/06 by Ramin Zahedi, Zahedi, Ramin
Computer Science · Mathematics · #Analytic Number Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Mathematical Dynamics and Fractals #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1408.1888

openalex publication_date 2014/08/06 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

In this paper based on a sort of linear function, a deterministic and simple algorithm with an algebraic structure is presented for calculating all (and only) k-almost primes (where ∃ n∈ \rm N , 1≤ k ≤n) in certain interval. A theorem has been proven showing a new deterministic property of the category of k-almost primes. Through a linear function that we obtain, an equivalent redefinition of the k-almost primes with an algebraic characteristic is identified. Moreover, as an outcome of our function's property some relations which contain new information about the k-almost primes (including primes) are presented.

Citations

• Factorising numbers with a Bose–Einstein condensate
• A function to calculate all relative prime numbers up to the product of\n the first n primes

Related

• A Formula For the Number of k-almost Primes
• On the least almost-prime in arithmetic progression
• Almost primes in various settings
• The primes contain arbitrarily long arithmetic progressions
• Small gaps between almost primes, the parity problem, and some conjectures of Erdos on consecutive integers