نتایج جستجو برای: 1 changes p

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

Journal: :Combinatorics, Probability & Computing 2005
Vladimir Nikiforov

In 1978 Erdős, Faudree, Rousseau, and Schelp conjectured that r (Cp, Kr) = (p − 1) (r − 1) + 1. for every p ≥ r ≥ 3, except for p = q = 3. This has been proved for r ≤ 6, and for p ≥ r 2 − 2r. In this note we prove the conjecture for p ≥ 4r + 2.

2009
Mehrdad Pourayoubi Saied Ghadimi Ali Asghar Ebrahimi Valmoozi Ali Reza Banan

In the title compound, C(21)H(23)N(2)O(2)P, the P atom exhibits tetra-hedral coordination; the P-N bond lengths are relatively short [1.6297 (13) and 1.6424 (13) Å]. In the crystal, adjacent mol-ecules are linked by N-H⋯O hydrogen bonds into a zigzag chain running along the c axis.

Journal: :Math. Comput. 2014
Edgar Costa Robert Gerbicz David Harvey

A Wilson prime is a prime p such that (p − 1)! = −1 (mod p). We report on a search for Wilson primes up to 2 × 10, and describe several new algorithms that were used in the search. In particular we give the first known algorithm that computes (p − 1)! (mod p) in average polynomial time per prime.

Journal: :Discussiones Mathematicae Graph Theory 2008
Beata Orchel A. Pawel Wojda

Bipartite graphs G = (L, R; E) and H = (L, R; E) are bi-placeabe if there is a bijection f : L ∪ R → L ∪ R such that f(L) = L and f(u)f(v) / ∈ E for every edge uv ∈ E. We prove that if G and H are two bipartite balanced graphs of order |G| = |H | = 2p ≥ 4 such that the sizes of G and H satisfy ‖ G ‖≤ 2p− 3 and ‖ H ‖≤ 2p− 2, and the maximum degree of H is at most 2, then G and H are bi-placeable...

2005
Martin Zigler

We exhibit a simplified version of the construction of a field of Morley rank p with a predicate of rank p − 1, extracting the main ideas for the construction from previous papers and refining the arguments. Moreover, an explicit axiomatization is given, and ranks are computed.

Journal: :Applied Mathematics and Computation 2005
K. L. Boey Patricia J. Y. Wong

We offer criteria for the existence of positive solutions for two-point right focal eigenvalue problems (−1) n−p y Δ n (t) = λ f (t, y(σ n−1 (t)), y Δ (σ n−2 (t)),..., y Δ p−1 (σ n−p (t))), t ∈ [0,1] ∩ T, y Δ i (0) = 0, 0 ≤ i ≤ p − 1, y Δ i (σ(1)) = 0, p ≤ i ≤ n − 1, where λ > 0, n ≥ 2,1 ≤ p ≤ n − 1 are fixed and T is a time scale.

Journal: :Journal of Alzheimer's disease : JAD 2011
Olivia Belbin Kristelle Brown Hui Shi Christopher Medway Richard Abraham Peter Passmore David Mann A David Smith Clive Holmes Bernadette McGuinness David Craig Donald Warden Reinhard Heun Heike Kölsch Seth Love Noor Kalsheker Julie Williams Michael J Owen Minerva Carrasquillo Steven Younkin Kevin Morgan Patrick G Kehoe

A key pathological feature of late-onset Alzheimer's disease (LOAD) is the abnormal extracellular accumulation of the amyloid-β (Aβ) peptide. Thus, altered Aβ degradation could be a major contributor to the development of LOAD. Variants in the gene encoding the Aβ-degrading enzyme, angiotensin-1 converting enzyme (ACE) therefore represent plausible candidates for association with LOAD pathology...

2009
Hongjian Xi Taixiang Sun Weiyong Yu Jinfeng Zhao

We study the boundedness of the difference equation xn 1 pxn qxn−1 / 1 xn , n 0, 1, . . . , where q > 1 p > 1 and the initial values x−1, x0 ∈ 0, ∞ . We show that the solution {xn}n −1 of this equation converges to x q p − 1 if xn ≥ x or xn ≤ x for all n ≥ −1; otherwise {xn}n −1 is unbounded. Besides, we obtain the set of all initial values x−1, x0 ∈ 0, ∞ × 0, ∞ such that the positive solutions...

2008
László Erdős Benjamin Schlein

We consider N × N Hermitian random matrices with i.i.d. entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order 1/N . We study the connection between eigenvalue statistics on microscopic energy scales η ≪ 1 and (de)localization properties of the eigenvectors. Under suitable assumptions on the distribution of the single matrix elements, we first ...

Journal: :Math. Comput. 2005
Gilbert Harman

Let p denote a prime. In this article we provide the first published lower bounds for the greatest prime factor of p−1 exceeding (p−1) 1 2 in which the constants are effectively computable. As a result we prove that it is possible to calculate a value x0 such that for every x > x0 there is a p < x with the greatest prime factor of p − 1 exceeding x 3 5 . The novelty of our approach is the avoid...

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

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