首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 562 毫秒
1.
It is proved that for any given positive integers N and k the number of integers n < N for which the equation 4n = 1x + 1y + 1z is unsolvable in positive integers x, y, z is not greater than cN(log N)k, where c is a constant depending only on k.  相似文献   

2.
The probability measure of X = (x0,…, xr), where x0,…, xr are independent isotropic random points in Rn (1 ≤ rn ? 1) with absolutely continuous distributions is, for a certain class of distributions of X, expressed as a product measure involving as factors the joint probability measure of (ω, ?), the probability measure of p, and the probability measure of Y1 = (y01,…, yr1). Here ω is the r-subspace parallel to the r-flat η determined by X, ? is a unit vector in ω with ‘initial’ point at the origin [ω is the (n ? r)-subspace orthocomplementary to ω], p is the norm of the vector z from the origin to the orthogonal projection of the origin on η, and yi1 = (xi ? z)α(p2), where α is a scale factor determined by p. The probability measure for ω is the unique probability measure on the Grassmann manifold of r-subspaces in Rn invariant under the group of rotations in Rn, while the conditional probability measure of ? given ω is uniform on the boundary of the unit (n ? r)-ball in ω with centre at the origin. The decomposition allows the evaluation of the moments, for a suitable class of distributions of X, of the r-volume of the simplicial convex hull of {x0,…, xr} for 1 ≤ rn.  相似文献   

3.
Let A(x,ε) be an n×n matrix function holomorphic for |x|?x0, 0<ε?ε0, and possessing, uniformly in x, an asymptotic expansion A(x,ε)?Σr=0Ar(x) εr, as ε→0+. An invertible, holomorphic matrix function P(x,ε) with an asymptotic expansion P(x,ε)?Σr=0Pr(x)εr, as ε→0+, is constructed, such that the transformation y = P(x,ε)z takes the differential equation εhdydx = A(x,ε)y,h a positive integer, into εhdzdx = B(x,ε)z, where B(x,ε) is asymptotically equal, to all orders, to a matrix in a canonical form for holomorphic matrices due to V.I. Arnold.  相似文献   

4.
If r, k are positive integers, then Tkr(n) denotes the number of k-tuples of positive integers (x1, x2, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r = 1. An explicit formula for Tkr(n) is derived and it is shown that limn→∞Tkr(n)nk = 1ζ(rk).If S = {p1, p2, …, pa} is a finite set of primes, then 〈S〉 = {p1a1p2a2psas; piS and ai ≥ 0 for all i} and Tkr(S, n) denotes the number of k-tuples (x1, x3, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r ∈ 〈S〉. Asymptotic formulas for Tkr(S, n) are derived and it is shown that limn→∞Tkr(S, n)nk = (p1 … pa)rkζ(rk)(p1rk ? 1) … (psrk ? 1).  相似文献   

5.
The system ?x?t = Δx + F(x,y), ?y?t = G(x,y) is investigated, where x and y are scalar functions of time (t ? 0), and n space variables 1,…, ξn), Δx ≡ ∑i = 1n?2xi2, and F and G are nonlinear functions. Under certain hypotheses on F and G it is proved that there exists a unique spherically symmetric solution (x(r),y(r)), where r = (ξ12 + … + ξn2)12, which is bounded for r ? 0 and satisfies x(0) >x0, y(0) > y0, x′(0) = 0, y′(0) = 0, and x′ < 0, y′ > 0, ?r > 0. Thus, (x(r), y(r)) represents a time independent equilibrium solution of the system. Further, the linearization of the system restricted to spherically symmetric solutions, around (x(r), y(r)), has a unique positive eigenvalue. This is in contrast to the case n = 1 (i.e., one space dimension) in which zero is an eigenvalue. The uniqueness of the positive eigenvalue is used in the proof that the spherically symmetric solution described is unique.  相似文献   

6.
In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z1…,zn), zi ? C, i=1, …, n, is uniquely determined from the magnitude of f(x1…,xn): | f(x1…,xn)|, xi ? R, i=1,…, n, except for (1) linear shifts: i(α1z1+…+αn2n+β), β, αi?R, i=1,…, n; and (2) conjugation: f1(z11,…,zn1).  相似文献   

7.
In this paper we study the linked nonlinear multiparameter system
yrn(Xr) + MrYr + s=1k λs(ars(Xr) + Prs) Yr(Xr) = 0, r = l,…, k
, where xr? [ar, br], yr is subject to Sturm-Liouville boundary conditions, and the continuous functions ars satisfy ¦ A ¦ (x) = detars(xr) > 0. Conditions on the polynomial operators Mr, Prs are produced which guarantee a sequence of eigenfunctions for this problem yn(x) = Πr=1kyrn(xr), n ? 1, which form a basis in L2([a, b], ¦ A ¦). Here [a, b] = [a1, b1 × … × [ak, bk].  相似文献   

8.
A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, Im(x, y) denotes
χyχv2?χv2i=1mF(νi)dν12?dνm
, and Am(x, y) denotes an approximation of Im(x, y) of the form
(y?x)mk=1naki=1mF(χik)
, where ak and yik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and xik = x + (y ? x)yik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F(1) exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, (b ? a)n = h < 1, xi = a + hi for i = 0, 1,…, n and 0 < r ? s ? n, then
χr?χs(I+F dχ)?i=rsI+j=1pIji?1i)
=hpH(χr?1s)+O(hp+1)
Further, if F(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when Aj is substituted for Ij.  相似文献   

9.
It is shown that the coefficients an of the power series f(z) = ∑n=1anzn which satisfies the functional equation
f(z)=z+f(z2+z3)
display periodic oscillations; an ~ (ønn) u(logn as n → ∞, where ø = (1 + 512)2 and u(x) is a positive, nonconstant, continuous function which is periodic with period log(4 ? ø). Similar results are obtained for a wide class of power series that satisfy similar functional equations. Power series of these types are of interest in combinatorics and computer science since they often represent generating functions. For example, the nth coefficient of the power series satisfying (1) enumerates 2, 3-trees with n leaves.  相似文献   

10.
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].  相似文献   

11.
As an extension of the Dirichlet divisor problem, S. Chowla and H. Walum conjectured that, as x → ∞, Σn ≤ √x naBr({xn}) = O(xa2 + 14 + ε) holds for each ε > 0. Here integers a ≥ 0 and r ≥ 1 are given. Br(x) denotes the rth Bernoulli polynomial and {x} denotes the fractional part of x. The special case a = 0, r = 2 of this conjecture was also mentioned by S. Chowla. In this paper we prove this conjecture for all e ≥ 12 and r ≥ 2 with ε = 0 (with xε replaced by log x in case a = 12).  相似文献   

12.
13.
Necessary and sufficient conditions for representing certain classes of primes by given quadratic forms are found by generalizing techniques of rational number theory. The main result is that if m = 5 or 13, and if p is a rational prime such that (?1p) = 1 = (mp), then a necessary and sufficient condition that x2 + 4my2 = p for some rational integers x and y is that [?mp] = 1, where ?m denotes the fundamental unit of the field Q(m12) and [/] denotes the Legendre symbol of the ring of integers of Q(m12) with p a prime ideal divisor of p in Q(m12).  相似文献   

14.
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 → ∞.  相似文献   

15.
Let A be an n × n matrix; write A = H+iK, where i2=—1 and H and K are Hermitian. Let f(x,y,z) = det(zI?xH?yK). We first show that a pair of matrices over an algebraically closed field, which satisfy quadratic polynomials, can be put into block, upper triangular form, with diagonal blocks of size 1×1 or 2×2, via a simultaneous similarity. This is used to prove that if f(x,y,z) = [g(x,y,z)]n2, where g has degree 2, then for some unitary matrix U, the matrix U1AU is the direct sum of n2 copies of a 2×2 matrix A1, where A1 is determined, up to unitary similarity, by the polynomial g(x,y,z). We use the connection between f(x,y,z) and the numerical range of A to investigate the case where f(x,y,z) has the form (z?αax? βy)r[g(x,y,z)]s, where g(x,y,z) is irreducible of degree 2.  相似文献   

16.
Elementary methods are used to study sums of the form Σd≤x{xd}t for integers p and t, t > 0, where {x} denotes the fractional part of x. These sums are then used to study sums of the form Σd≤xdpPt(xd) for integers p and t, t > 0, where Pt(x) = Bt({x}) and Bt(x) are Bernoulli polynomials. some general results on sums of error terms are used to study sums of the form Σnxntσa(n) and ΣnxEt(n) for integers t and a, a ≥ 0, where σa(n) is the sum of the ath powers of the divisors of n and Et(x) is the error term in the sum Σnxntσa(n).  相似文献   

17.
We shall establish for all finite fields GF(pn) the following result of Chowla: given a positive integer m greater than one and the finite field GF(p), p a prime, such that xm = ?1 is solvable in GF(p), then there exists an absolute positive constant c, c ≤ 10ln 2, such that for each set of s nonzero elements ai of GF(p), a1x1m + ? + asxsm has a non-trivial zero in GF(p) if sc ln m.  相似文献   

18.
A function f(z) = z ? ∑n = 2anzn, an ? 0, analytic and univalent in the unit disk, is said to be in the family T1(a, b), a real and b ? 0, if ¦(zf′f) ? a¦ ? b for all z in the unit disk. A complete characterization is found for T1(a, b) when a ? 1. Also, sharp coefficient bounds are determined for certain subclasses of T1(a, b) when a < 1; however, examples are given to show that these bounds do not remain valid for the whole family.  相似文献   

19.
For a > 0 let ψa(x, y) = ΣaΩ(n), the sum taken over all n, 1 ≤ nx such that if p is prime and p|n then a < py. It is shown for u < about (log log xlog log log x) that ψa(x, x1u) ? x(log x)a?1pa(u), where pa(u) solves a delay differential equation much like that for the Dickman function p(u), and the asymptotic behavior of pa(u) is worked out.  相似文献   

20.
The problem of determining the number of finite central groupoids (an algebraic system satisfying the identity (x · y) · (y ? z) = y) is equivalent to the problem of determining the number of solutions of the matrix equation A2 = J, where A is a 0, 1 matrix and J is a matrix of 1's.The existence of solutions of A2 = J of all ranks r, where n ? r ? [(n2 + 1)2], and A is n2 × n2, is proven. Since these are the only possible values, the question of existence solutions of all possible ranks is completely answered. The techniques and proofs are of a constructive nature.  相似文献   

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

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