نتایج جستجو برای: Prime divisor

تعداد نتایج: 46114  

Journal: :Proceedings of the American Mathematical Society 1973

Let $R$ be a commutative ring and $I$ an ideal of $R$. The zero-divisor graph of $R$ with respect to $I$, denoted by $Gamma_I(R)$, is the simple graph whose vertex set is ${x in Rsetminus I mid xy in I$, for some $y in Rsetminus I}$, with two distinct vertices $x$ and $y$ are adjacent if and only if $xy in I$. In this paper, we state a relation between zero-divisor graph of $R$ with respec...

Journal: :international journal of group theory 2015
alan camina rachel camina

a finite group $g$ satisfies the on-prime power hypothesis for conjugacy class sizes if any two conjugacy class sizes $m$ and $n$ are either equal or have a common divisor a prime power. taeri conjectured that an insoluble group satisfying this condition is isomorphic to $s times a$ where $a$ is abelian and $s cong psl_2(q)$ for $q in {4,8}$. we confirm this conjecture.

2012
Kevin Doerksen Anna Haensch

Let (bn) = (b1, b2, . . . ) be a sequence of integers. A primitive prime divisor of a term bk is a prime which divides bk but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial φ(z) is a sequence of integers (cn) where the n-th term is the n-th iterate of φ at 0. We consider primitive prime divisors of zero orbits of polynomials. In this note, we show that f...

Journal: :Japanese journal of mathematics :transactions and abstracts 1951

2007
N. Saradha

n(n + d) . . . (n + (k − 1)d) = by (1.1) in positive integers n, k ≥ 2, d > 1, b, y, l ≥ 3 with l prime, gcd(n, d) = 1 and P (b) ≤ k. We write d = D1D2 (1.2) where D1 is the maximal divisor of d such that all prime divisors of D1 are congruent to 1 ( mod l). Thus D1 and D2 are relatively prime positive integers such that D2 has no prime divisor which is congruent to 1 (mod l). Shorey [Sh88] pro...

2014
H. Y. Pourali V. V. Joshi B. N. Waphare

In this paper, we verify the diameter of zero divisor graphs with respect to direct product. Keywords—Atomic lattice, complement of graph, diameter, direct product of lattices, 0-distributive lattice, girth, product of graphs, prime ideal, zero divisor graph.

2014
Hamid-Reza Ahmadi Ali Afzali-Kusha Massoud Pedram Mahdi Mosaffa

prime-field hyperelliptic-curve cryptography (HECC) processor with uniform power draw. The HECC processor performs divisor scalar multiplication on the Jacobian of genus 2 hyperelliptic curves defined over prime fields for arbitrary field and curve parameters. It supports the most frequent case of divisor doubling and addition. The optimized implementation, which is synthesized in a 0.13 mm sta...

Journal: :Des. Codes Cryptography 2016
Fabio Enrique Brochero Martínez Carmen Rosa Giraldo Vergara

In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length n over a finite field Fq, in the case which each prime divisor of n is also a divisor of q − 1.

2008
Moshe Jarden

When we speak about a function field of one variable over a field K, we mean a finitely generated regular extension F of K of transcendence degree 1. We briefly recall the definitions of the main objects attached to F/K and their properties. See the books [Che51] or [Sti93] for details. A more comprehensive survey can be found [FrJ08, Sections 3.1-3.2]. A K-place of F is a place φ: F → K̃ ∪ {∞} ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید