Based on prime factorisation in number theory, a new but simple and efficient protection method for access control is proposed. This method has several advantages on performance over previous methods in the literature. Especially, a file I user can be added to or removed from the system without much effort. Excellence of this method is more pronounced for those systems where files are accessibl...

let r be a commutative ring with identity and m be a unitary r-module. let : s(m) −! s(m) [ {;} be a function, where s(m) is the set of submodules ofm. suppose n  2 is a positive integer. a proper submodule p of m is called(n − 1, n) − -prime, if whenever a1, . . . , an−1 2 r and x 2 m and a1 . . . an−1x 2p(p), then there exists i 2 {1, . . . , n − 1} such that a1 . . . ai−1ai+1 . . . an−1x...

the article introduces cyclic dilation groups and finite affine groups for prime integers, and  as an application of this theory it presents a unified group theoretical approach for the  cyclic wavelet transform (cwt) of prime dimensional periodic signals.

the article introduces cyclic dilation groups and finite affine groups for prime integers, and  as an application of this theory it presents a unified group theoretical approach for the  cyclic wavelet transform (cwt) of prime dimensional periodic signals.

Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...

We establish estimates for the number of ways to represent any reduced residue class as a product prime and an integer free small factors. Our best results is conditional on Generalised Riemann hypothesis (GRH). As corollary, we make progress conjecture Erdös, Odlyzko, Sárközy.

A Carmichael number (or absolute pseudo-prime) is a composite positive integer n such that n|an − a for every integer a. It is not difficult to prove that such an integer must be square-free, with at least 3 prime factors. Moreover if the numbers p = 6m + 1, q = 12m + 1 and r = 18m + 1 are all prime, then n = pqr will be a Carmichael number. However it is not currently known whether there are i...