Results 241 to 250 of about 212,333 (259)
Some of the next articles are maybe not open access.
Prime Ministers' Prime Minister
International Journal, 1961As Edmund Spenser is traditionally spoken of as the poets' poet and as Gustave Flaubert might with equal justice be thought of as the writers' writer, so Mackenzie King may be thought of as the prime ministers1 Prime Minister. In each instance the appeal is less to the public than to the professional be he poet, writer, or politician.
openaire +1 more source
Strongly prime and $$*$$ ∗ -prime crossed products
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, 2015A ring \(R\) is called \textit{(right) strongly prime} (shortly SP) [\textit{D. Handelman} and \textit{J. Lawrence}, Trans. Am. Math. Soc. 211, 209--223 (1975; Zbl 0345.16004)] if \[ \text{for all } r\in R\setminus\{0\}\;\text{ exists a finite subset }X\subseteq R\text{ such that for all } t\in R: rXt=0\Rightarrow t=0. \tag{1} \] Equivalently, \(R\) is
Bohra, Nisha, Joshi, Kanchan
openaire +1 more source
Prime Floor and Prime Ceiling Functions
2022See the abstract in the attached pdf.
openaire +2 more sources
1999
Es handelt sich um einen Vortrag, den der Autor im Mai 1991 vor Studenten der ETH Zürich hielt. Ohne zahlentheoretische Kenntnisse vorauszusetzen, werden zentrale Fragestellungen der Primzahltheorie vorgestellt. Den Primzahlsatz, sowie die Vermutung über die Anzahl der Primzahlzwillinge bzw.
openaire +2 more sources
Es handelt sich um einen Vortrag, den der Autor im Mai 1991 vor Studenten der ETH Zürich hielt. Ohne zahlentheoretische Kenntnisse vorauszusetzen, werden zentrale Fragestellungen der Primzahltheorie vorgestellt. Den Primzahlsatz, sowie die Vermutung über die Anzahl der Primzahlzwillinge bzw.
openaire +2 more sources
Almost Primes of Almost Prime Index
Summary: A positive integer is called a \(k\)-\textit{almost prime} if it is a product of \(k\) prime numbers, counted with repetition. In this paper we consider \(j\)-almost primes of \(k\)-almost prime index for given integers \(j, k \geq 0\). We establish asymptotic estimates for the counting functions, \(n\)th occurrences, and reciprocal sums of ...Kinlaw, Paul +2 more
openaire +2 more sources

