首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 13 毫秒
1.
2.
The existence of the neutrix convolution product of distributionx ? r Inx ? andx + ?3 is proved and some convolution products are evaluated.  相似文献   

3.
Let a≥1 be an integer.In this paper,we will prove the equation in the title has at most three positive integer solutions.  相似文献   

4.
Let d(c) denote the Hausdorff dimension of the Julia set J c of the polynomial f c (z) = z 2 + c. The function c ? d(c) is real-analytic on the interval (?5/4,?3/4), which is included in the 1/2 bulb of the Mandelbrot set. The number c = ?3/4 is the parameter at which, going from the right, the attracting fixed point bifurcates to an orbit of period two. Recently [13], we studied d′(c) when c ? ?3/4 from the right. Here, under numerically verified assumption d(?3/4) < 4/3, we will show that there exists K ?3 4/? > 0 such that d′(c)(?3/4 ? c)?3d(?3/4)/2+2 → ?K ?3 4/? , when c tends to ?3/4 from the left. In particular we obtain d′(c) ? ?∞. This case is much harder than that considered in [13].  相似文献   

5.
In this paper, we shall characterize all {(q + 1) + 2, 1;t, q}-min · hypers and all {2(q + 1) + 2, 2; 2,q}-min · hypers for any integert 2 and any prime powerq 3. In the next paper [8], we shall characterize all {2(q + 1) + 2, 2;t, q}-min · hypers for any integert 3 and any prime powerq 5 using the results in this paper.  相似文献   

6.
7.
The notion of m-regular system on the Hermitian variety ℋ(n,q 2) was introduced by B. Segre (Ann. Math. Pura Appl. 70:1–201, 1965). Here, three infinite families of hemisystems on ℋ(5,q 2), q odd, are constructed.  相似文献   

8.
In this study, we determine when the Diophantine equation x 2?kxy+y 2?2 n = 0 has an infinite number of positive integer solutions x and y for 0 ? n ? 10. Moreover, we give all positive integer solutions of the same equation for 0 ? n ? 10 in terms of generalized Fibonacci sequence. Lastly, we formulate a conjecture related to the Diophantine equation x 2 ? kxy + y 2 ? 2 n = 0.  相似文献   

9.
《Discrete Mathematics》2001,221(1-3):139-151
The graph of [] against j displays self matching in that if we displace this graph by a distance of Fi, then it is found that the displaced graph matches the original graph except at certain isolated points represented by an interesting Fibonacci function. From this it is shown that the frequency of mismatches is the unexpectedly simple expression 1/(τi). The results are proved using lemmas, based on Zeckendorf sums, which have an appeal of their own. These also give simplified solutions to the recurrence of Downey and Griswold. Similar results apply with the Golden Sequence whose jth term is [(j+1)τ]−[].  相似文献   

10.
《Discrete Mathematics》2001,221(1-3):395-406
We consider the primality test of Williams and Zarnke for rational integers of the form 2h·3n+1. We give an algebraic proof of the test, and we resolve a sign ambiguity. We also show that the conditions of the original test can be relaxed, especially if h is divisible by a power of 2.  相似文献   

11.
12.
Let F be a field. If A is an n×n matrix over F, we denote by i(A) the number of invariant polynomials of A different from 1. We shall prove that if A,B are n×n matrices over F and t ∈ {1,…,n}, then i(A)+i(B)⩽n+t if and only if there exists a nonsingular matrix X over F such that i(XAX−1+B)⩽t, except in a few cases.  相似文献   

13.
This paper shows that the graphW(n, n – 2, k) is chromatically unique for any even integern 6 and any integerk 1.  相似文献   

14.
15.
In this paper, we give a formula for the number of positive integral solutions (x,y,z) of the equation x 3+by+1?xyz=0 and also we prove a stronger form of a conjecture of S.P. Mohanty and A.M.S. Ramasamy concerning the number of positive integral solutions (x,y,z) of the equation.  相似文献   

16.
17.
18.
Under sufficiently general assumptions, we describe sets of entire functions f, sets of growing functions λ, and sets of complex-valued functions H from L p [0, 2π], p ∈ [1, + ∞], for which
Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 7, pp. 889–896, July, 1998.  相似文献   

19.
20.
We prove that the simple group G 2(q), where 2 < q ≡ ?1(mod 3), is recognizable by the set of its order components. In other words, we prove that if G is a finite group with OC(G) = OC(G 2(q)), then GG 2(q).  相似文献   

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

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