New amicable pairs of type (2, 2) and type (3, 2)
نویسنده
چکیده
A UBASIC computer program was developed to implement a method of te Riele for finding amicable pairs of type (2, 2). Hundreds of new pairs were found, including a new largest (2, 2) pair and several “daughter”, “granddaughter”, and “great granddaughter” pairs.
منابع مشابه
The first known type (7, 1) amicable pair
Amicable pairs of type (i, 1) have been the object of special search partly because they breed other amicable pairs. Examples exist for i = 2, 3, 4, 5, and 6. In this paper we exhibit the first known type (7, 1) pair. The natural numbers M and N are amicable if σ(M) = σ(N) = M +N , where σ(M) represents the sum of the positive divisors of M . An amicable pair is of type (i, 1) if M = E ·p1 · p2...
متن کاملOn Thabit ibn Kurrah's Formula for Amicable Numbers
This note describes some methods for deriving explicit formulas for amicable numbers which are similar to Thabit's famous rule. The search for new amicable pairs by such'rules consists merely in primality tests for certain big numbers. Only two new pairs are actually given, demonstrating the usefulness of the results and simultaneously illustrating the quite strange form of pairs obtained by th...
متن کاملAmicable complex orthogonal designs
In this letter, we define amicable complex orthogonal designs (ACOD) and propose two systematic methods to construct higher-order ACOD’s from lower-order ACOD’s. Although the upper bound on the number of variables of ACOD’s is found to be the same as that of amicable orthogonal designs (AOD), we show that certain types of AOD’s that were previously shown to be non-existent or undecided, such as...
متن کاملAmicable orthogonal designs of order 8 for complex space-time block codes
New amicable orthogonal designs AODs(8; 1, 1, 1; 2, 2, 2), AODs(8; 1, 1, 4; 1, 2, 2), AODs(8; 1, 2, 2; 2, 2, 4), AODs(8; 1, 2, 2; 1, 2, 4), AODs(8; 1, 1, 2; 1, 2, 4), AODs(8; 1, 2, 4; 2, 2, 2), AODs(8; 1, 1, 4; 1, 1, 2, 2), AODs(8; 2, 2, 2, 2; 2, 2, 2, 2) and AODs(8; 1, 1, 1, 2; 1, 2, 2, 2) are found by applying a new theorem or by an exhaustive search. Also some previously undecided cases of a...
متن کاملNew amicable four-cycles
Fifty new amicable four-cycles are discovered by the constructive method invented in 1969 by the second author. 1. Let τ(n) denote the sum of proper divisors of a natural number n, and let σ(n) = n + τ(n). We consider when the sequence n, τ(n), τ (n) := τ(τ(n)), . . . becomes periodic. If n = τ (n) with k minimal, then n1 = n, n2 = τ(n), n3 = τ (n), . . . , nk = τ (k−1)(n) is called an amicable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 72 شماره
صفحات -
تاریخ انتشار 2003