Minimum periods, modulo $p$, of first-order Bell exponential integers.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On periods modulo p in arithmetic dynamics ∗ †

We prove the following mod p version of a case of the dynamical André-Oort conjecture obtained in [GKN ]. Theorem. There are constants c1, c2 depending on d and h such that the following holds. For almost all P, there is a finite subset T ⊂ F̄P , |T | ≤ c1 such that if t ∈ F̄P \ T at least one of the sets { f (`) t (0) : ` = 1, 2, · · · , [c2 logN ] } , { g (`) t (0) : ` = 1, 2, · · · , [c2 logN ...

متن کامل

Preliminary Version on the Order of Unimodular Matrices modulo Integers

Assuming the Generalized Riemann Hypothesis, we prove the following: If b is an integer greater than one, then the multiplicative order of b modulo N is larger than N for all N in a density one subset of the integers. If A is a hyperbolic unimodular matrix with integer coefficients, then the order of A modulo p is greater than p for all p in a density one subset of the primes. Moreover, the ord...

متن کامل

Distribution of Difference between Inverses of Consecutive Integers modulo P

Let p > 2 be a prime number. For each integer 0 < n < p, define n by the congruence nn ≡ 1 (mod p) with 0 < n < p. We are led to study the distribution behavior of n− n+ 1 in order to prove the asymptotic formula p−2 ∑ n=1 |n− n+ 1| = 1 3 p +O(p log p).

متن کامل

Variation of periods modulo p in arithmetic dynamics

Let φ : V → V be a self-morphism of a quasiprojective variety defined over a number field K and let P ∈ V (K) be a point with infinite orbit under iteration of φ. For each prime p of good reduction, let mp(φ, P ) be the size of the φ-orbit of the reduction of P modulo p. Fix any ǫ > 0. We show that for almost all primes p in the sense of analytic density, the orbit size mp(φ, P ) is larger than...

متن کامل

On Periods modulo a Prime of Some Classes of Sequences of Integers

Theorem 1: Let un, n > 0, be the general term of a given sequence of integers and define the transformation T^yk)(un) as T^xyJc){un) = xun+lc +yun for every n > 0, A: being a positive integer. Then, if x mdy are nonzero integers and there exists a positive prime number/? which divides T(x,y,k)(n) f° every n>0 and is relatively prime to x, the distribution of the residues of (un) modulo p is eit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1962

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1962-0148604-2