نتایج جستجو برای: prime
تعداد نتایج: 43053 فیلتر نتایج به سال:
This article presents an overview of quantitative methodologies for the study of stage-sequential development based on extensions of Markov chain modeling. Four methods are presented that exemplify the flexibility of this approach: the manifest Markov model, the latent Markov model, latent transition analysis, and the mixture latent Markov model. A special case of the mixture latent Markov mode...
A number p is a safe prime if both p and (p − 1)/2 are prime. This note describes a method of generating safe primes that is considerably faster than repeatedly generating random primes q until p = 2q + 1 is also prime.
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
We call a module M , quasi-catenary if for each pair of quasi-prime submodules K and L of M with K L all saturated chains of quasi-prime submodules of M from K to L have a common finite length. We show that any homomorphic image of a quasi-catenary module is quasi-catenary. We prove that if M is a module with following properties: (i) Every quasi-prime submodule of M has finite quasi-height;...
We study Lebesgue and Atsuji spaces within subsystems of second order arithmetic. The former spaces are those such that every open covering has a Lebesgue number, while the latter are those such that every continuous function defined on them is uniformly continuous. The main results we obtain are the following: the statement “every compact space is Lebesgue” is equivalent to WKL0; the statement...
A k-hypertournament is a complete k-hypergraph with each k-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k-hypertournament, the score si (losing score ri) of a vertex vi is the number of arcs containing vi in which vi is not the last element (in which vi is the last element). The total score of vi is defined as ti = si − ri. In this ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید