Let n>2 be an integer, and for each integer 0<a<n with (a, n)=1, define aÄ by the congruence aaÄ #1 (mod n) and 0<aÄ <n. The main purpose of this paper is to study the distribution behaviour of |a&aÄ |, and prove that for any fixed positive number 0<$ 1, where ,(n) is the Euler function, and \*[ }
On the Discrete POISSON-Inverse GAUSSian Distribution
✍ Scribed by Dr. S. A. Shaban
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 245 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0323-3847
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider numerical methods which exactly preserve the Gauss±Poisson equation when solving the charge conservation and Maxwell±AmpeÁ re's equations. Apart from the well-known leap-frog method, we present two situations where this property is veri®ed, one with rectangular mesh and functions de®ned
The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. The authors have recently introduced a new method for obtaining nontrivial upper bounds on the multidimensional discrepancy of inversive congruential pseudor