The power digraphs of safe primes
Authors
Abstract:
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper, the structure of $G(2q+1,k)$, where $q$ is a Sophie Germain prime is investigated. The primality tests for the integers of the form $n=2q+1$ are established in terms of the structure of components of $G(n,k)$. The digraphs in which all components look like directed star graphs are completely classified. This work generalizes the results of M. Krizekek, L. Somer, Sophie Germain Little Suns, Math. Slovaca 54(5) (2004), 433-442.
similar resources
the power digraphs of safe primes
a power digraph, denoted by $g(n,k)$, is a directed graph with $z_{n}={0,1,..., n-1}$ as the set of vertices and $l={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. in this paper, the structure of $g(2q+1,k)$, where $q$ is a sophie germain prime is investigated. the primality tests for the integers of the form $n=2q+1$ are established in terms of th...
full textanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولPower Totients with Almost Primes
A natural number n is called a k-almost prime if n has precisely k prime factors, counted with multiplicity. For any fixed k > 2, let Fk.X/ be the number of k-th powers m 6 X such that !.n/ D m for some squarefree k-almost prime n, where !. ! / is the Euler function. We show that the lower bound Fk.X/ " X=.log X/ holds, where the implied constant is absolute and the lower bound is uniform over ...
full textOn the uniqueness of the factorization of power digraphs
For each pair of integers n = ∏r i=1 p ei i and k ≥ 2, a digraph G(n, k) is one with vertex set {0, 1, . . . , n − 1} and for which there exists a directed edge from x to y if x ≡ y (mod n). Using the Chinese Remainder Theorem, the digraph G(n, k) can be written as a direct product of digraphs G(pi i , k) for all i such that 1 ≤ i ≤ r. A fundamental constituent GP (n, k), where P ⊆ Q = {p1, p2,...
full textOptimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usable in practical settings, so our protocol is robust and efficient in asynchronous, hostile environments. We show that the techniques used for robustness need special care when they must be efficient. Specifically, we s...
full textthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
My Resources
Journal title
volume 42 issue 3
pages 749- 759
publication date 2016-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023