On the probability that n and f(n) are relatively prime III

نویسندگان

چکیده

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

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

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

منابع مشابه

The Probability that Random Polynomials Are Relatively r-Prime

We find the generating function for the number of k-tuples of monic polynomials of degree n over Fq that are relatively r-prime, meaning they have no common factor that is an rth power. A corollary is the probability that k monic polynomials of degree n are relatively r-prime, which we express in terms of a zeta function for the polynomial ring. This gives an analogue of Benkoski’s result conce...

متن کامل

On Relatively Prime Sets

Functions counting the number of subsets of {1, 2, . . . , n} having particular properties are defined by Nathanson. Here, generalizations in two directions are given. Received: 10/1/08, Revised: 3/20/09, Accepted: 3/30/09

متن کامل

Partitions whose parts are pairwise relatively prime

The following problem arose in connection with our research in statistical group theory: estimate a, := the number of partitions of n into parts that are pairwise relatively prime. This differs from most problems in the theory of partitions because of the complicated relationship between the part sixes. We obtain an asymptotic formula for log a,, but leave open the challenging task of obtaining...

متن کامل

When are Two Numerical Polynomials Relatively Prime?

Let a and b be two polynomials having numerical coeecients. We consider the question: when are a and b relatively prime? Since the coeecients of a and b are approximant, the question is the same as: when are two polynomials relatively prime, even after small perturbations of the coeecients? In this paper we provide a numeric parameter for determining that two polynomials are prime, even under s...

متن کامل

On Relatively Prime Subsets and Supersets

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A ∪ {n}) = 1. The number of nonempty subsets of A which are relatively prime to n is Φ(A,n) and the number of such subsets of cardinality k is Φk(A,n). Given positive integers l1, l2, m2, and n such that l1 ≤ l2 ≤ m2 we give Φ([1,m1] ∪ [l2,m2], n) along with Φk([1,m1] ∪ [l2,m2],...

متن کامل

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


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

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 1972

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa-20-3-267-289