首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let θ(k, p) be the least s such that the congruence x1k + … + xsk ≡ 0(mod p) has a nontrivial solution. Let θ(k) = {max θ(k, p)| p > 1 + 2k}. The purpose of this note is to prove the following conjecture of S. Chowla: θ(k) = O(k12+?).  相似文献   

2.
In two party elections with popular vote ratio pq, 12≤p=1 ?q, a theoretical model suggests replacing the so-called MacMahon cube law approximation (pq)3, for the ratio PQ of candidates elected, by the ratio ?k(p)?k(q) of the two half sums in the binomial expansion of (p+q)2k+1 for some k. This ratio is nearly (pq)3 when k = 6. The success probability gk(p)=(pa(pa+qa) for the power law (pq)a?PQ is shown to so closely approximate ?k(p)=Σ0k(r2k+1)p2k+1?rqr, if we choose a = ak=(2k+1)!4kk!k!, that 1≤?k(p)gk(p)≤1.01884086 for k≥1 if12≤p≤1. Computationally, we avoid large binomial coefficients in computing ?k(p) for k>22 by expressing 2?k(p)?1 as the sum (p?q) Σ0k(4pq)sas(2s+1), whose terms decrease by the factors (4pq)(1?12s). Setting K = 4k+3, we compute ak for the large k using a continued fraction πak2=K+12(2K+32(2K+52(2K+…))) derived from the ratio of π to the finite Wallis product approximation.  相似文献   

3.
An elementary proof is given of the author's transformation formula for the Lambert series Gp(x) = Σn?1 n?pxn(1?xn) relating Gp(e2πiτ) to Gp(e2πiAτ), where p > 1 is an odd integer and Aτ = (aτ + b)(cτ + d) is a general modular substitution. The method extends Sczech's argument for treating Dedekind's function log η(τ) = πiτ12 ? G1(e2πiτ), and uses Carlitz's formula expressing generalized Dedekind sums in terms of Eulerian functions.  相似文献   

4.
Let
F(x) = k=onnkAkxk
An ≠ 0,
and
G(x) = k=onnkBkxk
Bn ≠ 0,
be polynomials with real zeros satisfying An?1 = Bn?1 = 0, and let
H(x) = k=on-2nkAkBkxk.
Using the recently proved validity of the van der Waerden conjecture on permanents, some results on the real zeros of H(x) are obtained. These results are related to classical results on composite polynomials.  相似文献   

5.
Let k be an odd positive integer. Davenport and Lewis have shown that the equations
a1x1k+…+anxnk=0
with integer coefficients, have a nontrivial solution in integers x1,…, xN provided that
N?[36klog6k]
Here it is shown that for any ? > 0 and k > k0(?) the equations have a nontrivial solution provided that
N?8log 2+?k log k.
  相似文献   

6.
Let k and r be fixed integers such that 1 < r < k. Any positive integer n of the form n = akb, where b is r-free, is called a (k, r)-integer. In this paper we prove that if Qk,r(x) denotes the number of (k, r)-integers ≤ x, then Qk,r(x) = xζ(k)ζ(r) + Δk,r(x), where Δk,r(x) = O(x1rexp [?Blog35x (log log x)?15]), B being a positive constant depending on r and the O-estimate is uniform in k. On the assumption of the Riemann hypothesis, we improve the above order estimate of Δk,r(x) and prove that
1x1αδk,r(t)dt=0(x1kω(x))or0(x3/(4r+1)ω(x))
, according as k ≤ (4r + 1)3 or k > (4r + 1)3, where ω(x) = exp [B log x(log log x)?1].  相似文献   

7.
Real constant coefficient nth order elliptic operators, Q, which generate strongly continuous semigroups on L2(Rk) are analyzed in terms of the elementary generator,
A = (?n)(n2 ? 1)(n!)?1kj = 1?n?xjn
, for n even. Integral operators are defined using the fundamental solutions pn(x, t) to ut = Au and using real polynomials ql,…, qk on Rm by the formula, for q = (ql,…, qk),
(F(t)?)(x) = ∫
Rm
?(x + q(z)) Pn(z, t)dz
. It is determined when, strongly on L2(Rk),
etQ = limj → ∞ Ftjj
. If n = 2 or k = 1, this can always be done. Otherwise the symbol of Q must have a special form.  相似文献   

8.
Author index     
A matrix T=(tik) is introduced, the coefficients of which are defined by kik:= (ik(ik)!)Σx?Snai(x)k, i, k?N={1, 2, 3,…,}, where ai(x) denotes the s the number of i cycles in the element x of the symmetric group Sn. It is shown that these numbers are natural numbers, that they are easy to evaluate, and that they serve very well in order to formulate an infinite number of characterizations of multiply transitive subgroups of symmetric groups in terms of the cycle structure of their elements.  相似文献   

9.
For a(1) ? a(2) ? ··· ? a(n) ? 0, b(1) ? b(2) ? ··· ? b(n) ? 0, the ordered values of ai, bi, i = 1, 2,…, n, m fixed, m ? n, and p ? 1 it is shown that
1naibi ? 1map(i)1p1m?k?1 bq(i)+bq[m?k](k+1)qp1q
where 1p + 1q = 1, b[j] = b(j) + b(j + 1) + ··· + b(n), and k is the integer such that b(m ? k ? 1) ? b[m ? k](k + 1) and b(m ? k) < b[m ? k + 1]k. The inequality is shown to be sharp. When p < 1 and a(i)'s are in increasing order then the inequality is reversed.  相似文献   

10.
It is shown that if A?Ωn?{Jn} satisfies
nkσk(A)?(n?k+1)2 σk?1(A)
(k=1,2,…,n)
, where σk(A) denotes the sum of all kth order subpermanent of A, then Per[λJn+(1?λ)A] is strictly decreasing in the interval 0<λ<1.  相似文献   

11.
12.
Upper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ? 3, R(k, x) < ckxk ? 1(ln x)k ? 2 asymptotically in x.  相似文献   

13.
The absolute Kähler module Ωwn(k) of the truncated generalized Witt vectors of a field k of positive characteristic is zero if and only if k is perfect. This recovers known information on K2(k[t](tn)) with which the structure of K2(k((t))) can be studied.  相似文献   

14.
Two models for computer system overhead are developed by considering the number of jobs in the system as an immigration-death process. The models developed relate the death rates to the state of the process. The first model uses the total numver of jobs in the system as the state of the processe. The second model classifies the jobs in the system according to the priority classes unsed in the computer system.In the model based on the total number of jobs in the system, the death rate when the system is in the state i, μi, is μi = μ min(i, x0) where μ and x0 are parameters to be estimated by maximum likelihood. In the second model, the death rate for jobs in the kth priority class when the state of the system is i = (i1…,ip), μi(k) is given by μi(k)(k)ikmin(1, x0i·1). Computational difficulties in finding the maximum likelihood estimates of the parameters for this model are noted.  相似文献   

15.
Given a set S of positive integers let ZkS(t) denote the number of k-tuples 〈m1, …, mk〉 for which mi ∈ S ? [1, t] and (m1, …, mk) = 1. Also let PkS(n) denote the probability that k integers, chosen at random from S ? [1, n], are relatively prime. It is shown that if P = {p1, …, pr} is a finite set of primes and S = {m : (m, p1pr) = 1}, then ZkS(t) = (td(S))k Πν?P(1 ? 1pk) + O(tk?1) if k ≥ 3 and Z2S(t) = (td(S))2 Πp?P(1 ? 1p2) + O(t log t) where d(S) denotes the natural density of S. From this result it follows immediately that PkS(n) → Πp?P(1 ? 1pk) = (ζ(k))?1 Πp∈P(1 ? 1pk)?1 as n → ∞. This result generalizes an earlier result of the author's where P = ? and S is then the whole set of positive integers. It is also shown that if S = {p1x1prxr : xi = 0, 1, 2,…}, then PkS(n) → 0 as n → ∞.  相似文献   

16.
Series of the form Σk = 1(2k2k)?1 k?n may be expressed as log sin integrals and are shown to be summable exactly in terms of Dirichlets L-series for values of n up to and including 5. Other related series are also discussed and several exact results are given.  相似文献   

17.
The condition Σk<xn<x(χ(n) ? z)4Ω(n)n| = o(√logx), where Ω(n) stands for the number of prime factors, counted according to multiplicity, of the positive integer n, is shown to be necessary and sufficient for the integer sequence with characteristic function χ to have divisor density z, i.e., Σd|nχ(d) = (z + o(1)) Σd|n 1 when n → ∞ if one neglects a sequence of asymptotic density zero. Among the applications, the following result, first conjectured by R. R. Hall, is proved: given any positive α, we have, for almost all n's, and uniformly with respect to z in |0, 1|,
card {d:d|n, (log d)α < z (mod 1)}=(z+o(1)) d|n1.
  相似文献   

18.
Let θ(k, pn) be the least s such that the congruence x1k + ? + xsk ≡ 0 (mod pn) has a nontrivial solution. It is shown that if k is sufficiently large and divisible by p but not by p ? 1, then θ(k, pn) ≤ k12. We also obtain the average order of θ(k), the least s such that the above congruence has a nontrivial solution for every prime p and every positive integer n.  相似文献   

19.
Let Sp×p ~ Wishart (Σ, k), Σ unknown, k > p + 1. Minimax estimators of Σ?1 are given for L1, an Empirical Bayes loss function; and L2, a standard loss function (RiE(LiΣ), i = 1, 2). The estimators are Σ??1 = aS?1 + br(S)Ip×p, a, b ≥ 0, r(·) a functional on Rp(p+2)2. Stein, Efron, and Morris studied the special cases Σa?1 = aS?1 (EΣ?k?p?1?1 = Σ?1) and Σ?1?1 = aS?1 + (b/tr S)I, for certain, a, b. From their work R1?1, Σ?1?1; S) ≤ R1?1, Σ?a?1; S) (?Σ), a = k ? p ? 1, b = p2 + p ? 2; whereas, we prove R2?1Σ?a?1; S) ≤ R2?1, Σ?1?1; S) (?Σ). The reversal is surprising because L1?1, Σ?1?1; S) → L2?1, Σ?1?1; S) a.e. (for a particular L2). Assume R (compact) ? S, S the set of p × p p.s.d. matrices. A “divergence theorem” on functions Fp×p : RS implies identities for Ri, i = 1, 2. Then, conditions are given for Ri?1, Σ??1; S) ≤ Ri?1, Σ?1?1; S) ≤ Ri?1, Σ?a?1; S) (?Σ), i = 1, 2. Most of our results concern estimators with r(S) = t(U)/tr(S), U = p ∣S1/p/tr(S).  相似文献   

20.
Asymptotic results are obtained for pA(k)(n), the kth difference of the function pA(n) which is the number of partitions of n into integers from A. Under certain restrictions on A it is shown that
PA(k+1)(n)PA(k)(n) = O(n?1/2) (n→ ∫)
thereby verifying for these A a conjecture of Bateman and Erdös.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号