共查询到20条相似文献,搜索用时 46 毫秒
1.
Svatoslav Stanêk 《Mathematische Nachrichten》1993,164(1):333-344
Using the Leray-Schauder degree method sufficient conditions for the one-parameter boundary value problem x″ = f(t, x, x′, λ), α(x) = A, x(0) ? x(1) = B, x′(0) ? x′(1) = C, are stated. The application is given for a class of functional boundary value problems for nonlinear third-order functional differential equations depending on the parameter. 相似文献
2.
Rajendra M. Pawale 《组合设计杂志》2007,15(1):49-60
The following results for proper quasi‐symmetric designs with non‐zero intersection numbers x,y and λ > 1 are proved.
- (1) Let D be a quasi‐symmetric design with z = y ? x and v ≥ 2k. If x ≥ 1 + z + z3 then λ < x + 1 + z + z3.
- (2) Let D be a quasi‐symmetric design with intersection numbers x, y and y ? x = 1. Then D is a design with parameters v = (1 + m) (2 + m)/2, b = (2 + m) (3 + m)/2, r = m + 3, k = m + 1, λ = 2, x = 1, y = 2 and m = 2,3,… or complement of one of these design or D is a design with parameters v = 5, b = 10, r = 6, k = 3, λ = 3, and x = 1, y = 2.
- (3) Let D be a triangle free quasi‐symmetric design with z = y ? x and v ≥ 2k, then x ≤ z + z2.
- (4) For fixed z ≥ 1 there exist finitely many triangle free quasi‐symmetric designs non‐zero intersection numbers x, y = x + z.
- (5) There do not exist triangle free quasi‐symmetric designs with non‐zero intersection numbers x, y = x + 2.
3.
We are concerned with the existence of quasi-periodic solutions for the following equation
x" + Fx (x,t)x¢+ w2 x + f(x,t) = 0,x' + F_x (x,t)x' + \omega ^2 x + \phi (x,t) = 0, 相似文献
4.
Robert T. Harger Rebecca M. Smith 《International Journal of Mathematical Education in Science & Technology》2013,44(3):476-477
Fermat's Little Theorem states that if p is a prime number and gcd (x,p) = 1, then xp?1 ≡ 1 (modp) If the requirement that gcd (x,p) = 1 is dropped, we can say xp ≡ x(modp)for any integer x. Euler generalized Fermat's Theorem in the following way: if gcd (x,n) = 1 then xφ(n) ≡ 1(modn), where φ is the Euler phi-function. It is clear that Euler's result cannot be extended to all integers x in the same way Fermat's Theorem can; that is, the congruence xφ(n)+1 ≡ x(modn)is not always valid. In this note we show exactly when the congruence xφ(n)+1 ≡ x(modn) is valid. 相似文献
5.
Harry Dym Jeremy M. Greene J. William Helton Scott A. McCullough 《Journal d'Analyse Mathématique》2009,108(1):19-59
Every symmetric polynomial p = p(x) = p(x
1,..., x
g
) (with real coefficients) in g noncommuting variables x
1,..., x
g
can be written as a sum and difference of squares of noncommutative polynomials:
|