强伪凸域,strongly pseudoconvex domain

1)strongly pseudoconvex domain
强伪凸域

2)Bounded Strongly pseudoconvex Domains
有界强伪凸域

3)strong pseudoprimes
强伪素数
1.
Let N=q_1q_2q_3,q_1<q_2<q_3 be a 3 factors Carmicheal number,define C_(3,1)-and C_(3,2)-numbers,they respectively mean q_i=5 mod 8,i=1,2,3,and q_i≡5 mod 8,i=1,2,q_3≡9 mod 16,they also have a higher probability to be the strong pseudoprimes.
令N=q1q2q3,q1

2.
An algorithm is given,Using this algorithm can find out some numbers which are both Carmichael numbers and strong pseudoprimes to some prescribed bases.
对含有三个素因子的Ｃａｒｍｉｃｈａｅｌ数给出一种算法，利用此算法能探求一些Ｃａｒｍｉｃｈａｅｌ数，它们同时又是对一系列指定底的强伪素


3.
(Department of Mathematics, Anhui Normal University, Wuhu 241000)Abstract: Define ψ_m to be the smallest strong pseudoprimes to all the first m prime bases.
定义ψ_m是关于前m个素数基的最小强伪素数。



4)strongly quasi-contraction
强伪压缩

5)strong pseudocovex function
强伪凸函数

6)Φ strongly pseudocontractive mapping
Φ强伪压缩
1.
Let Τ be Φ strongly pseudocontractive mapping.
证明当Τ是Q一致光滑Banach空间Ε的有界闭凸子集到自身的Φ强伪压缩映象时,Ishikawa迭代法强收敛到Τ的唯一不动点。



7)strongly pseudo monotonicity
强伪单调性

8)strongly pseudoalgebraic lattice
强伪代数格

9)Φ-strongly pseudo contractive
Φ-强伪压缩

10)hyper-strong pseudoprime
超强伪素数

补充资料：凸域


凸域
convex domain

凸域t“目Vex水口越n;.ully翻”OO月acT列 具有内点的凸集(田nvex set)·

说明：补充资料仅用于学习参考，请勿用于其它任何用途。

强伪凸域,strongly pseudoconvex domain