Digital sum problems and substitutions on a finite alphabet
โ Scribed by J.M. Dumont; A. Thomas
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 732 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We prove an estimate of character sums. This bound and the method of solving multiplicative ternary problems are used to obtain new results about the cardinality of an exceptional set of a congruence problem modulo a prime p. In particular, we show that "almost all" residue classes modulo p are repr
P, not in the open region R. For any such point P, let S, denote the closed segment of the net joining P to P, . For each k = 1, \* \* , 9, the point of S, n C closest to P will be called a boundary fioint of the net. The set of boundary points will be denoted b y C, . Some points of C, may be nodes
Two models of steady state brittle crack motion are commonly used. They are the models of Yoff6 (1) and of Craggs (2) (similar models have also been used by Barenblatt etc. of the Russian school). As is well known, Yoffr's model consists of a constant finite length crack moving with uniform velocity