A MODEL FOR WHITE NOISE ANALYSIS IN P-ADIC NUMBER FIELDS

ＡＭＯＤＥＬＦＯＲＷＨＩＴＥＮＯＩＳＥＡＮＡＬＹＳＩＳＩＮＰ－ＡＤＩＣＮＵＭＢＥＲＦＩＥＬＤＳ（黄志远）￥ＡｎｄｒｅｗＫｈｒｅｎｎｉｋｏｖ（ＭｏｓｃｏｗＩｎｓｔ．ｏｆＥｌｅｃｔｒｏｎｉｃＥｎｇｉｎｅｅｒｉｎｇ，１０３４９８，Ｚｅｌｅｎｏｇｒａｄ，Ｋ－...     

Randomly sampled Riemann sums and complete convergence in the law of large numbers for a case without identical distribution

Let the points be independently and uniformly randomly chosen in the intervals , where . We show that for a finite-valued measurable function on , the randomly sampled Riemann sums converge almost surely to a finite number as if and only if , in which case the limit must agree with the Lebesgue integral. One direction of the proof uses Bikelis' (1966) non-uniform estimate of the rate of convergence in the central limit theorem. We also generalize the notion of sums of i.i.d. random variables, subsuming the randomly sampled Riemann sums above, and we show that a result of Hsu, Robbins and Erd\H{o}s (1947, 1949) on complete convergence in the law of large numbers continues to hold. In the Appendix, we note that a theorem due to Baum and Katz (1965) on the rate of convergence in the law of large numbers also generalizes to our case.

     

Finding -strong pseudoprimes

Let be odd primes and . Put

Then we call the kernel, the triple the signature, and the height of , respectively. We call a -number if it is a Carmichael number with each prime factor . If is a -number and a strong pseudoprime to the bases for , we call a -spsp . Since -numbers have probability of error (the upper bound of that for the Rabin-Miller test), they often serve as the exact values or upper bounds of (the smallest strong pseudoprime to all the first prime bases). If we know the exact value of , we will have, for integers , a deterministic efficient primality testing algorithm which is easy to implement.

In this paper, we first describe an algorithm for finding -spsp(2)'s, to a given limit, with heights bounded. There are in total -spsp's with heights . We then give an overview of the 21978 - spsp(2)'s and tabulate of them, which are -spsp's to the first prime bases up to ; three numbers are spsp's to the first 11 prime bases up to 31. No -spsp's to the first prime bases with heights were found. We conjecture that there exist no -spsp's to the first prime bases with heights and so that

which was found by the author in an earlier paper. We give reasons to support the conjecture. The main idea of our method for finding those -spsp's is that we loop on candidates of signatures and kernels with heights bounded, subject those candidates of -spsp's and their prime factors to Miller's tests, and obtain the desired numbers. At last we speed our algorithm for finding larger -spsp's, say up to , with a given signature to more prime bases. Comparisons of effectiveness with Arnault's and our previous methods for finding -strong pseudoprimes to the first several prime bases are given.

     

Integer comparisons across the grades: Students’ justifications and ways of reasoning

This study is an investigation of students’ reasoning about integer comparisons—a topic that is often counterintuitive for students because negative numbers of smaller absolute value are considered greater (e.g., −5 > − 6). We posed integer-comparison tasks to 40 students each in Grades 2, 4, and 7, as well as to 11th graders on a successful mathematics track. We coded for correctness and for students’ justifications, which we categorized in terms of 3 ways of reasoning: magnitude-based, order-based, and developmental/other. The 7th graders used order-based reasoning more often than did the younger students, and it more often led to correct answers; however, the college-track 11th graders, who responded correctly to almost every problem, used a more balanced distribution of order- and magnitude-based reasoning. We present a framework for students’ ways of reasoning about integer comparisons, report performance trends, rank integer-comparison tasks by relative difficulty, and discuss implications for integer instruction.     

基于Hausdauff度量的模糊TOPSIS方法研究

针对模糊多属性决策中的模糊 TOPSIS方法 ,提出了一种基于 Hausdauff度量的模糊 TOPSIS方法 .首先由模糊极大集与模糊极小集确定模糊多属性决策问题的理想解与负理想解 ,进而由 Hausdauff度量获得不同备选方案到理想解与负理想解的距离及其贴近度 ,根据贴近度指标对方案进行排序 ,为决策者提供决策支持 .最后以 L-R梯形模糊数为例进行了实例研究 .     

Regularization of Monotone Variational Inequalities with Mosco Approximations of the Constraint Sets

In this paper we study the convergence and stability in reflexive, smooth and strictly convex Banach spaces of a regularization method for variational inequalities with data perturbations. We prove that, when applied to perturbed variational inequalities with monotone, demiclosed, convex valued operators satisfying certain conditions of asymptotic growth, the regularization method we consider produces sequences which converge weakly to the minimal-norm solution of the original variational inequality, provided that the perturbed constraint sets converge to the constraint set of the original inequality in the sense of a modified form of Mosco convergence of order ≥1. If the underlying Banach space has the Kadeč–Klee property, then the sequence generated by that regularization method is strongly convergent. Mathematics Subject Classifications (2000) Primary: 47J0G, 47A52; secondary: 47H14, 47J20.     

高阶Euler数的推广及其应用

给出了高阶Euler数的一种Apostol型(看T.M.Apostol,[Pacific J.Math.,1(1951),161～167])推广,我们称之为高阶Apostol-Euler数,然后推导出它的几个递推公式并给出了它们的一些特殊情况和应用,从而得到了相应的高阶Euler数和经典Euler数的新公式.     

关于与广义Fibonacci,Lucas数有关的一些级数的注记

求出了一些与广义Fibonacci,Lucas数有关的一些倒数级数的值。     

方程xy+yz+zx=n的正整数解

本文用 Ｓｉｅｇｅｌ－Ｔａｔｕｚａｗａ定理证明了：当ｎ＞１．２×１０~１１时,至多有两个正 整数ｎ。使方程ｘｕ＋ｙｚ＋ｚｘ＝ｎ无适合（ｘ,ｙ,ｚ）＝１且０＜ｘ＜ｙ＜ｚ的解（ｘ,ｙ,ｚ）, 并给出类数为２的二次域与多项式表素数的一个结果．     

Continuity Properties of Distributions with Some Decomposability

Absolute continuity and smoothness of distributions in the nested subclasses ~L _m (B), m = 0, 1, 2,..., of the class of all B-decomposable distributions are studied. All invertible matrices are classified into two types in terms of P.V. numbers. The minimum integer m for which all full distributions in ~L _m (B) are absolutely continuous and the minimum integer m for which all absolutely continuous distributions in ~L _m (B) have the densities of class C ^r for 0 r are discussed according to the type of the matrix B related to P.V. numbers.