نتایج جستجو برای: gCd

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

An integral domain $D$ is called a emph{locally GCD domain} if $D_{M}$ is aGCD domain for every maximal ideal $M$ of $D$. We study somering-theoretic properties of locally GCD domains. E.g., we show that $%D$ is a locally GCD domain if and only if $aDcap bD$ is locally principalfor all $0neq a,bin D$, and flat overrings of a locally GCD domain arelocally GCD. We also show that the t-class group...

2016
Klaus Pommerening

Euclid’s algorithm gives the greatest common divisor (gcd) of two integers, gcd(a, b) = max{d ∈ Z | d|a, d|b} If for simplicity we define gcd(0, 0) = 0, we have a function gcd : Z× Z −→ N with the following properties: Lemma 1 For any a, b, c, q ∈ Z we have: (i) gcd(a, b) = gcd(b, a). (ii) gcd(a,−b) = gcd(a, b). (iii) gcd(a, 0) = |a|. (iv) gcd(a− qb, b) = gcd(a, b). Proof. Trivial; for (iv) use...

Journal: :Pacific Journal of Mathematics 1974

Journal: :Mathematical and Computational Applications 2004

Journal: :Seizure 2012
Rafael Scarpa da Costa Neves Ivanda de Souza Silva Tudesco Anaclara Prada Jardim Luís Otávio Sales Ferreira Caboclo Carmen Lancellotti Taíssa Ferrari-Marinho Ana Paula Hamad Murilo Marinho Ricardo Silva Centeno Esper Abrão Cavalheiro Carla Alessandra Scorza Elza Márcia Targas Yacubian

PURPOSE We analyzed the association of granule cell dispersion (GCD) with memory performance, clinical data and surgical outcome in a series of patients with mesial temporal lobe epilepsy (MTLE) and mesial temporal sclerosis (MTS). METHOD Hippocampal specimens from 54 patients with MTLE (27 patients with right MTLE and 27 with left MTLE) and unilateral MTS, who were separated into GCD and no-...

نسبت بهره ایزومری 115m,gCd با انجام واکنش در کادمیوم طبیعی با استفاده از فوتون‌های تابش ترمزی با بیشینه انرژی 40، 45، 50، 55، 60، 65، 70 وMeV 75 برای اولین بار اندازه‌گیری شده است. آزمایش‌ها با روش طیف‌سنجی غیر بر خط پرتو گاما با استفاده از شتابدهنده خطی الکترون MeV 100 در آزمایشگاه شتابدهنده شهرپوهانگ (PAL) در کشور کره جنوبی انجام گردید. هم‌چنین نسبت بهره ایزومری115m,gCd با استفاده از کد 1.6 T...

2014
Hongyan YU

In this paper we discuss two partially ordered sets and give a connection between max-min identity and GCD-LCM one.

2003
Jonathan P. Sorenson

In this paper we analyze a slight modification of Jebelean’s version of the k-ary GCD algorithm. Jebelean had shown that on n-bit inputs, the algorithm runs in O(n) time. In this paper, we show that the average running time of our modified algorithm is O(n/ logn). This analysis involves exploring the behavior of spurious factors introduced during the main loop of the algorithm. We also introduc...

Journal: :Journal of Complexity 1985

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

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