Results 21 to 30 of about 769,013 (308)
Generalized prime models [PDF]
Journal of Symbolic Logic, 1971 A prime model O of some complete theory T is a model which can be elementarily imbedded into any model of T (cf. Vaught [7, Introduction]). We are going to replace the assumption that T is complete and that the maps between the models of T are elementary imbeddings (elementary extensions) by more general conditions.
openaire +2 more sources
On generalized homoderivations of prime rings
Matematychni Studii, 2023 Let $\mathscr{A}$ be a ring with its center $\mathscr{Z}(\mathscr{A}).$ An additive mapping $\xi\colon \mathscr{A}\to \mathscr{A}$ is called a homoderivation on $\mathscr{A}$ if $\forall\ a,b\in \mathscr{A}\colon\quad \xi(ab)=\xi(a)\xi(b)+\xi(a)b+a\xi(b).$ An additive map $\psi\colon \mathscr{A}\to \mathscr{A}$ is called a generalized ...
Rehman, N. +2 more
openaire +4 more sources
On the density of some special primes
Journal of Mathematical Cryptology, 2009 We show, under the Generalized Riemann Hypothesis, that a certain set of primes which is of importance for the theory of pseudorandom sequences is of positive relative density. We also use an unconditional result of H.
Friedlander John B., Shparlinski Igor E.
doaj +1 more source
Journal of Mathematical Cryptology, 2013 Abstract. Safe primes and safe RSA moduli are used in several cryptographic schemes. The most common notion is that of a prime p , where is also prime. The latter is then a Sophie Germain prime.
Joachim von zur Gathen +1 more
openaire +3 more sources
Efficient Generation of Prime Numbers [PDF]
, 2000 The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appearing during various cryptographic setups. Surprisingly, despite decades of intense mathematical studies on primality testing and an observed progressive intensification of ...
Joye, Marc +2 more
openaire +2 more sources
A problem related to twin primes [PDF]
, 2008 Using the elementary methods to study a problem related to twin ...
Li, Jianghua
core +1 more source
GENERALIZED LUCAS PRIMES IN THE FERMAT-EULER EQUATION [PDF]
Journal of Algebraic SystemsThe property of having infinitely many prime numbers award these numbers to have many applications in various fields of sciences. One of the most important applications is their use in the creation of many public key cryptosystems' private keys ...
Hayder Hashim
doaj +1 more source
Generalized Derivations of Prime Rings [PDF]
International Journal of Mathematics and Mathematical Sciences, 2007 LetRbe an associative prime ring,Ua Lie ideal such thatu2∈Ufor allu∈U. An additive functionF:R→Ris called a generalized derivation if there exists a derivationd:R→Rsuch thatF(xy)=F(x)y+xd(y)holds for allx,y∈R. In this paper, we prove thatd=0orU⊆Z(R)if any one of the following conditions holds: (1)d(x)∘F(y)=0, (2)[d(x),F(y)=0], (3) eitherd(x)∘F(y)=x ...
openaire +3 more sources
A generalization of prime hyperideals
Journal of Algebraic Systems, 2020 Summary: Let \(R\) be a multiplicative hyperring. In this paper, we introduce and study the concept of \(n\)-absorbing hyperideal which is a generalization of prime hyperideal. A proper hyperideal \(I\) of \(R\) is called an \(n\)-absorbing hyperideal of \(R\) if whenever \(\alpha_1o\ldots o\alpha_{n+1} \subseteq I\) for \(\alpha_1, \ldots, \alpha_{n+1}
openaire +3 more sources
The exceptional set for the number of primes in short intervals [PDF]
, 2000 We investigate the exceptional set Eδ(X, h) associated with the asymptotic formula for the number of primes in short intervals; see Section 1 for the definition.
Perelli, A +6 more
core +1 more source