In this article we study, using elementary and combinatorial methods, the distribution of quadratic non-residues which are not primitive roots modulo or for an odd prime and an integer.
We show that the number of primes of a number field K of norm at most x, at which the local component of an idele class character of infinite order is principal, is bounded by O(x exp(-c√(log x))) as x → ∞, for some absolute constant c > 0 depending only on K.
We apply the larger sieve to bound the number of matrices not having large order when reduced modulo the primes in an interval. Our motivation is the relation with linear recursive congruential generators. Basically our results establish that the probability of finding a matrix with large order modulo many primes drops drastically when a certain threshold involving the number of primes and the order is exceeded. We also study, for a given prime and a matrix, the existence of nearby non-similar...
In a recent paper (Diversity in Monoids, Czech. Math. J. 62 (2012), 795–809), the last two authors introduced and developed the monoid invariant “diversity” and related properties “homogeneity” and “strong homogeneity”. We investigate these properties within the context of inside factorial monoids, in which the diversity of an element counts the number of its different almost primary components. Inside factorial monoids are characterized via diversity and strong homogeneity. A new invariant complementary...
Let be a (commutative cancellative) monoid. A nonunit element is called almost primary if for all , implies that there exists such that or . We introduce a new monoid invariant, diversity, which generalizes this almost primary property. This invariant is developed and contextualized with other monoid invariants. It naturally leads to two additional properties (homogeneity and strong homogeneity) that measure how far an almost primary element is from being primary. Finally, as an application...