Collatz cycles with few descents
|
|
- Denis Gregory
- 5 years ago
- Views:
Transcription
1 ACTA ARITHMETICA XCII.2 (2000) Collatz cycles with few descents by T. Brox (Stuttgart) 1. Introduction. Let T : Z Z be the function defined by T (x) = x/2 if x is even, T (x) = (3x + 1)/2 if x is odd. T is known as the 3x + 1 function (see [4], [7]). We are interested in the cycles of T, referred to as 3x + 1 cycles (see [3] [5]). The well known Finite Cycle Conjecture asserts that T has only finitely many cycles. In this note we generalize a theorem due to R. Steiner (see [4], [6]). In order to state the result in a concise form, we consider instead of T a slightly different function T 1 defined by the unique decomposition (1.1) 2 k(x) T 1 (x) = 3x + 1 (x odd), where k(x) 1 is the multiplicity of the prime factor 2 in the number 3x+1. Note that T 1 is only defined for odd integers. For each odd argument the iteration T k(x) (x) is equal to T 1 (x). An odd integer x is called descending if k(x) 2. In what follows, a cycle of T 1 is called a Collatz cycle. By definition, we can represent a Collatz cycle by a tuple Γ = (x 1,..., x n ) consisting of distinct odd integers (n 1). By Γ we denote the number of elements in Γ, i.e. the period of the Collatz cycle. Each Collatz cycle consists of the odd elements in a 3x + 1 cycle, and conversely. If k denotes the sum of k(x) over all elements of a Collatz cycle, then k is the period of the corresponding 3x + 1 cycle. Let δ(γ ) be the number of descending elements in a Collatz cycle Γ. Theorem 1.1. The number of Collatz cycles satisfying δ(γ ) < 2 log Γ is finite. We will prove Theorem 1.1 in the following sections. In Section 4 we briefly discuss the extension of Theorem 1.1 to 3x + d mapping (see [2]). The theorem of R. Steiner states that the fixed point 1 is the only positive 2000 Mathematics Subject Classification: 11D61, 11Z05. [181]
2 182 T. Brox Collatz cycle with δ(γ ) = 1. It is easy to deduce the following corollary of Theorem 1.1, using Lemma 2.2 in Section 2. Corollary 1.2. For each fixed ν 1 the number of Collatz cycles with δ(γ ) ν is finite. 2. A divisibility problem. In this section we express the existence problem of a Collatz cycle by an appropriate periodic sequence (see Sections 2, 5 of [3]). Given an odd integer x 0, consider the iteration x m = T 1 (x m 1 ). Let k m = k(x m 1 ). Because of (1.1), we get (2.1) 2 k m x m = 3x m (m 1), where it is required that x 1, x 2,... are odd. Proceeding iteratively, we immediately obtain (2.2) 2 k k m x m = 3 m x 0 + ϕ m 1 (k 1,..., k m 1 ). Here ϕ 0 = 1 and (2.3) ϕ m (u 1,..., u m ) = m 3 m l 2 u u l ((u 1,..., u m ) R m ), l=0 where u u l is zero if l = 0. For further references see Section 2 of [3]. Assume now (x 0,..., x n 1 ) is a Collatz cycle. By construction, k i 1 for 1 i n. Since x n = x 0, (2.2) implies where Mx 0 = ϕ n 1 (k 1,..., k n 1 ), (2.4) M = 2 k 3 n, k = k k n. Consider (x 0,..., x n 1 ) and (k 1,..., k n ) as n-periodic sequences {x i } i Z, {k i } i Z. Since we can take each x i as start value, we obtain (2.5) Mx i = ϕ n 1 (k i+1,..., k i+n 1 ) (i Z). Hence M divides the right hand side of (2.5) for each i. Since the Collatz cycle consists of distinct elements, n is the smallest period of {k i }, by (2.5). Conversely, let {k i } i Z be any periodic sequence of positive integers. Let n be the smallest period of {k i }. Define M and k by (2.4). Let F i = ϕ n 1 (k i+1,..., k i+n 1 ) (i Z). Note that F i does not depend on k i. Plainly {F i } is n-periodic. Because of (2.3) and periodicity, we get by a simple computation (2.6) 2 k i F i = 3F i 1 + M (i Z).
3 Collatz cycles with few descents 183 Since each k i is positive, we conclude from (2.3) and (2.4) that (2.7) (2.8) gcd(2 3, F i ) = 1 gcd(2 3, M) = 1. (i Z), Because of (2.6) and (2.7), k i and F i are uniquely determined by F i 1. If F l = F m, then m l is a period of {k i }. Hence F 1,..., F n are distinct. We are now ready to prove the following lemmas (see also Section 5 of [3]). Lemma 2.1. Let M = 2 k 3 n. Then either M F i (1 i n) or M F i (1 i n). The latter case corresponds to a Collatz cycle (x 1,..., x n ), where x i = F i /M. P r o o f. Assume that M F i for one i. Then (2.6) (2.8) imply that for all i, M F i and x i = F i /M is odd. Dividing (2.6) by M, we arrive at x i = T 1 (x i 1 ), since each x i is odd. Plainly x 1,..., x n are distinct. Lemma 2.2. If {k i } generates a Collatz cycle, then k = k k n 2n. In particular, for each n 1, the number of Collatz cycles with Γ = n is finite. P r o o f. If {k i } generates a Collatz cycle, then x i = F i /M, by Lemma 2.1. If we multiply (2.6) from i = 1 to i = n, a simple reduction yields n 2 k = (3 + 1/x i 1 ) 4 n, i=1 since 1/x i 1. Hence k 2n. Remark 2.3. By Lemma 2.1, since k i = 1 (i Z) has period 1, there exists at most one Collatz cycle with δ(γ ) = 0, and this Collatz cycle has to be a fixed point. In fact, 1 = 1/(2 3) is a non-descending fixed point. 3. Algebraic reformulation. In order to prove Theorem 1.1, we reformulate the divisibility problem in a more convenient form. As before let {k i } i Z be a periodic sequence of positive integers. Let n be the smallest period of {k i }. Define ϕ n (u 1,..., u n ) = 2 u 1 ϕ n 1 (u 2,..., u n ) 2ϕ n 1 (u 1,..., u n 1 ) Because of (2.3), we obtain ((u 1,..., u n ) R n ). n 1 (3.1) ϕ n (u 1,..., u n ) = 2 3 n (l+1) 2 u u l {2 ul+1 1 1}. For each i Z define l=0 F i = ϕ n (k i+1,..., k i+n ).
4 184 T. Brox Then (2.6) implies (3.2) Fi = 2 k i+1 F i+1 2F i = F i + M (i Z). Let ν be the number of indices i such that 1 i n and k i 2. We assume ν 1. Define strictly ascending numbers τ(1),..., τ(ν) by 1 τ(j) n and k τ(j) 2. Put τ(0) = τ(ν) n. For 1 j ν let h j = k τ(j) 1, n j = τ(j) τ(j 1). Consider (h 1,..., h ν ), (n 1,..., n ν ) as ν-periodic sequences {h i } i Z, {n i } i Z. By construction, the two sequences consist of positive integers, and ν is the smallest common period. Also by construction, (3.3) n = n n ν, k = h + n, where (3.4) h = h h ν. Given (t 0,..., t ν 1 ) R ν and (u 1,..., u ν 1 ) R ν 1, put (3.5) ψ 2ν 1 (t 0, u 1, t 1, u 2,..., t ν 1 ) ν 1 = 2 t 0+u t l 1 +u l {2 t l 1}3 u l u ν 1, l=0 where the sum in the 2-exponent (3-exponent) is zero if l = 0 (l = ν 1). For each j Z define (3.6) H j = ψ 2ν 1 (h j, n j+1, h j+1, n j+2,..., h j+ν 1 ). Thus H j does not depend on n j. Note that H j > 0 for each j Z. Note also that {H j } is ν-periodic. We assert (3.7) Fτ(j) = 2 n j+1 H j+1 (j Z). By shift, it is enough to verify (3.7) for j = 0. Also by shift, we can assume that τ(0) = 0. Then τ(j) equals n n j (1 j ν). In (3.1) only those terms can survive which are placed at l + 1 = τ(j). Hence ν F τ(0) = 2 3 n τ(j) 2 h h j 1 +τ(j) 1 {2 h j 1}. j=1 In the last formula we take the 2-exponent n 1 1 outside the sum. After some rearrangement, the remaining sum is easily identified as H 1. Conversely, let {h j } j Z, {n j } j Z be any periodic sequences consisting of positive integers. Let ν be the smallest common period of both sequences. Define h, k, n by (3.3) and (3.4). Let H j be given by (3.6). Up to shift, {k i } is uniquely determined by both sequences, i.e. by {h 0, n 1, h 1, n 2,...}. Also n is the smallest period of {k i }. Because of (2.8), (3.2) and (3.7), we can reformulate Lemma 2.1.
5 Collatz cycles with few descents 185 Lemma 3.1. Let M = 2 k 3 n. Then either M H j (1 j ν) or M H j (1 j ν). The latter case corresponds to a Collatz cycle with Γ = n and δ(γ ) = ν. 4. Minimum of the H-sequence. In this section we prove Theorem 1.1 assuming the truth of Lemma 5.1, which will be stated and proved in Section 5. Consider a pair {h j } j Z, {n j } j Z of periodic sequences consisting of positive integers. Define ν, h, k, n as described in the preceding section. By Lemma 3.1, since each H j > 0, the two sequences cannot generate a Collatz cycle if (4.1) min 0 j ν 1 H j < M = 2 k 3 n. To prove Theorem 1.1, it is enough, by Lemma 2.2 and Remark 2.3, to show (4.1) holds for all sufficiently large n, assuming that ν < 2 log n. First we consider the left hand side of (4.1). Let θ = log 2 3 and θ 1 = θ 1. Note that θ 1 > 0. In order to estimate H j, we replace the bracket inside (3.5) by 2 h j+l. Because of periodicity, an easy rearrangement yields ν 1 3 n H j < 2 n j+s j,l (j Z), where S j,l = l=0 l (h j+i θ 1 n j+i ) (l 0). As a functional of both sequences define By an elementary estimation, We claim that E = min { n j + 0 j ν 1 max min j 3 n H j < ν2 E. 0 l ν 1 S j,l}. (4.2) E max(0, ) A ν n, where A ν = θ 1 /(θ ν 1), = h θ 1 n = k θn. But (4.2) is a consequence of Lemma 5.1 below, applied with x j = θ 1 n j, y j = h j, α = 1/θ 1. Hence we obtain min j 3 n H j < ν2 max(0, ) A νn. Let γ = 1 2 log θ = If we assume that ν < 2 log n, then (θ ν 1) 1 n > θ ν n = n 1 ν log θ/ log n > n γ,
6 186 T. Brox and it follows that (4.3) min j 3 n H j < log n 2 1+max(0, ) θ 1n γ. We now consider the right hand side of (4.1). By elementary analysis we get 3 n M = 2 1 min(, 1)2 max(0, ) 1. Note that we have n 1 and k = h + n 2. By definition, < 1 if k > θn 1 and k < θn + 1, otherwise 1. A result of A. Baker and N. Feldman (see Theorem 3.1 in [1]) implies the existence of an effectively computable constant C 0 > 0 such that > k log 2 n log 3 > {max(k, n)} C 0 (k 2, n 1). Since θn + 1 > n, and therefore > {θn + 1} C 0, (4.4) 3 n M > {θn + 1} C 0 2 max(0, ) 1. If n is large enough, the right side of (4.3) is smaller than the right side of (4.4), which gives (4.1). Remark 4.1. We briefly sketch the extension of Theorem 1.1 to the 3x+d mapping, where d is a positive integer prime to 2 and 3. Define T 1 according to (1.1), where the right hand side is replaced by 3x + d. Now k(x) is the multiplicity of 2 in the number 3x+d. Define a Collatz cycle, descending and δ(γ ) as in Section 1. After an obvious modification of (2.1), in (2.2) replace ϕ m 1 by dϕ m 1. Note that the definition of ϕ m is not affected (m 0). Hence multiply the right hand side of (2.5) with d. If (2.6) is multiplied with d, it follows that F i can be replaced by df i in Lemma 2.1. Similarly to the proof of Lemma 2.2, if {k i } generates a Collatz cycle, then n 2 k = (3 + d/x i 1 ) (3 + d) n. i=1 Hence put k C 1 n in Lemma 2.2, where C 1 = log 2 (3+d). In Lemma 3.1 put dh j instead of H j. Finally multiply the left hand side of (4.1) with d. The additional factor d causes no harm for the conclusion that the inequality is true if n is large enough and ν < 2 log n. 5. Upper value of E. Let there be given an integer ν 1 and real numbers r > 0, s > 0. Let {x j } j Z, {y j } j Z be ν-periodic sequences of non-negative real numbers such that x x ν = r, y y ν = s.
7 For each j Z and l 0 define Collatz cycles with few descents 187 S j,l = l (y j+i x j+i ). Lemma 5.1. For any real α > 0, min { αx j + max S j,l} max(0, s r) r/(β ν 1), 0 j ν 1 0 l ν 1 where β = 1 + 1/α. P r o o f. (a) Reduction to the case r = s. If r s, put ỹ j = ry j /s. Then s = r and l l S j,l = (y j+i ỹ j+i ) + (ỹ j+i x j+i ) = s r l y j+i + s S j,l. Hence max S j,l max(0, s r) + max S j,l. 0 l ν 1 0 l ν 1 Thus we have to prove the assertion for the case r = s. (b) Elimination of {y j }. We suppose r = s. Then {S 0,l } l 0 is ν-periodic. By a simple shift, we can assume If 1 j ν 1, then S 0,ν 1 = max l 0 S 0,l = 0. ν 1 max S j,l = (y i x i ) = 0 l ν 1 i=j j 1 j 1 (x i y i ) x i. Note that the last inequality is sharp if y j = 0 (0 j ν 2) and y ν 1 = r. Now we have to estimate the minimum of (5.1) αx 0, αx 1 + x 0, αx 2 + x 0 + x 1,..., αx ν 1 + x x ν 2. (c) Linear optimization. Consider x = (x 0,..., x ν 1 ) as a vector in R ν. Define linear functionals L 0,..., L ν 1 according to (5.1). Let f(x) be the minimum of L 0 x,..., L ν 1 x. Let B be the affine subspace x x ν 1 = r. We assert (5.2) sup f(x) = r/(β ν 1). x B In order to prove (5.2), consider the vector b = r(β 1)(β ν 1) 1 (β 0, β 1,..., β ν 1 ). Plainly b B. An easy computation shows (5.3) L 0 b = L 1 b =... = L ν 1 b.
8 188 T. Brox Next, f(b) equals the right hand side of (5.2). Let U be the linear subspace where the sum of coordinates equals zero. If x B, then x = b + u (u U). By (5.3), f(x) = f(b) + min j L j u = f(b) + f(u) (x B). We have to show f(u) 0. Assume the contrary, that is, each number L 0 u,..., L ν 1 u is positive. Since L 0 u > 0, we get u 0 < 0. Since u 0 < 0 and L 1 u > 0, we get u 1 < 0. Repeating the argument, each u j is negative, which contradicts u U. Acknowledgements. We thank the referee for useful hints and improvements. References [1] A. B a k e r, Transcendental Number Theory, Cambridge Univ. Press, [2] E. G. Belaga and M. Mignotte, Embedding the 3x + 1 conjecture in a 3x + d context, Experiment. Math. 7 (1998), [3] L. Halbeisen and N. Hungerbühler, Optimal bounds for the length of rational Collatz cycles, Acta Arith. 78 (1997), [4] J. C. Lagarias, The 3x + 1 problem and its generalizations, Amer. Math. Monthly 92 (1985), [5], The set of rational cycles for the 3x + 1 problem, Acta Arith. 56 (1990), [6] R. P. Steiner, A theorem on the Syracuse Problem, in: Proc. 7th Manitoba Conf. on Numerical Mathematics, 1977, Winnipeg, 1978, [7] G. J. Wirsching, The Dynamical System Generated by the 3n+1 Function, Lecture Notes in Math. 1681, Springer, Berlin, Helblingstr. 21 D Stuttgart, Germany thomas.brox@daimlerchrysler.com Received on and in revised form on (3554)
arxiv: v1 [math.gm] 1 Oct 2015
A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence
More informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationCOLLATZ CONJECTURE: IS IT FALSE?
COLLATZ CONJECTURE: IS IT FALSE? JUAN A. PEREZ arxiv:1708.04615v2 [math.gm] 29 Aug 2017 ABSTRACT. For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all
More informationLINEAR FORMS IN LOGARITHMS
LINEAR FORMS IN LOGARITHMS JAN-HENDRIK EVERTSE April 2011 Literature: T.N. Shorey, R. Tijdeman, Exponential Diophantine equations, Cambridge University Press, 1986; reprinted 2008. 1. Linear forms in logarithms
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationLINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday
LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field
More informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More informationTheoretical and computational bounds for m-cycles of the 3n + 1 problem
Theoretical and computational bounds for m-cycles of the 3n + 1 problem John Simons (Groningen) Benne de Weger (Eindhoven) version 144, August 31, 2010 Abstract An m-cycle of the 3n+1-problem is defined
More informationMaximal Class Numbers of CM Number Fields
Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis
More informationEGYPTIAN FRACTIONS WITH SMALL NUMERATORS
EGYPTIAN FRACTIONS WITH SMALL NUMERATORS R.ANITHA Department of Mathematics, Saradha Gangadharan College, Puducherry Email id : anithamath09@gmail.com Dr. A.M.S. RAMASAMY Department of Mathematics, Vel
More informationA CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY
A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY KEITH A. KEARNES Abstract. We show that a locally finite variety satisfies a nontrivial congruence identity
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More information1 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 informationTHE NUMBER OF DIOPHANTINE QUINTUPLES. Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan
GLASNIK MATEMATIČKI Vol. 45(65)(010), 15 9 THE NUMBER OF DIOPHANTINE QUINTUPLES Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan Abstract. A set a 1,..., a m} of m distinct positive
More informationThe 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 informationA SHARP RESULT ON m-covers. Hao Pan and Zhi-Wei Sun
Proc. Amer. Math. Soc. 35(2007), no., 355 3520. A SHARP RESULT ON m-covers Hao Pan and Zhi-Wei Sun Abstract. Let A = a s + Z k s= be a finite system of arithmetic sequences which forms an m-cover of Z
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More information#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary
#A45 INTEGERS 9 (2009, 591-603 BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS Gyula Károlyi 1 Institute of Mathematics, Eötvös University, Pázmány P. sétány 1/C, Budapest, H 1117, Hungary karolyi@cs.elte.hu
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationConstructions of digital nets using global function fields
ACTA ARITHMETICA 105.3 (2002) Constructions of digital nets using global function fields by Harald Niederreiter (Singapore) and Ferruh Özbudak (Ankara) 1. Introduction. The theory of (t, m, s)-nets and
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More information#A5 INTEGERS 18A (2018) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT
#A5 INTEGERS 8A (208) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT Yann Bugeaud IRMA, UMR 750, Université de Strasbourg et CNRS, Strasbourg, France bugeaud@math.unistra.fr
More informationArithmetic Funtions Over Rings with Zero Divisors
BULLETIN of the Bull Malaysian Math Sc Soc (Second Series) 24 (200 81-91 MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Arithmetic Funtions Over Rings with Zero Divisors 1 PATTIRA RUANGSINSAP, 1 VICHIAN LAOHAKOSOL
More informationRELATION BETWEEN SMALL FUNCTIONS WITH DIFFERENTIAL POLYNOMIALS GENERATED BY MEROMORPHIC SOLUTIONS OF HIGHER ORDER LINEAR DIFFERENTIAL EQUATIONS
Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 147 161. RELATION BETWEEN SMALL FUNCTIONS WITH DIFFERENTIAL POLYNOMIALS GENERATED BY MEROMORPHIC SOLUTIONS OF HIGHER ORDER LINEAR DIFFERENTIAL
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationMaximal perpendicularity in certain Abelian groups
Acta Univ. Sapientiae, Mathematica, 9, 1 (2017) 235 247 DOI: 10.1515/ausm-2017-0016 Maximal perpendicularity in certain Abelian groups Mika Mattila Department of Mathematics, Tampere University of Technology,
More information250 G. ALKAUSKAS and A. DUBICKAS Baker and Harman [2] proved that the sequence [ο p ] (where p runs over the primes) contains infinitely many prime nu
Acta Math. Hungar. 105 (3) (2004), 249 256. PRIME AND COMPOSITE NUMBERS AS INTEGER PARTS OF POWERS G. ALKAUSKAS and A. DUBICKAS Λ (Vilnius) Abstract. We studyprime and composite numbers in the sequence
More informationDiscrete uniform limit law for additive functions on shifted primes
Nonlinear Analysis: Modelling and Control, Vol. 2, No. 4, 437 447 ISSN 392-53 http://dx.doi.org/0.5388/na.206.4. Discrete uniform it law for additive functions on shifted primes Gediminas Stepanauskas,
More informationProjective Schemes with Degenerate General Hyperplane Section II
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 44 (2003), No. 1, 111-126. Projective Schemes with Degenerate General Hyperplane Section II E. Ballico N. Chiarli S. Greco
More informationDIGITAL EXPANSION OF EXPONENTIAL SEQUENCES
DIGITAL EXPASIO OF EXPOETIAL SEQUECES MICHAEL FUCHS Abstract. We consider the q-ary digital expansion of the first terms of an exponential sequence a n. Using a result due to Kiss und Tichy [8], we prove
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationEquidivisible 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 informationBetter bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
More informationStandard 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 informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationOn the discrepancy of circular sequences of reals
On the discrepancy of circular sequences of reals Fan Chung Ron Graham Abstract In this paper we study a refined measure of the discrepancy of sequences of real numbers in [0, ] on a circle C of circumference.
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More informationNotes 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 informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationON COMPLEMENTED SUBSPACES OF SUMS AND PRODUCTS OF BANACH SPACES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 124, Number 7, July 1996 ON COMPLEMENTED SUBSPACES OF SUMS AND PRODUCTS OF BANACH SPACES M. I. OSTROVSKII (Communicated by Dale Alspach) Abstract.
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationMULTIPLICITIES OF MONOMIAL IDEALS
MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationOn the lines passing through two conjugates of a Salem number
Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 On the lines passing through two conjugates of a Salem number By ARTŪRAS DUBICKAS Department of Mathematics and Informatics, Vilnius
More informationOn the digital representation of smooth numbers
On the digital representation of smooth numbers Yann BUGEAUD and Haime KANEKO Abstract. Let b 2 be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer
More informationExact formulae for the prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 19, 013, No. 4, 77 85 Exact formulae for the prime counting function Mladen Vassilev Missana 5 V. Hugo Str, 114 Sofia, Bulgaria e-mail: missana@abv.bg
More informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
More informationTHESIS. 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 informationExplicit solution of a class of quartic Thue equations
ACTA ARITHMETICA LXIV.3 (1993) Explicit solution of a class of quartic Thue equations by Nikos Tzanakis (Iraklion) 1. Introduction. In this paper we deal with the efficient solution of a certain interesting
More informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
More informationarxiv:math/ v1 [math.fa] 26 Oct 1993
arxiv:math/9310217v1 [math.fa] 26 Oct 1993 ON COMPLEMENTED SUBSPACES OF SUMS AND PRODUCTS OF BANACH SPACES M.I.Ostrovskii Abstract. It is proved that there exist complemented subspaces of countable topological
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
More informationPolynomial Functions
Polynomial Functions Polynomials A Polynomial in one variable, x, is an expression of the form a n x 0 a 1 x n 1... a n 2 x 2 a n 1 x a n The coefficients represent complex numbers (real or imaginary),
More informationStructure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationThe Diophantine equation x(x + 1) (x + (m 1)) + r = y n
The Diophantine equation xx + 1) x + m 1)) + r = y n Yu.F. Bilu & M. Kulkarni Talence) and B. Sury Bangalore) 1 Introduction Erdős and Selfridge [7] proved that a product of consecutive integers can never
More informationOn 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 informationON k-subspaces OF L-VECTOR-SPACES. George M. Bergman
ON k-subspaces OF L-VECTOR-SPACES George M. Bergman Department of Mathematics University of California, Berkeley CA 94720-3840, USA gbergman@math.berkeley.edu ABSTRACT. Let k L be division rings, with
More informationRoot separation for irreducible integer polynomials
Root separation for irreducible integer polynomials Yann Bugeaud and Andrej Dujella 1 Introduction The height H(P ) of an integer polynomial P (x) is the maximum of the absolute values of its coefficients.
More informationINCOMPRESSIBILITY OF GENERIC ORTHOGONAL GRASSMANNIANS
INCOMPRESSIBILITY OF GENERIC ORTHOGONAL GRASSMANNIANS NIKITA A. KARPENKO Abstract. Given a non-degenerate quadratic form over a field such that its maximal orthogonal grassmannian is 2-incompressible (a
More informationA finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792
Title Author(s) A finite universal SAGBI basis for the kernel of a derivation Kuroda, Shigeru Citation Osaka Journal of Mathematics. 4(4) P.759-P.792 Issue Date 2004-2 Text Version publisher URL https://doi.org/0.890/838
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationNONABELIAN 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 informationThe decomposability of simple orthogonal arrays on 3 symbols having t + 1 rows and strength t
The decomposability of simple orthogonal arrays on 3 symbols having t + 1 rows and strength t Wiebke S. Diestelkamp Department of Mathematics University of Dayton Dayton, OH 45469-2316 USA wiebke@udayton.edu
More informationCYCLES AND FIXED POINTS OF HAPPY FUNCTIONS
Journal of Combinatorics and Number Theory Volume 2, Issue 3, pp. 65-77 ISSN 1942-5600 c 2010 Nova Science Publishers, Inc. CYCLES AND FIXED POINTS OF HAPPY FUNCTIONS Kathryn Hargreaves and Samir Siksek
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
More informationPILLAI S CONJECTURE REVISITED
PILLAI S COJECTURE REVISITED MICHAEL A. BEETT Abstract. We prove a generalization of an old conjecture of Pillai now a theorem of Stroeker and Tijdeman) to the effect that the Diophantine equation 3 x
More informationLow-discrepancy sequences obtained from algebraic function fields over finite fields
ACTA ARITHMETICA LXXII.3 (1995) Low-discrepancy sequences obtained from algebraic function fields over finite fields by Harald Niederreiter (Wien) and Chaoping Xing (Hefei) 1. Introduction. We present
More informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
More informationThere are no Barker arrays having more than two dimensions
There are no Barker arrays having more than two dimensions Jonathan Jedwab Matthew G. Parker 5 June 2006 (revised 7 December 2006) Abstract Davis, Jedwab and Smith recently proved that there are no 2-dimensional
More informationAn Analysis of Katsuura s Continuous Nowhere Differentiable Function
An Analysis of Katsuura s Continuous Nowhere Differentiable Function Thomas M. Lewis Department of Mathematics Furman University tom.lewis@furman.edu Copyright c 2005 by Thomas M. Lewis October 14, 2005
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationDiscrete dynamics on the real line
Chapter 2 Discrete dynamics on the real line We consider the discrete time dynamical system x n+1 = f(x n ) for a continuous map f : R R. Definitions The forward orbit of x 0 is: O + (x 0 ) = {x 0, f(x
More informationPowers of 2 with five distinct summands
ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3
More informationDIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS
Periodica Mathematica Hungarica Vol. 45 (1 2), 2002, pp. 21 33 DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS Andrej Dujella (Zagreb), Clemens Fuchs (Graz) and Robert F. Tichy (Graz) [Communicated by: Attila
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationOn the number of cyclic subgroups of a finite Abelian group
Bull. Math. Soc. Sci. Math. Roumanie Tome 55103) No. 4, 2012, 423 428 On the number of cyclic subgroups of a finite Abelian group by László Tóth Abstract We prove by using simple number-theoretic arguments
More informationQUADRATIC RESIDUES OF CERTAIN TYPES
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 36, Number 6, 2006 QUADRATIC RESIDUES OF CERTAIN TYPES ALEXANDRU GICA ABSTRACT. The main purpose of the paper is to show that if p is a prime different from
More informationRoot separation for irreducible integer polynomials
Root separation for irreducible integer polynomials Yann Bugeaud and Andrej Dujella Abstract We establish new results on root separation of integer, irreducible polynomials of degree at least four. These
More informationAlmost perfect powers in consecutive integers (II)
Indag. Mathem., N.S., 19 (4), 649 658 December, 2008 Almost perfect powers in consecutive integers (II) by N. Saradha and T.N. Shorey School of Mathematics, Tata Institute of Fundamental Research, Homi
More informationComputing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q John Cremona 1 and Samir Siksek 2 1 School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7
More informationON THE ZERO-DIVISOR-CUP-LENGTH OF SPACES OF ORIENTED ISOMETRY CLASSES OF PLANAR POLYGONS. 1. Introduction
ON THE ZERO-DIVISOR-CUP-LENGTH OF SPACES OF ORIENTED ISOMETRY CLASSES OF PLANAR POLYGONS DONALD M. DAVIS Abstract. Using information about the rational cohomology ring of the space M(l 1,..., l n ) of
More informationTWO VARIATIONS OF A THEOREM OF KRONECKER
TWO VARIATIONS OF A THEOREM OF KRONECKER ARTŪRAS DUBICKAS AND CHRIS SMYTH ABSTRACT. We present two variations of Kronecker s classical result that every nonzero algebraic integer that lies with its conjugates
More informationDecomposition of a recursive family of polynomials
Decomposition of a recursive family of polynomials Andrej Dujella and Ivica Gusić Abstract We describe decomposition of polynomials f n := f n,b,a defined by f 0 := B, f 1 (x := x, f n+1 (x = xf n (x af
More informationSOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE
SOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE Abstract. We provide irreducibility criteria for multivariate
More informationLIE ALGEBRA PREDERIVATIONS AND STRONGLY NILPOTENT LIE ALGEBRAS
LIE ALGEBRA PREDERIVATIONS AND STRONGLY NILPOTENT LIE ALGEBRAS DIETRICH BURDE Abstract. We study Lie algebra prederivations. A Lie algebra admitting a non-singular prederivation is nilpotent. We classify
More informationProducts of ratios of consecutive integers
Products of ratios of consecutive integers Régis de la Bretèche, Carl Pomerance & Gérald Tenenbaum 27/1/23, 9h26 For Jean-Louis Nicolas, on his sixtieth birthday 1. Introduction Let {ε n } 1 n
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationThe number of solutions of linear equations in roots of unity
ACTA ARITHMETICA LXXXIX.1 (1999) The number of solutions of linear equations in roots of unity by Jan-Hendrik Evertse (Leiden) 1. Introduction. We deal with equations (1.1) a 1 ζ 1 +... + a n ζ n = 1 in
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationTHE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS
J. Appl. Math. & Computing Vol. 4(2004), No. - 2, pp. 277-288 THE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS LIDONG WANG, GONGFU LIAO, ZHENYAN CHU AND XIAODONG DUAN
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More information