#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES

Size: px
Start display at page:

Download "#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES"

Transcription

1 #A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York Received: 6/11/13, Revised: 6/17/14, Accepted: 7/15/14, Pulished: 10/8/14 Astract Conway s RATS sequences are generated y repeating the following process: egin with a positive integer, reverse the order of the digits, add the two integers together, then sort the sum s digits in increasing order from left to right. We consider this process for integers written in other ases esides 10 and study the long-term ehavior of such sequences. In particular, we examine and show the existence of periodic and quasiperiodic (a special type of divergence) sequences for certain choices of ase. 1. Introduction Conway s RATS [1] game has very simple set of rules: egin with a positive integer n, Reverse the digits of n, Add the two integers together, and Then Sort the digits of the sum in increasing order from left to right (discarding any zeros). Repeating this process generates an infinite sequence, ut the game is said to end if any term in the generated sequence is ever repeated. Example 1.1. The sequence generated y the RATS process eginning with n = 888 is given y: 888 7! ! ! ! ! 111 7! 7! 444 7! 888 7!. (1.1) This particular example shows that starting with n = 888, the RATS game ends ecause the sequence is periodic. Not all sequences generated y the RATS process are periodic, or even eventually periodic. Conway himself noted that the sequence generated y the RATS process starting with n = 1 diverges. Furthermore, he conjectured that this sequence is somewhat unique when it comes to the RATS game. Conjecture (Conway, [1]). Every RATS sequence is either eventually periodic or eventually part of the sequence 1 7! 7! 4 7! 7! ! ! ! !.

2 INTEGERS: 14 (014) One can easily see that the RATS game can e extended to other integer ases esides 10. In this article, we will expand on some results of Cooper and Kennedy [] and Cooper and Shattuck [7] on the ehavior of RATS sequences for general ases. (Note that we always assume a nonunary ase.) In particular, we will answer an open question posed y Cooper and Shattuck on the existence of divergent RATS sequences for certain ases.. Notation and Terminology We egin with some definitions that will e used regularly throughout the following sections. Note that, unless otherwise specified, all variales used represent nonnegative integers. Definition.1. For any positive integer n written in ase, let n := n e the digit formed y reversing the digits of n, and let n 0 := n 0 e the digit formed y ordering the nonzero digits of n in increasing order from left to right. Define the function R : N! N y R (n) = (n + n) 0. To denote iterates of R, we adopt superscript notation. For any nonnegative integer t, let R t(n) = R (R t 1 (n)) if t 1 and R 0 (n) = n. Example.. R 3(110) = R 3 (( ) 0 ) = R 3 (( ) 0 ) = R 3 ((1010) 0 ) = R 3 (11) = ( ) 0 = (1100) 0 = 11 Definition.3. We call {R i(n)}1 i=0 the RATS sequence generated y n in ase. Definition.4. If R p (n) = n for some p > 0, we say that n and the RATS sequence generated y n in ase are periodic. If p is the least integer with this property, we say that the period is p. If R t (n) is periodic for some t 0, we say that n and the RATS sequence generated y n in ase are ultimately periodic 1. Note that periodic sequences are also ultimately periodic, ut not vice versa. This helps to simplify some statements, avoiding the need to say that a result applies to periodic and ultimately periodic sequences. 1 In [6], periodic sequences are referred to as cycles and ultimately periodic sequences are triutaries to a cycle.

3 INTEGERS: 14 (014) 3 Example.5. The sequence (1.1) shows that 888 is periodic with period 8. For convenience, we will adopt the exponential notation used y Guy [5] when necessary. In exponential notation, the ase denotes the digit and the exponent denotes the numer of times that the digit appears; e.g., will e denoted as For ases larger than 10, we place parentheses around a digit larger than 9. For example, in ase, 1(11) 3 (14) is the five digit numer with digits 1, 11, 11, 11, 14. Definition.6. If n = 1 m1 (k 1) m k 1 k m k (k + 1) m k+1 ( 1) m 1 and R qt (n) = 1m1 (k 1) m k 1 k mk+t (k + 1) m k+1 ( 1) m 1, with m i 0 for 1 apple i apple 1, for some q > 0 and all t 0, we say that n and the RATS sequence generated y n in ase are quasiperiodic. If q is the least integer with this property, we say that the quasiperiod is q. The digit k > 0 which increases in count after q iterations is called the growing digit. If R t (n) is quasiperiodic for some t 0, we say that n and the RATS sequence generated y n in ase are ultimately quasiperiodic. Example.7. From Conway s conjecture we see that and are quasiperiodic elements in ase 10 with quasiperiod and growing digits 3 and 6, respectively. Definition.8. Let P, called the period set in ase, e the set of all p for which there are periodic elements with period p in ase. From the first example (1.1), the sequence 888 7! ! shows that 888 is periodic with period 8, so 8 P 10. In fact, Cooper and Kennedy were ale to completely characterize the period set P 10 (see [] and [3]). Definition.9. Let Q, called the quasiperiod set in ase, e the set of all q for which there are quasiperiodic elements with quasiperiod q in ase. Conway s conjecture gives that Q 10. Unlike the case for P 10, we do not have a complete description of Q 10. However, if Conway s conjecture is true, then it follows that Q 10 = {}. In its full strength, this remains open, ut one can show that Q 10 can only contain even numers. One way to make further progress towards Conway s conjecture would e to show that, indeed, Q 10 = {}. This is, however, not enough to prove the conjecture, since the possiility exists that there are elements that are neither ultimately periodic nor ultimately quasiperiodic, or that there are multiple disjoint sequences with quasiperiod. The di culty in showing that certain quasiperiods are not in Q 10 is that they require dealing with a tremendous numer of cases. Even showing that there are no quasiperiodic RATS sequences, with quasiperiod, that do not intersect with Conway s sequence seems di cult. In [7], quasiperiodic sequences are called divergent and the quasiperiod is called the length.

4 INTEGERS: 14 (014) 4 In the susequent sections, we will study the sets P and Q for certain choices of. In Section 3, we will show that there is an infinite family of ases such that P = 1. In Section 4, we show how to construct a ase such that Q contains any desired finite set of positive integers. Lastly, in Section 5, we investigate the ehavior of the growing digit of a quasiperiodic integer. 3. Existence of Periodic Sequences From the work of Gentges [4] and Cooper and Shattuck [7], it follows that there are ases such that P = 1, namely = 3 and = 10. In this section, we show that there is an infinite family of ases for which the same result is true. By a sum written in the form we mean the following sum: This will help visualize what the reverse-add portion of the RATS process produces. For example, if the aove sums were in ase 10, they would give the sum = Theorem 3.1. For m > 1 and = 3 m we have: (i) If m is odd, then P contains all su (ii) If m is even, then P contains all su, we have P = 1. More precisely, ciently large even integers. ciently large integers. Proof. We will first show that, for any even k > 0, 1 k ( m 1) ( m 1) k 1 is periodic with period m k. This proves that when m is odd, P contains all su ciently large even numers, and when m is even, P contains all su ciently large odd numers. In particular, P = 1. We egin y iterating the RATS process m + 1 times with the staring element 1 k ( m 1) ( m 1) k 1. Since k ( m 1) = k 1 + k ( m ) + 1, the reverse-add portion of the RATS process produces 1 k 1 1 k ( m )+1 ( m 1) k 1 + ( m 1) k 1 1 k ( m )+1 1 k 1 ( m ) k 1 k ( m )+1 ( m ) k 1

5 INTEGERS: 14 (014) 5 (Note that no carries occur since the ase = 3 m sorting step, we otain satisfies > m.) After the R (1 k ( m 1) ( m 1) k 1 ) = k ( m )+1 ( m ) (k 1). Since k ( m ) + 1 = ( k 1) + k ( m 4) + 3, we get Therefore, (k 1) k ( m 4)+3 ( m ) (k 1) + ( m ) (k 1) k ( m 4)+3 (k 1) ( m + ) (k 1) 4 k ( m 4)+3 ( m + ) (k 1) R ( k ( m )+1 ( m ) (k 1) ) = 4 k ( m 4)+3 ( m + ) 4(k 1). Again, since k ( m 4) + 3 = 4( k 1) + k ( m 8) + 7, we get Therefore, 4 4(k 1) 4 k ( m 8)+7 ( m + ) 4(k 1) + ( m + ) 4(k 1) 4 k ( m 8)+7 4 4(k 1) ( m + 6) 4(k 1) 8 k ( m 8)+7 ( m + 6) 4(k 1) R (4 k ( m 4)+3 ( m + ) 4(k 1) ) = 8 k ( m 8)+7 ( m + 6) 8(k 1). By continuing this process, we see that if 0 < j apple m, then the jth term in the RATS sequence generated y 1 k ( m 1) ( m 1) k 1 is given y ( j ) k ( m j )+ j 1 ( m + j+1 ) j ( k 1). (3.1) In particular, y (3.1), the mth term in the RATS sequence is ( m ) m 1 ( m+1 ) m ( k 1). The mth term is the first instance in which the larger digit has the higher exponent. So now the reverse-add portion of the RATS process has the following form: ( m ) m 1 ( m+1 ) m ( k )+1 ( m+1 ) m 1 + ( m+1 ) m 1 ( m+1 ) m ( k )+1 ( m ) m 1 1 m ( m 1) m ( k )+1 1 m 0 (Note that carries occur at every step in the sum.) Therefore, R (( m ) m 1 ( m+1 ) m ( k 1) ) = 1 m+1 ( m 1) m ( k )+1.

6 INTEGERS: 14 (014) 6 Again, continuing this process in a similar fashion, since m ( k )+1 = m+1 + m ( k 4) + 3, we get 1 m+1 ( m 1) m ( k 4)+3 ( m 1) m+1 + ( m 1) m+1 ( m 1) m ( k 4)+3 1 m+1 ( m ) m+1 ( m+1 ) m ( k 4)+3 ( m ) m+1. Therefore, R (1 m+1 ( m 1) m ( k )+1 ) = ( m ) m+ 4 ( m+1 ) m ( k 4)+3. Continuing this process, we see that if m + 1 < j apple k, then the jth term in the RATS sequence generated y 1 k ( m 1) ( m 1) k 1 is given y (A) j ( m 1) (B) m ( k j )+ j 1, (3.) where A = 1 and B = m 1 if j is even, and A = m and B = m+1 if j is odd. Taking j = k in (3.), we get that, since k is even, the (m k)th term in the RATS sequence is 1 k ( m 1) ( m 1) k 1, our starting element. Thus this sequence is periodic with period m k, as claimed. This proves that P = 1 and part (i) of the theorem. To otain part (ii), it is enough to show that for all even k > 0, 1 k ( m+1 )( m+1 +1) ( m 1) k ( m+1 1) is periodic with period (m+1)+k. When m is even, this will give that P contains all su ciently large even numers. This can e done using the same method shown aove. We omit the details. Notice that since 10 = 3, the theorem applies to ase = 10 with m =, and gives that P 10 contains all su ciently large integers. In this case, as a slightly stronger result, Cooper and Kennedy [], [3] showed that the period set is as large as possile, that is, P 10 = {p : p }. At this time it is not known if there are infinitely many ases such that their period sets contain all periods p p 0 for some fixed p 0 > 1. Another point of interest is that ase 3 is not in the family descried y Theorem 3.1, yet it too has the property that P 3 = 1. Clearly we have not identified all such ases for which the period set is infinite. In fact, the family {3 m : m > 1}, covered y Theorem 3.1, has asymptotic density zero. A reasonale follow-up to Theorem 3.1 would e to examine the possiility of the existence of a family of ases, with nonzero asymptotic density, having infinite period sets.

7 INTEGERS: 14 (014) 7 4. Existence of Quasiperiodic Sequences The sequence from Conway s original RATS conjecture shows that Q 10, the quasiperiod set in ase 10, contains the element q =. In particular, the set Q 10 is not empty. In this section we will construct infinite families of ases for which Q 6= ;. We egin with a theorem of Cooper, Shattuck, and Gentges. Theorem 4.1 (Cooper and Shattuck, [7], Gentges, [4]). For any ase satisfying 1 (mod 18) or 10 (mod 18), with 10, we have Q, i.e., there exists a quasiperiodic RATS sequence of period. Sketch of Proof. In the case = 18k + 1 for k > 0, the element (6k) m (6k + 1) (3 64k 3)/36 is quasiperiodic with quasiperiod if m is su ciently large. In the case = 18k + 10 for k 0, the element (6k + 1) (3 64k )/4 (6k + ) 64k (6k + 3) m (6k + 4) (44 64k 8)/9 is quasiperiodic with quasiperiod if m is su ciently large. Theorem 4.1 shows that ases containing at least one quasiperiodic sequence make up a positive proportion of all integers. The following corollary makes this statement explicit. Corollary 4.. Let Then 1/9. = lim inf N!1 #{ apple N : Q 6= ;}. (4.1) N Along the lines of Theorem 4.1, Cooper and Shattuck [7] were also ale to conclude that for ases = ( q 1) +1, with q a prime or a ase- Fermat pseudoprime, we have q Q. In the next theorem, we expand on their result in two directions. First, we will remove the (pseudo)primality constraint on the quasiperiod q and second, we will exhiit an infinite family of ases for which q is a quasiperiod. Theorem 4.3. Let q >. If 1 (mod ( q 1) ) with > 1, then q Q. Proof. Suppose that = ( q 1) k + 1, where k 1. Let v = ( q 1)k. We will construct a quasiperiodic integer in ase with quasiperiod q and growing digit v. Consider an integer of the form 1 m1 m... (v 1) mv 1 v M+mv (v + 1) P v mi, (4.)

8 INTEGERS: 14 (014) 8 where M > 0, m i 0 for i = 1,..., v, and where the digit in oldface denotes the proposed growing digit. We will derive a system of equations and conditions that the exponents m i must satisfy in order for the integer (4.) to have quasiperiod q. We then will show that this system has a solution provided M is large enough. We see that the reverse-add portion of the RATS process produces. 1 m1 m... v M (v + 1) mv... (v + 1) m1 + (v + 1) m1 (v + 1) m... v M v mv... 1 m1 (v + ) m1 (v + 3) m... (v) M (v + 1) mv... (v + ) m1 (Note that no carries occur in the sum and every digit of the sum is nonzero.) Sorting the result gives the second term in the RATS sequence, (v + ) m1 (v + 3) m... (v 1) mv (v) M+mv 1 (v + 1) mv. (4.3) In order for the growing digit v of (4.3) to (approximately) line up against itself in the next sum, we need P v m i m v. Let M 1 e such that and assume M 1 m v = M 1 + m i (4.4) 0 for now. We repeat the aove process and get. (v + ) m1... (v) M+mv 1 M1 (v + 1) M1... (v + 1) m1 + (v + 1) m1... (v) M+mv 1 M1 (v) M1... (v + ) m1 (3v + 3) m1... (4v) M+mv 1 M1 (4v + 1) M1... (3v + 3) m1 Sorting the result gives the third term in the RATS sequence, (3v + 3) 4m1 (3v + 4) 4m... (4v 1) 4mv 3 (4v) M+mv 1+4mv M1 (4v + 1) M1. (4.5) In order for the growing digit 4v of (4.5) to line up against itself in the next sum, we need 4 P v 3 m i M 1. Let M e such that M 1 = M + 4 P v 3 m i and assume M 0 for now. Repeating this process a total of q 1 times gives that the qth term in the RATS sequences is (( q 1 1)v + q) q 1 m 1 (( q 1 1)v + q + 1) q 1 m ( q 1 v 1) q 1 m q 1 ( q 1 v) M+P q 1 i m v i P q Mi ( q 1 v + 1) Mq, (4.6) where the M j s are defined to e such that M j = M j+1 + j+1 v (j+) X m j (4.7)

9 INTEGERS: 14 (014) 9 for j = 1,..., q and are assumed to e nonnegative. We repeat the reverse-add portion of the RATS process one more time and get (( q 1 1)v + q) q 1 m 1... ( q 1 v) M 0... ( q 1 v + 1) q 1 m 1 + ( q 1 v + 1) q 1 m 1... ( q 1 v) M 0... (( q 1 1)v + q) q 1 m 1 1 (q + 1) q 1 m 1... v M (q + 1) q 1 m 1 1 q where M 0 = M + P q 1 (i m v i M i ) and M 00 = M + P q 1 (i m v i M i ). (This is the first instance where carries occur; in fact, they occur at every position in the sum, and the result has all nonzero digits.) Sorting the result gives the (q + 1)th term in the RATS sequence, 1q(q + 1) q m 1 1 (q + ) q m... v M+mv 1+ +q m v q (M 1+ +M q 1) (v + 1) Mq 1. (4.8) We seek to choose the m i s such that the (q + 1)th term is identical to the first term of the RATS sequence, except that the exponent of v in (4.8) should e one larger than the exponent of v in (4.), the starting element. Comparing exponents in (4.) and (4.8) for all digits except v leads to the following set of equations: m 1 = 1, m = 0, m 3 = 0,. m q 1 = 0, m q = 1, m q+1 = q m 1 1 = q 1, m q+ = q m = 0, m q+3 = q m 3 = 0, (4.9) and. m q 1 = q m q 1 = 0, m q = q m q = q, m i = q m i q for q < i apple v 1, M q 1 = m i. (4.10) Note that these conditions automatically imply that the exponent of v in (4.8) must e one larger than that in (4.). This is due to the fact that the total numer

10 INTEGERS: 14 (014) 10 of digits is preserved y the RATS process in every step leading from (4.) to (4.8) except for the final step, where carries result in one additional digit. We see that (4.9) immediately gives nonnegative integer values of m i for 1 apple i apple v 1. What remains is to show that m v and the quantities M j defined y (4.7) and (4.4) are nonnegative integers. Furthermore, we need to ensure that the exponents of the growing digit in (4.) (4.6) and (4.8) are all nonnegative, in order for these expressions to make sense. For m v, comining (4.10), (4.4) and (4.7) for j = 1,..., q, we get that m v = M 1 + m i, 4m v = M m i, 3 4m v = M + 4 m i + 4 m i, 3 8m v = M + 8 m i + 8 m i,. Xv q q m v = M q 1 + q m i + + q m i, q m v = q Xv m i + q m i + + q m i. In particular, we get that m v = 1 q 1L(q, v), where v q apple q L(q, v) = X m i m i + m i. (4.11) Assume that m v is an integer. (We will estalish elow that this is indeed the case.) It immediately follows from (4.4) that M 1 is also an integer and that M 1 = m v = q 1 q+1 = q 1 m i Xv q apple q v m i + + X m i + q 1 1 m i + Xv q apple q m i 3 m i + + m i 1 m i + m i.

11 INTEGERS: 14 (014) 11 It follows that M 1 0, since q+1 q 1 0 and m i 0 for all 1 apple i apple v 1. Similarly, using (4.7) with j = 1, since M 1 is an integer, it follows that M is also a nonnegative integer. Continuing in this way, we see that the numers M j defined y (4.7) and (4.4) are indeed nonnegative integers. Taking M > 0 su ciently large, which we are free to choose, we get that every growing digit exponent in (4.) (4.6) and (4.8) is a nonnegative integer. Therefore, (4.) is a quasiperiodic element with quasiperiod q. To complete the proof, we will show that m v = 1 q 1L(q, v) is an integer, or equivalently, that L(q, v) 0 (mod q 1). (4.1) The remainder of the proof is roken down into cases, depending on the residue of v modulo q. We will only provide the proof for the case v 0 (mod q), as the other cases are quite similar. Suppose that v 0 (mod q). Then v = sq for some s 1. By (4.11), Xv q L(q, v) = apple q = (s 1)q X apple q Using (4.9) and (4.10), we see that sq X1 m i + + sq X m i m i + sq X1 m i + m i (4.13) m i. m i = ( q 1) + q + q ( q 1) + q + + (s )q + (s )q ( q 1) = 1 + q + q (s 1)q + + Xs 1 = qj. j=0 For the remaining sums in the definition of L(q, v), notice that m i = 0 for v q+1 < i < v, so the sums inside the parenthesis of (4.13) are identical, with the exception of the first sum, P (s 1)q m i, which is missing the term (s )q ( q 1). Thus, we get that Xs 1 L(q, v) = (q q 1) j=0 qj (s )q ( q 1) X s 1 + Xs 1 = ( q (q 1) + 1) qj (s 1)q ( q 1). j=0 j=0 qj

12 INTEGERS: 14 (014) 1 Reducing modulo q 1, it follows that Xs 1 (1(q 1) + 1) 1 (mod q 1) j=0 sq (mod q 1) v (mod q 1) ( q 1)k (mod q 1) 0 (mod q 1). Therefore, (4.1) holds, as desired. Similar computations for the remaining cases exhaust all possiilities for the residue of v modulo q, which gives that m v is always a nonnegative integer. Theorem 4.3 shows that the asymptotic density of ases with nonempty quasiperiod sets is higher than the lower ound given y Corollary Corollary 4.4. With as in (4.1), we have Proof. By Theorem 4.1, any ase 1, 10 (mod 18) is such that Q. By Theorem 4.3 for q = 3, any ase 1 (mod 49) is such that 3 Q. The set of ases that are either congruent to 1, 10 (mod 18) or 1 (mod 49) has asymptotic density (1/9) + (1/49)(1 1/9) y the Chinese remainder theorem. It follows immediately that (1/9) + (1/49)(1 1/9). Theorems 4.1 and 4.3 also imply that there exist ases such that Q contains any prescried finite set of distinct positive integers > 1. Corollary 4.5. For any set A = {q 1, q,..., q k } of distinct positive integers > 1, there exists a ase such that A Q. Proof. Let = 18( q1 1) ( q 1) ( q k 1) + 1. Then 1 (mod 18) and 1 (mod ( qi 1) ) for each i. The first condition implies that Q y Theorem 4.1 and the second condition implies that q i Q for any q i >, y Theorem 4.3. Corollary 4.5 shows that there are ases with aritrarily large quasiperiod sets. However, it is still unknown if there are ases with distinct quasiperiodic RATS sequences with the same quasiperiod. It is conjectured that this is never the case. Conjecture (Cooper and Shattuck, [7]). No ase has two or more distinct quasiperiodic RATS sequences with the same quasiperiod.

13 INTEGERS: 14 (014) 13 The definition for quasiperiodic sequences can sometimes seem rather narrow. However, all computational evidence compiled so far has yielded that the ehavior of RATS sequences always fit the descriptions of ultimately periodic or ultimately quasiperiodic sequences. We conjecture that this is always the case. Conjecture. In any ase, every RATS sequence is ultimately periodic or ultimately quasiperiodic. 5. Behavior of Growing Digits In this section we introduce a finite map, f, that descries the ehavior of growing digits in a quasiperiodic sequence in ase. We estalish properties of this map and use these results to prove nonexistence results for quasiperiodic sequences in certain ases. We egin with Conway s sequence 7! 13 m 4 4 7! 5 6 m 7 4 7! 13 m ! 5 6 m !. (5.1) as a motivating example. By examining this sequence, it is clear that 3 is the growing digit associated with the quasiperiodic element 13 m 4 4. When performing the reverse-add portion of the RATS process, we see that the digit 3 primarily lines up against itself in the sum. This is the reason that 6 = is the growing digit of the next term in the sequence, 5 6 m 7. Performing the reverse-add portion of the RATS process, again, we see that the digit 6 primarily lines up against itself in the sum. Due to a propagating carry, the most popular digit of the next iterate is again 3, since (mod 10). In general, if k is the growing digit of some quasiperiodic element in ase, and k < /, then k is the growing digit of the next term in the RATS sequence. If k /, then a propagating carry makes k+1 the growing digit of the next term in the RATS sequence. Motivated y this idea, we make the following definition. Definition 5.1. Given a ase, let ( k if 0 < k < /, f (k) = k + 1 if / apple k <. For a nonnegative integer t, let f t (k) = f (f t 1 (k)) if t 1 and f 0 (k) = f (k). Proposition 5.. Suppose that is a ase with a quasiperiodic element n. If k is the growing digit of n, then f (k) is the growing digit of R (n). In particular, if n is quasiperiodic with quasiperiod q, then f q (k) = k.

14 INTEGERS: 14 (014) 14 Proof. The discussion aove Definition 5.1 shows that given an element n, if the digit k 6= ( 1)/ appears in n with a vastly higher count than all other digits comined, then f (k) gives the digit that will e the most popular in R (n). Applying this reasoning to the growing digit of a quasiperiodic element, we otain the desired result. The case where k = ( 1)/ is the most popular digit if n requires some additional care. In this case, the predominant digit of R (n) could e either 1 or 0, depending on the existence of carries to the right of the lock of digits k. However, since the RATS process discards zero digits, this would result in R (n) having fewer digits than n (for n large enough), a contradiction to the definition of a quasiperiodic element. Thus, if n is a quasiperiodic element with growing digit k = ( 1)/, then the growing digit of R (n) must e k = 1 = f (k). From the aove work, it follows that f q (k) = k y repeating the aove reasoning q times. Example 5.3. From (5.1), the growing digit of 13 m 4 4 is 3 and f 10(3) = f 10 (6) = 3. Definition 5.4. Given a ase and a digit 0 < k <, we say that k is a fixed point of f if there is a t > 0 such that f t (k) = k. If t is the least integer with this property, we say that the order of k is t. Corollary 5.5. The quasiperiod of a quasiperiodic element is a multiple of the order of the corresponding growing digit with respect to the map f. Proof. Suppose that k is the growing digit of a quasiperiodic element with quasiperiod q. By Proposition 5., f q (k) = k; that is, k is a fixed point of f. Suppose that the order of k is t. By the Euclidean algorithm, there are nonnegative integers s and r such that q = st + r with 0 apple r < t. Then k = f q st+r (k) = f (k) = f r st (f (k)) = f r (k). If r > 0, then we have a contradiction to the assumed order of k. Hence r = 0 and t q. Therefore, the quasiperiod of a quasiperiodic element is a multiple of the order of the corresponding digit. The aove results show that the growing digit of a quasiperiodic element is a fixed point of the corresponding map f. However, the converse is not true in general. The element 1 is always a fixed point (of order 1), ut is never a growing digit of a quasiperiodic element, as the following results show. Lemma 5.6. For any ase, k is a fixed point of order 1 if and only if k = 1. Proof. ()) If k is a fixed point of order 1, then either k = f (k) = k or k = f (k) = k + 1. The first case gives that k = 0, which is a contradiction, since k > 0, and the second case gives that k = 1. (() A simple calculation shows that, since > 1, 1 /, so f ( 1) = ( 1) + 1 = 1.

15 INTEGERS: 14 (014) 15 Lemma 5.7. For any ase, if a quasiperiodic element has growing digit k, then k 6= 1. We leave the proof of Lemma 5.7 to the reader. Theorem 5.8. For any ase, we have 1 / Q. In other words, in any ase, there are no quasiperiodic elements with quasiperiod 1. Proof. Some simple computations show that all RATS sequences in ase are periodic, giving that Q = ;. So the assertion holds for =. Suppose > and that there is a quasiperiodic element n with quasiperiod 1 and growing digit k. By Corollary 5.5, k must e a fixed point of f of order 1. By Lemma 5.6, k must e 1, a contradiction to Lemma 5.7. Theorem 5.8 serves as an analogue of the fact that 1 / P (see [3, Theorem 1] for the case = 10) for any ase >. The result is slightly di erent in that ase does not play a special role. Continuing in this same vein, we investigate the existence (or nonexistence) of fixed points of f of a given order for general ases. Lemma 5.9. For any ase >, there is a fixed point of f of order if and only if 1 (mod 3). Proof. ()). Suppose that k is a fixed point of f of order. We consider four cases. Case 1. 0 < k, f (k) < /. Then k = f (k) = 4k, which implies that k = 0, a contradiction, since k > 0. So this case cannot happen. Case. 0 < k < / apple f (k) <. Then k = f (k) = (k) + 1 = 4k + 1. This equation is equivalent to 3k = 1, which implies that 1 (mod 3). Case 3. 0 < f (k) < / apple k <. Then k = f (k) = (k +1 ) = 4k +. This equation is equivalent to 3k = ( 1), which implies that 1 (mod 3). Case 4. / apple k, f (k) <. Then k = f (k) = (k+1 )+1 = 4k+3 3. This equation is equivalent to k = 1, a contradiction, since, y Lemma 5.7, k < 1. So this case cannot happen. Having exhausted all possiilities, we see that we must have that 1 (mod 3). (() Suppose that 1 (mod 3). Let k = ( 1)/3. Then, since 0 < k < /, f (k) = k = ( 1)/3. For 4 we have ( 1)/3 > /, so f (k) = 4( 1)/3 + 1 = ( 1)/3 = k. Therefore, k is a fixed point of f of order. Corollary If Q, for some ase >, then 1 (mod 3). Proof. The result follows from Lemma 5.9 and Proposition 5..

16 INTEGERS: 14 (014) 16 Corollary 5.10 shows that the density of ases containing a quasiperiodic sequence with quasiperiod is at most 1/3. On the other hand, Theorem 4.1 shows that quasiperiodic sequences with quasiperiod exist in any ase satisfying 1 (mod 18) or 10 (mod 18). Hence this density is at least 1/9. The following lemma shows that, for any given order t, there is a such that f has a fixed point of order t. It should not e surprising that this is the case, as Theorems 4.1 and 4.3 show that quasiperiodic sequences can e constructed for any desired quasiperiod. What is interesting aout the lemma is that the ases in the statement do not match the form of those in Theorems 4.1 and 4.3. Lemma If = t, then 1 is a fixed point of order t. Proof. The lemma follows quickly from noticing that, for = t, we have f s (1) = s for 1 apple s < t, and f t(1) = t + 1 = 1. Results like Corollary 5.10 and Lemma 5.11 can e used to narrow down ases that allow the existence of quasiperiodic RATS sequences of a specified quasiperiod. So if we are interested in finding quasiperiodic RATS sequences, y Proposition 5., it seems natural to search for ases that have many fixed points of f. Definition 5.1. For a ase, let S = {k : 0 < k <, f t (k) = k for some t}. In other words, S is the set of all fixed points of f. The following result gives an exact description of ases for which f has only one fixed point. Notice that y Lemma 5.6, 1 is always a fixed point of f, so we always have S 1. Theorem For any ase >, we have S = 1 if and only if = t + 1 for some positive integer t. Proof. (() Assume that = t + 1 for some positive integer t. If t = 1, then = = 3, and direct verification shows that in this case, k = is the only fixed point of f. Hence, S = 1. Suppose now that t. Let {1,,..., 1} = S 1 i=0 A i, where A i = {k : 0 < k <, i k}. In other words, we partition the set {1,,..., 1} according to the highest power of dividing each digit. Notice that all ut finitely many A i s are empty; in particular, since 1 = t, we have {1,,..., 1} = S t i=0 A i. The set A 0 represents all odd numers in {1,..., t }. Let m A 0. If m < /, then f (m) = m. If m /, then f (m) = m + 1 = m t. Since f (m) and 4 - f (m) in either case, we get that f (A 0 ) A 1. Now let m 0 A 1. Then m 0 = m 00 with - m 00. In particular, m 00 A 0. Since m 00 = m 0 / < /, f (m 00 ) = m 00 = m 0. So we get that A 1 f (A 0 ). Therefore, we have f (A 0 ) = A 1. Continuing in this fashion, we get that f (A i ) = A i+1 for 0 apple i < t. Notice that A t = { t }, so for any starting digit k, there is a t 0 such that f t0(k) = t. Since, y

17 INTEGERS: 14 (014) 17 Lemma 5.6, 1 = t is a fixed point of order one, there cannot e any other fixed points. This is equivalent to the statement that S = 1. ()) For the converse direction, we first note that if m is such that 0 < m <, then, y Definition 5.1, 8 m ><, m + 1 if m is even and is odd, f 1 ; if m is odd and is odd, (m) = (5.) m if m is even and is even, >: m + 1 if m is odd and is even. We will use this fact extensively in this portion of the proof. Assume now that S = 1. By Lemma 5.6, we know that 1 is a fixed point of f, so S = { 1}. By the pigeonhole principle, for every 0 < k < 1 there is a t > 0 such that f t(k) is a fixed point of f. By assumption, 1 is the only fixed point, so f t 1 (k) = 1. In particular, f ( 1) > 1, which, y (5.), implies 1 is even and c( 1) f 1 ( 1) = : 1 apple c apple, where c runs through integers in the given range. Thus must e of the form 1 = i0 0 with i 0 > 0 and - 0. If i 0 > 1, then using (5.) again, we get c( 1) f ( 1) = : 1 apple c apple 4. 4 Continuing in this way, we see that, for 1 apple i apple i 0, In particular, for 1 apple i apple i 0, f i ( 1) = c( 1) i : 1 apple c apple i. f i ( 1) = i. (5.3) Notice that for i < i 0, the elements in f i ( 1) are all even, ut in f i0 ( 1), half of the elements are odd. This implies, y (5.), that f (i0+1) ( 1) = f i0 ( 1) and hence f (i0+t) ( 1) = f i0 ( 1) for all t > 0. Hence {0 < k < : k odd} f i0 ( 1). Since, y (5.3), f i0 ( 1) contains i0 elements, and, y the aove oservation, half of these elements are odd, this implies that #{0 < k < : k odd} apple i0 1 and hence ( 1)/ = i0 1 0 apple i0 1. Thus 0 = 1 and = i = i0 +1, so is of the desired form. In the case i 0 = 1, a similar argument shows that = = 3, which is also of the desired form.

18 INTEGERS: 14 (014) 18 Corollary For any ase = t + 1, where t 0, we have Q = ;. In other words, there are no quasiperiodic RATS sequences in ase = t + 1. Proof. Suppose that there is a quasiperiodic element n in ase = t + 1. By Proposition 5., the growing digit of n must e fixed point of f. Theorem 5.13 shows that if = t + 1, then the only fixed point of f is 1. It follows that 1 must e the growing digit of n, a contradiction to Lemma 5.7. Therefore, there are no quasiperiodic RATS sequences in ase. Corollary 5.14 shows that there is an infinite family of ases for which no quasiperiodic RATS sequences exist. Unfortunately, this is not enough to conclude that all sequences in such ases are ultimately periodic. For example, McMullen s conjecture [5], that all RATS sequences are ultimately periodic for ases 4 apple < 10, is still open in the cases = 5 = + 1 and = 9 = References [1] John H. Conway, Play it again and again..., Quantum, 63:30 31, Novemer/Decemer [] Curtis Cooper and Roert E. Kennedy, Base 10 RATS Cycles and Aritrarily Long Base 10 RATS Cycles, Applications of Fionacci numers, Vol. 8 (Rochester, NY, 1998), pages Kluwer Acad. Pul., Dordrecht, [3] Curtis Cooper and Roert E. Kennedy, On Conway s RATS, Mathematics in College (1998), Availale at [4] Karen Gentges, On Conway s RATS, Master s thesis, Central Missouri State University, [5] Richard K. Guy, Conway s RATS and other reversals, Amer. Math. Monthly, 96:45 48, [6] Richard K. Guy, Unsolved Prolems in Numer Theory, Prolem Books in Mathematics. Springer-Verlag, New York, third edition, 004. [7] Steven Shattuck and Curtis Cooper, Divergent RATS sequences, Fionacci Quart., 39(): , 001.

Conway s RATS Sequences in Base 3

Conway s RATS Sequences in Base 3 3 47 6 3 Journal of Integer Sequences, Vol. 5 (0), Article.9. Conway s RATS Sequences in Base 3 Johann Thiel Department of Mathematical Sciences United States Military Academy West Point, NY 0996 USA johann.thiel@usma.edu

More information

SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS

SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS #A42 INTEGERS 14 (2014) SOME GENERAL RESULTS AND OPEN QUESTIONS ON PALINTIPLE NUMBERS Benjamin V. Holt Department of Mathematics, Humoldt State University, Arcata, California vh6@humoldt.edu Received:

More information

Equidivisible consecutive integers

Equidivisible consecutive integers & Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics

More information

Upper Bounds for Stern s Diatomic Sequence and Related Sequences

Upper Bounds for Stern s Diatomic Sequence and Related Sequences Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:

More information

Chaos and Dynamical Systems

Chaos and Dynamical Systems Chaos and Dynamical Systems y Megan Richards Astract: In this paper, we will discuss the notion of chaos. We will start y introducing certain mathematical concepts needed in the understanding of chaos,

More information

Exploring Lucas s Theorem. Abstract: Lucas s Theorem is used to express the remainder of the binomial coefficient of any two

Exploring Lucas s Theorem. Abstract: Lucas s Theorem is used to express the remainder of the binomial coefficient of any two Delia Ierugan Exploring Lucas s Theorem Astract: Lucas s Theorem is used to express the remainder of the inomial coefficient of any two integers m and n when divided y any prime integer p. The remainder

More information

Notes on Systems of Linear Congruences

Notes on Systems of Linear Congruences MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the

More information

Standard forms for writing numbers

Standard forms for writing numbers Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,

More information

STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS

STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS #A INTEGERS 6 (206) STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS Elliot Catt School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, New South Wales, Australia

More information

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1

More information

Chapter 3 Basic Number Theory

Chapter 3 Basic Number Theory Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of

More information

COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF

COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results

More information

CHAPTER 3. Congruences. Congruence: definitions and properties

CHAPTER 3. Congruences. Congruence: definitions and properties CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write

More information

CHAPTER 6. Prime Numbers. Definition and Fundamental Results

CHAPTER 6. Prime Numbers. Definition and Fundamental Results CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n

More information

The Composite Two-Step

The Composite Two-Step 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 20 (2017), Article 17.9.1 The Composite Two-Step Eric Kaper Department of Mathematics University of Kentucky Lexington, KY 40506 USA eric.kaper@uky.edu

More information

SVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof)

SVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof) JOURNAL OF MODERN DYNAMICS VOLUME 4, NO. 4, 010, 637 691 doi: 10.3934/jmd.010.4.637 STRUCTURE OF ATTRACTORS FOR (a, )-CONTINUED FRACTION TRANSFORMATIONS SVETLANA KATOK AND ILIE UGARCOVICI (Communicated

More information

Fermat numbers and integers of the form a k + a l + p α

Fermat numbers and integers of the form a k + a l + p α ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac

More information

Math 110 HW 3 solutions

Math 110 HW 3 solutions Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r

More information

New Constructions of Sonar Sequences

New Constructions of Sonar Sequences INTERNATIONAL JOURNAL OF BASIC & APPLIED SCIENCES IJBAS-IJENS VOL.:14 NO.:01 12 New Constructions of Sonar Sequences Diego F. Ruiz 1, Carlos A. Trujillo 1, and Yadira Caicedo 2 1 Department of Mathematics,

More information

A misère-play -operator

A misère-play -operator A misère-play -operator Matthieu Dufour Silvia Heubach Urban Larsson arxiv:1608.06996v1 [math.co] 25 Aug 2016 July 31, 2018 Abstract We study the -operator (Larsson et al, 2011) of impartial vector subtraction

More information

THESIS. Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University

THESIS. Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University The Hasse-Minkowski Theorem in Two and Three Variables THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By

More information

A Division Algorithm Approach to p-adic Sylvester Expansions

A Division Algorithm Approach to p-adic Sylvester Expansions arxiv:1508.01503v1 [math.nt] 6 Aug 2015 A Division Algorithm Approach to p-adic Sylvester Expansions Eric Errthum Department of Mathematics and Statistics Winona State University Winona, MN E-mail: eerrthum@winona.edu

More information

Part V. Chapter 19. Congruence of integers

Part V. Chapter 19. Congruence of integers Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277

More information

MATH 361: NUMBER THEORY FOURTH LECTURE

MATH 361: NUMBER THEORY FOURTH LECTURE MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the

More information

#A67 INTEGERS 18 (2018) ON THE NESTED LOCAL POSTAGE STAMP PROBLEM

#A67 INTEGERS 18 (2018) ON THE NESTED LOCAL POSTAGE STAMP PROBLEM #A67 INTEGERS 18 (2018) ON THE NESTED LOCAL POSTAGE STAMP PROBLEM Edgar Federico Elizeche Department of Mathematics, St. Stephen s College, University of Delhi, Delhi 110007, India edgar.federico@elizeche.com

More information

THE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY

THE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY THE BALANCED DECOMPOSITION NUMBER AND VERTEX CONNECTIVITY SHINYA FUJITA AND HENRY LIU Astract The alanced decomposition numer f(g) of a graph G was introduced y Fujita and Nakamigawa [Discr Appl Math,

More information

The first property listed above is an incredibly useful tool in divisibility problems. We ll prove that it holds below.

The first property listed above is an incredibly useful tool in divisibility problems. We ll prove that it holds below. 1 Divisiility Definition 1 We say an integer is divisile y a nonzero integer a denoted a - read as a divides if there is an integer n such that = an If no such n exists, we say is not divisile y a denoted

More information

SECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C

SECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C p-stability OF DEGENERATE SECOND-ORDER RECURRENCES Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C. 20064 Walter Carlip Department of Mathematics and Computer

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

NUMBERS WITH INTEGER COMPLEXITY CLOSE TO THE LOWER BOUND

NUMBERS WITH INTEGER COMPLEXITY CLOSE TO THE LOWER BOUND #A1 INTEGERS 12A (2012): John Selfridge Memorial Issue NUMBERS WITH INTEGER COMPLEXITY CLOSE TO THE LOWER BOUND Harry Altman Department of Mathematics, University of Michigan, Ann Arbor, Michigan haltman@umich.edu

More information

Polynomials Characterizing Hyper b-ary Representations

Polynomials Characterizing Hyper b-ary Representations 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.4.3 Polynomials Characterizing Hyper -ary Representations Karl Dilcher 1 Department of Mathematics and Statistics Dalhousie University

More information

PERIODIC POINTS OF THE FAMILY OF TENT MAPS

PERIODIC POINTS OF THE FAMILY OF TENT MAPS PERIODIC POINTS OF THE FAMILY OF TENT MAPS ROBERTO HASFURA-B. AND PHILLIP LYNCH 1. INTRODUCTION. Of interest in this article is the dynamical behavior of the one-parameter family of maps T (x) = (1/2 x

More information

The Collatz Problem and Analogues

The Collatz Problem and Analogues 2 3 47 6 23 Journal of Integer Sequences, Vol. (2008), Article 08.4.7 The Collatz roblem and Analogues Bart Snapp and Matt Tracy Department of Mathematics and Statistics Coastal Carolina University Conway,

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

The Impossibility of Certain Types of Carmichael Numbers

The Impossibility of Certain Types of Carmichael Numbers The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the

More information

Lecture 7: More Arithmetic and Fun With Primes

Lecture 7: More Arithmetic and Fun With Primes IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 7: More Arithmetic and Fun With Primes David Mix Barrington and Alexis Maciel July

More information

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

More information

On the counting function for the generalized. Niven numbers

On the counting function for the generalized. Niven numbers On the counting function for the generalized Niven numbers R. C. Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño Introduction Let q 2 be a fied integer and let f be an arbitrary

More information

NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS

NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in

More information

#A42 INTEGERS 10 (2010), ON THE ITERATION OF A FUNCTION RELATED TO EULER S

#A42 INTEGERS 10 (2010), ON THE ITERATION OF A FUNCTION RELATED TO EULER S #A42 INTEGERS 10 (2010), 497-515 ON THE ITERATION OF A FUNCTION RELATED TO EULER S φ-function Joshua Harrington Department of Mathematics, University of South Carolina, Columbia, SC 29208 jh3293@yahoo.com

More information

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime. PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice

More information

Zeroing the baseball indicator and the chirality of triples

Zeroing the baseball indicator and the chirality of triples 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.1.7 Zeroing the aseall indicator and the chirality of triples Christopher S. Simons and Marcus Wright Department of Mathematics

More information

Euler s, Fermat s and Wilson s Theorems

Euler s, Fermat s and Wilson s Theorems Euler s, Fermat s and Wilson s Theorems R. C. Daileda February 17, 2018 1 Euler s Theorem Consider the following example. Example 1. Find the remainder when 3 103 is divided by 14. We begin by computing

More information

ZERO-SUM ANALOGUES OF VAN DER WAERDEN S THEOREM ON ARITHMETIC PROGRESSIONS

ZERO-SUM ANALOGUES OF VAN DER WAERDEN S THEOREM ON ARITHMETIC PROGRESSIONS ZERO-SUM ANALOGUES OF VAN DER WAERDEN S THEOREM ON ARITHMETIC PROGRESSIONS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu Abstract Let r and k

More information

7. Prime Numbers Part VI of PJE

7. Prime Numbers Part VI of PJE 7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.

More information

BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results

BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA

1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical

More information

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. 1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose

More information

On the counting function for the generalized Niven numbers

On the counting function for the generalized Niven numbers On the counting function for the generalized Niven numbers Ryan Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño Abstract Given an integer base q 2 and a completely q-additive

More information

EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS

EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS #A5 INTEGERS 5 (205) EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS Steve Butler Department of Mathematics, Iowa State University, Ames, Iowa butler@iastate.edu Paul Erdős

More information

Colloq. Math. 145(2016), no. 1, ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS. 1. Introduction. x(x 1) (1.1) p m (x) = (m 2) + x.

Colloq. Math. 145(2016), no. 1, ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS. 1. Introduction. x(x 1) (1.1) p m (x) = (m 2) + x. Colloq. Math. 145(016), no. 1, 149-155. ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS FAN GE AND ZHI-WEI SUN Abstract. For m = 3, 4,... those p m (x) = (m )x(x 1)/ + x with x Z are called generalized

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

CALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p

CALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p CALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p DOMINIC VELLA AND ALFRED VELLA. Introduction The cycles that occur in the Fibonacci sequence {F n } n=0 when it is reduced

More information

DIFFERENCE DENSITY AND APERIODIC SUM-FREE SETS. Neil J. Calkin Department of Mathematical Sciences, Clemson University, Clemson, SC 29634, USA

DIFFERENCE DENSITY AND APERIODIC SUM-FREE SETS. Neil J. Calkin Department of Mathematical Sciences, Clemson University, Clemson, SC 29634, USA INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(2) (2005), #A03 DIFFERENCE DENSITY AND APERIODIC SUM-FREE SETS Neil J. Calkin Department of Mathematical Sciences, Clemson University, Clemson,

More information

A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS

A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS BRIAN L MILLER & CHRIS MONICO TEXAS TECH UNIVERSITY Abstract We describe a particular greedy construction of an arithmetic progression-free

More information

POLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS

POLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS #A40 INTEGERS 16 (2016) POLYGONAL-SIERPIŃSKI-RIESEL SEQUENCES WITH TERMS HAVING AT LEAST TWO DISTINCT PRIME DIVISORS Daniel Baczkowski Department of Mathematics, The University of Findlay, Findlay, Ohio

More information

Basic elements of number theory

Basic elements of number theory Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a

More information

REGULAR TETRAHEDRA WHOSE VERTICES HAVE INTEGER COORDINATES. 1. Introduction

REGULAR TETRAHEDRA WHOSE VERTICES HAVE INTEGER COORDINATES. 1. Introduction Acta Math. Univ. Comenianae Vol. LXXX, 2 (2011), pp. 161 170 161 REGULAR TETRAHEDRA WHOSE VERTICES HAVE INTEGER COORDINATES E. J. IONASCU Abstract. In this paper we introduce theoretical arguments for

More information

Basic elements of number theory

Basic elements of number theory Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation

More information

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2 Least squares: Mathematical theory Below we provide the "vector space" formulation, and solution, of the least squares prolem. While not strictly necessary until we ring in the machinery of matrix algera,

More information

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric

More information

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4 Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES

EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES #A7 INTEGERS 15A (2015) EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES Joshua Harrington Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania JSHarrington@ship.edu Lenny

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric

More information

CHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998

CHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998 CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic

More information

Arithmetic Properties for a Certain Family of Knot Diagrams

Arithmetic Properties for a Certain Family of Knot Diagrams Arithmetic Properties for a Certain Family of Knot Diagrams Darrin D. Frey Department of Science and Math Cedarville University Cedarville, OH 45314 freyd@cedarville.edu and James A. Sellers Department

More information

1. multiplication is commutative and associative;

1. multiplication is commutative and associative; Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

More information

A Guide to Arithmetic

A Guide to Arithmetic A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully

More information

Cullen Numbers in Binary Recurrent Sequences

Cullen Numbers in Binary Recurrent Sequences Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn

More information

Math 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.

Math 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n. Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let

More information

CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)

CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q) CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition

More information

Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm

Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we

More information

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in

More information

Local Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments

Local Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments Chapter 9 Local Fields The definition of global field varies in the literature, but all definitions include our primary source of examples, number fields. The other fields that are of interest in algebraic

More information

AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS

AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS PAUL POLLACK Abstract It is well-known that Euclid s argument can be adapted to prove the infinitude of primes of the form 4k

More information

On a Balanced Property of Compositions

On a Balanced Property of Compositions On a Balanced Property of Compositions Miklós Bóna Department of Mathematics University of Florida Gainesville FL 32611-8105 USA Submitted: October 2, 2006; Accepted: January 24, 2007; Published: March

More information

Fast inverse for big numbers: Picarte s iteration

Fast inverse for big numbers: Picarte s iteration Fast inverse for ig numers: Picarte s iteration Claudio Gutierrez and Mauricio Monsalve Computer Science Department, Universidad de Chile cgutierr,mnmonsal@dcc.uchile.cl Astract. This paper presents an

More information

On Aperiodic Subtraction Games with Bounded Nim Sequence

On Aperiodic Subtraction Games with Bounded Nim Sequence On Aperiodic Subtraction Games with Bounded Nim Sequence Nathan Fox arxiv:1407.2823v1 [math.co] 10 Jul 2014 Abstract Subtraction games are a class of impartial combinatorial games whose positions correspond

More information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,

More information

GENERALIZED SHIFTS ON CARTESIAN PRODUCTS

GENERALIZED SHIFTS ON CARTESIAN PRODUCTS Indian J. pure appl. Math., 40(3): 183-190, June 2009 c Printed in India. GENERALIZED SHIFTS ON CARTESIAN PRODUCTS M. RAJAGOPALAN AND K. SUNDARESAN Department of Mathematics, Tennessee State University

More information

Je Lagarias, University of Michigan. Workshop on Discovery and Experimentation in Number Theory Fields Institute, Toronto (September 25, 2009)

Je Lagarias, University of Michigan. Workshop on Discovery and Experimentation in Number Theory Fields Institute, Toronto (September 25, 2009) Ternary Expansions of Powers of 2 Je Lagarias, University of Michigan Workshop on Discovery and Experimentation in Number Theory Fields Institute, Toronto (September 25, 2009) Topics Covered Part I. Erdős

More information

4 a b 1 1 c 1 d 3 e 2 f g 6 h i j k 7 l m n o 3 p q 5 r 2 s 4 t 3 3 u v 2

4 a b 1 1 c 1 d 3 e 2 f g 6 h i j k 7 l m n o 3 p q 5 r 2 s 4 t 3 3 u v 2 Round Solutions Year 25 Academic Year 201 201 1//25. In the hexagonal grid shown, fill in each space with a number. After the grid is completely filled in, the number in each space must be equal to the

More information

IRREDUCIBILITY TESTS IN F p [T ]

IRREDUCIBILITY TESTS IN F p [T ] IRREDUCIBILITY TESTS IN F p [T ] KEITH CONRAD 1. Introduction Let F p = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(t ) F p [T ] is irreducible that are

More information

Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables

Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables Minimizing a convex separale exponential function suect to linear equality constraint and ounded variales Stefan M. Stefanov Department of Mathematics Neofit Rilski South-Western University 2700 Blagoevgrad

More information

32 Divisibility Theory in Integral Domains

32 Divisibility Theory in Integral Domains 3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible

More information

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald)

Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures

More information

Sieving 2m-prime pairs

Sieving 2m-prime pairs Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol. 20, 2014, No. 3, 54 60 Sieving 2m-prime pairs Srečko Lampret Pohorska cesta 110, 2367 Vuzenica, Slovenia e-mail: lampretsrecko@gmail.com

More information

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also

More information

The length-ω 1 open game quantifier propagates scales

The length-ω 1 open game quantifier propagates scales The length-ω 1 open game quantifier propagates scales John R. Steel June 5, 2006 0 Introduction We shall call a set T an ω 1 -tree if only if T α

More information

FERMAT S TEST KEITH CONRAD

FERMAT S TEST KEITH CONRAD FERMAT S TEST KEITH CONRAD 1. Introduction Fermat s little theorem says for prime p that a p 1 1 mod p for all a 0 mod p. A naive extension of this to a composite modulus n 2 would be: for all a 0 mod

More information

Extend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1

Extend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1 Extend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1 Nico F. Benschop AmSpade Research, The Netherlands Abstract By (p ± 1) p p 2 ± 1 mod p 3 and by the lattice structure of Z(.) mod q

More information

arxiv: v1 [math.co] 21 Sep 2015

arxiv: v1 [math.co] 21 Sep 2015 Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded

More information

THE S-ELEMENTARY WAVELETS ARE PATH-CONNECTED. D. M. Speegle

THE S-ELEMENTARY WAVELETS ARE PATH-CONNECTED. D. M. Speegle THE S-ELEMENTARY WAVELETS ARE PATH-CONNECTED D. M. Speegle Abstract. A construction of wavelet sets containing certain subsets of R is given. The construction is then modified to yield a continuous dependence

More information

ON Z.-W. SUN S DISJOINT CONGRUENCE CLASSES CONJECTURE

ON Z.-W. SUN S DISJOINT CONGRUENCE CLASSES CONJECTURE INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7(2) (2007), #A30 ON Z.-W. SUN S DISJOINT CONGRUENCE CLASSES CONJECTURE Kevin O Bryant Department of Mathematics, City University of New York,

More information

#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES

#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES #A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of

More information

THE SOLOVAY STRASSEN TEST

THE SOLOVAY STRASSEN TEST THE SOLOVAY STRASSEN TEST KEITH CONRAD 1. Introduction The Jacobi symbol satisfies many formulas that the Legendre symbol does, such as these: for a, b Z and odd m, n Z +, (1) a b mod n ( a n ) = ( b n

More information

ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL NUMBERS. Ryan Gipson and Hamid Kulosman

ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL NUMBERS. Ryan Gipson and Hamid Kulosman International Electronic Journal of Algebra Volume 22 (2017) 133-146 DOI: 10.24330/ieja.325939 ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL

More information