On the discrepancy of circular sequences of reals
|
|
- Emory McCarthy
- 5 years ago
- Views:
Transcription
1 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. Specifically, for a sequence x = (x, x,...) in [0, ], define the discrepancy D(x) of x by D(x) = inf inf n xm xm+n n m where x i x j = min{ x i x j, x i x j } is the distance between x i and x j on C. We show that sup x D(x) 3 and that this bound is achieved, strengthening a conjecture of D. J. Newman. Introduction A basic question in the study of the distribution of real sequences is the quantitative estimation of the extent by which an arbitrary sequence must deviate from some measure of regularity. This topic has an extensive literature, much of which is surveyed in [], [], [4], [9], and [0]. As an example, de Bruijn and Erdős in [6] considered the following measure of irregularity for sequences on a circle C of circumference (see also [], [3], and [4]). For x, y C, define the distance d(x, y) between x and y to be x y = min{ x i x j, x i x j }. Thus, x y is just the length of the shorter arc in C joining x and y. For an infinite sequence x = (x, x,...) in C, define ω(x) = lim inf n Theorem [6]. For any sequence x in C, inf n x i x j. i<j n ω(x) = () ln 4 Furthermore, the bound in () is best possible, as shown by taking x n = {log (n )} where {z} denotes the fractional part of z. While this sequence x is optimal with respect to ω, it is certainly not as spread out as one would think that a well-distributed sequence should be. In University of California, San Diego
2 particular, consecutive points x n and x n+ are very close together. In this note, we consider a related but much more sensitive measure of discrepancy, suggested by the following conjecture of D. J. Newman (see [7]). For an infinite sequence x = (x, x,...) in [0, ], define Conjecture (D. J. Newman). δ(x) = inf lim inf n x m x m+n. n m sup δ(x) = x This conjecture was motivated (in part) by the fact that occurs frequently in extremal problems involving discrepancy. For example, it follows from standard results in diophantine approximation (e.g., see []), that for any real θ 0, lim inf n{nθ}. () n Furthermore, the constant cannot be replaced by any smaller constant since () holds with equality for θ = +, for example. For an infinite sequence x = (x 0, x, x,...), we define the discrepancy D(x) of x by D(x) = inf n inf m n x m x m+n. For this measure of discrepancy, any run of n consecutive terms of x must be just as well dispersed as the first n terms of x. In this sense, it is a more sensitive measure of irregularity of distribution. A natural question concerning this definition is about the choice of inf versus liminf. As it turns out, the same bounds hold for both versions and therefore we here adapt the stronger notion. More details are discussed in Section 3. In this paper, we will prove that Newman s conjecture is valid. In particular, we determine the best possible constant which turns out to be somewhat smaller than. For the discrepancy of a sequence x of reals on a circle C of circumference, we will prove the following. Theorem. sup x D(x) = α 0 = 3. Note that α 0 = 3 = < = The analogous problem of bounding the discrepancy of sequences x which lie in the interval [0, ] (as opposed to the circle C) was considered by the authors in []. For this case, we define the discrepancy D (x) = inf n inf m n x m x m+n. As it turns out, the extremal value of D (x) is slightly larger than it is for D(x). In particular, the following result [] was established.
3 Theorem. For any sequence of reals x = (x, x,...) with x i [0, ], we have ( D (x) = inf inf n x m+n x n + ) n m F k k = β = where F k denotes the k th Fibonacci number. Furthermore, this upper bound is sharp. For example, it is achieved by the sequence x defined by x n = β i ɛ i (n) F i (3) where the ɛ i (n) {0,, } are determined as follows. Every integer n has a unique expansion as n = i ɛ i (n)f i where ɛ i (n) {0,, } and if ɛ i (n) = = ɛ j (n) for i < j then there is an index k with i < k < j such that ɛ k (n) = 0. Before proceeding we first state several facts concerning Fibonacci numbers that will be needed. The Fibonacci numbers F n are given by the recurrence F 0 = 0, F = and F n+ = F n+ + F n for n 0. (i) F n = (τ n σ n ) where τ = ( + )/ and σ = ( )/. Thus τ + σ = and τσ =. (ii) n F k = F n+. k= (iii) For all s t, F s+ < t i=s+ +. F i F t F t+ F s F s+ In the remainder of the paper, we will use other various well-known properties of the Fibonacci numbers, all of which are standard and can be found in [8]. 3
4 The main results In the circle C of circumference, we will assume the point 0 C is located at the rightmost point of C and the positive direction on C proceeds in a counterclockwise direction (so that 4 is at the top of C). For an infinite sequence x = (x 0, x, x,...), we will assume without of loss of generality that x 0 = 0, and x. Given a finite sequence x n = (x 0 = 0, x, x,..., x n ), we will let π(x n ) denote the sequence specifying the order in which the x i appear as we move around C in a counterclockwise direction starting from 0. For example, if x 7 = ( { 3 8 k} : 0 k 7) = (0, 3 8, 6 8, 8, 4 8, 7 8, 8, 8 ) then π(x 7 ) = 0, 3, 6,, 4, 7,, (see Figure ) where use the convention that the sequence in the angle brackets denotes the order in which the x i are encountered as we go around C in the counterclockwise direction. That is, starting at x 0 = 0, we see x 3 = 8, then x 6 = 8, then x = 3 8, etc. As mentioned previously, {x} denotes the fractional part of x. {6 3 8} = 8 { 3 8} = 3 8 {3 3 8 } = 8 {4 3 8} = 4 8 {0 3 8 } = 0 {7 3 8 } = 8 { 3 8 } = 7 8 { 3 8 } = 6 8 Figure : Circle C with the points { 3k 8 }, 0 k 7. Now for a positive integer N, define the restricted discrepancy D N (x) of x by D N (x) = inf inf n x m x m+n. n N m With this restricted discrepancy we will establish the following theorem which will be a step in proving Theorem. Theorem 3. sup x D N (x) = Fn F n+ for F n N < F n+. 4
5 First, we will show that the bound in Theorem can be achieved. Define ȳ = (y 0, y, y,...) with y k = {k α 0 }, k 0 where we recall that α 0 = 3. Claim. D(ȳ) = α 0. Proof. To begin, observe that we only need to check that inf n y n α 0. (D(ȳ) n is certainly at most α 0 since y = α 0.) Furthermore, we only have to verify the claim for those y n which have the property that y n < y s, for all s < n. A quick calculation shows that the order of the first 6 terms of ȳ is 0, 3,, 4,,. Thus, extending the order to the next three terms, since y is between y 0 and y, then y 6 must be between y and y 3, and y 7 must be between y and y 4. Consequently, the distances y 6 and y 7 cannot be smaller than y. However, y 8 lies between y 3 and y, and since this interval also contains 0, then y 8 might be a new champion small distance (in fact, it is). A check shows that it is in the interval between y 0 and y 3. Continuing this argument, we see that y 9 must be between y and y 4, y 0 must be between y and y, y must be between y 3 and y 6, and y must be between y 4 and y 7. Thus, none of these 4 points can be closer to 0 than y 8 is. However, y 3 will lie in the interval defined by y and y 8, and since this interval also contains 0, then y 3 could be a new champion. (Again, it is, and in fact, it lies between y 0 and y.) Notice that the indices at which new champions occur are exactly the Fibonacci numbers. This fact is well known and follows from the following calculations. In particular, F t α 0 F t = ( τ (τ t σ t ) (τ t σ t ) = (σ t σ t+ ) = ( σ 4 ) σ t = σ t. F r α 0 = F r + σ r > F r, F r+ α 0 = F r + σ r+ < F r. This implies that when the time comes for y Ft to be located, it lies between 0 and y Ft (and not between 0 and y Ft ). Therefore, for t, F t F t α 0 = F t σ t = (τ t σ t σ t ) = (( ) t σ t ) ( σ 4 ) = α 0. )
6 This proves the Claim.. Proof of Theorem Suppose x = (0, x, x,...) has D(x) = α α 0 = Thus, we must always have x m x m+n α n. First, consider (0, x, x ) (where we have assumed that x ). If 0 < x < x then x = x + x x α( + ) so that α 3, which is a contradiction. Hence, x > x. In other words, the order of these three points is 0,,. In this case we have so that x + x + x x x + α( + ) x 3 α 3 α 0 < Of course, the same argument shows that x m x m+ < 0.47 for all m. The next issue is to decide where x 3 can go. If we had the order 0,,, 3 (i.e., if x 3 were between x and 0), then we would have so that = x + x x + x x 3 + x 3 α( ) = α( 3 ) α 3 0 < α 0 which is a contradiction. Hence, we must have the order 0, 3,,. In fact, this must be the relative order of any four consecutive terms of x. In particular, since 3 is between 0 and, then 4 must be between and. Now, where can go? If were between 0 and 3, so that we had the order 0,, 3,, 4,, then = x + x x 3 + x 3 x 4 + x 4 x + x α( ) = α( 0 ) which implies α 0 7 < < α 0, a contradiction. Hence, we must have the order 0, 3,, 4,,, i.e., is between and 0. Thus, we can conclude that if D(x) α 0 then any six consecutive terms of x must be in the same order 0, 3,, 4,, as we go around C in the positive direction. Here, we will begin to abuse our notation and identify the point x i with its index i (for typographical convenience). In this case, consider the sequence 0,,, 3, 4,, 0 (which goes around C exactly twice). We then have which implies α 0 6 = 3. α( ) = 6 α 6
7 Let us do two more steps of this process before moving to the general case. Since lies between and 0, then 6 lies between 3 and, and 7 lies between 4 and. Since none of these intervals contains 0, then no new smaller distance to 0 can occur. However, 8 lies between and 3, and this interval does contain 0. So we need to decide on which side of 0 that 8 could lie. Suppose that 8 were in between and 0. Then consider the sequence 0, 8,, 4, 3, 0. Since this goes around C just once, then by our assumption that D 8 (x) D(x) = α α 0 we have, α( ) = 67 4 α so that we have α 4 67 = < α 0 = , a contradiction. Thus, if D(x) α 0 then 8 must lie between 3 and 0. Further, 9 must lie between 4 and, 0 must lie between and, must lie between 6 and 3, and must lie between 7 and 4. None of these intervals contain the point 0. However, 3 must lie between 8 and, and this interval does contain 0. Again, there are two possibilities for the location of 3. If 3 were between 0 and 8, then consider the sequence 0, 3, 8, 3, 4,, 0. This sequence goes around C once, so that we have (since D 3 (x) D(x)), α( ) = 74 6 α. This implies that α 6 74 = < α 0, a contradiction. Hence, 3 must go between and 0 (and the same relative order must hold for any 4 consecutive terms of x). In general, we must distinguish two cases when a new term is placed into the interval containing the point 0. If follows by induction that this point must be of the form F t for some t. We have just seen this for the points F 3 =, F 4 = 3, F =, F 6 = 8 and F 7 = 3. Note that the Fibonacci numbers with odd indices occur before 0 and the Fibonacci numbers with even indices occur after 0. The first case is when the new point has the form F n+, where we can assume that n 3. Then the interval containing 0 is bounded by F n from below and F n from above. Suppose that F n+ were between 0 and F n. Then consider the sequence 0, F n+, F n, F n, F n +, F n +, F n + 3,..., F n, F n, 0. This path goes around C exactly F n times. Hence, since D Fn+ (x) α, we have ( α F n 3 + ) F n. F n+ F n F n F n 7
8 This implies that ( α + 3 ) F n αf n 3 F n+ F n Thus, α F n α 0 F n 3 = ( τ n σ n ) τ (τ n 3 σ n 3 ) = ( σ n σ n ) = (σ 4 )σ n = σ n 3. F n+ + 3 = F n τ n 3 ( F n+ + 3 F n ). σ n 3 To get a contradiction, we would like to show i.e., Now (4) is equivalent to τ n 3 ( F n+ + 3 F n ) < α 0 = τ, + 3 >. (4) F n+ F n τ n τ n (F n + 3F n+ ) > F n+ F n, or τ n (τ n σ n + 3τ n+ 3σ n+ ) (τ n+ σ n+ )(τ n σ n ) = τ 4n + σ 4n (τ + σ ) = τ 4n + σ 4n 3. () However, () holds provided we have (3τ 4n 4 + τ 4n 6 σ 4 3σ 6 ) > τ 4n + σ 4n 3 or (3 τ + τ 6 )τ 4n 6 > (σ 4 + 3σ 6 ) + σ 4n 3. (6) 8
9 However, this is immediate since (3 τ + τ 6 ) = 3 ( ) = > 0 whereas the right-hand side of (6) is less than 0. This shows that F n+ must go in between F n and 0. In this case, consider the sequence 0,,, 3,... F n+, F n, 0. This path goes around C exactly F n times and so we have the inequality In this case we deduce that D Fn+ (x) α(f n + F n+ ) F n. F n F n+ + = F n F n+ F n+ Fn+ + = F n F n+ F n F n+3 = F n+ F n+3. The other case is when the new point in question is F n, a Fibonacci number with an even index. The argument is this case is similar to the preceding case. Here, the interval containing the point 0 is bounded by F n from above and by F n from below. (In other words, as we traverse C in the positive direction, we see the points F n, 0, F n in that order.) Suppose that F n is between F n and 0. Then consider the sequence 0, F n, F n, F n, F n, F n 3,..., F n +, F n, 0. This covers C exactly F n times. Thus, we have ( α + ) + F n 3 F n. F n F n Therefore, ( α + ) F n αf n 3 F n F n F n α 0 F n 3 = F n τ F n 3 = ( τ n σ n τ (τ n 3 σ n 3 ) = ( σ n σ n ) = (σ 4 )σ n = σ n 3 = τ n 3. ) 9
10 Thus, α ( τ n 3 F n + So, we will obtain a contradiction to (7) if we can show in other words, In fact, it is true that τ n 3 ( This follows from the fact that F n + F n ) < α 0 = + > F n F n τ n. > F n τ n. F n τ n = τ n σ n τ n = (τ 3 + σ 4n 7 ) F n ). (7) τ, < τ 3 = + <. Thus, if D(x) α 0 then F n must go in between 0 and F n. Since we have shown that D(ȳ) = α 0 for the sequence ȳ = (y, y, y 3,...) with y k = {kα 0 }, then the order of the y k around C must also be in the same as we have deduced here. Finally, for N = F n+, we have already noted that D(x) = inf n inf m n x m x m+n α 0 implies D N (x) = inf n N inf m n x m x m+n F n+ F n+3. Since D(x) D N (x) for all N then sup x This proves Theorem. D(x) = lim D N(x) = lim N n F n+ = F n+3 τ = α 0. 0
11 To complete the proof of Theorem 3, it will suffice to exhibit a sequence x such that D N (x) = F n F n+ for F n N < F n+. To do this, we define We need to verify that x k = { k Fn F n+ }, k 0. inf inf k x m x m+k F n. (8) k<f n+ m F n+ As before, it will suffice to take m = 0. Also, it will be enough to show that (8) holds when k = F m for some m. So we need to prove that { F m Fn F n+ } F n F n+, m < n +. (9) Scaling our problem up by a factor of F n+, we have the equivalent condition F m (F m F n (mod F n+ )) F n, m < n +, (0) where r(mod s) denotes min{r(mod s), s r(mod s)}. Note that r(mod s) = (s r)mod s. For example, for n = 4, F 7 = 3, F 9 = 34, we have m F m (F m 3(mod 34)) 3 = = = = 3 3 = = = = 3 Note that in this example, F m 3(mod 34) = F 9 m (mod 34), m 8. Of course, this is no accident! We recall a general Fibonacci identity: Changing variables, this becomes: F r+ F s F r F s+ = ( ) s+ F r s. F n+ F m F n F m = ( ) m F n+ m. () However, F n (mod F n+ ) = F n (mod F n+ ).
12 Thus, Therefore, by () we have F m F n (mod F n+ ) = F m F n (mod F n+ ). F m F n (mod F n+ ) = F n+ m where the ( ) m factor has been absorbed into the mod function. Thus, (0) becomes F m F n+ m F n, m < n +. () If fact, we will prove the more general inequality: F m F n m F n, m < n, n. (3) (3) clearly holds for n = and n = 3. We prove by induction that it holds for all n 4. Since F m F n m = F m (F n m + F n m ) = F m F n m + F m F n m F n + F n 3 by induction = F n then (3) follows, as does (). This completes the proof of (9) and Theorem 3 is proved. 3 Concluding remarks. While we have defined our discrepancy in the form D(x) = inf n inf m n x m x m+n, we could have just as well have used the modified version D(x) = inf n lim inf x m x m+n. m It is not hard to show that the same bound holds for this modified version as well. The sequence x in (3) which achieves equality in Theorem has curious similarity to the well-known van der Corput sequence z which arises in the study of the uniform distribution of real sequences (see []). Here for each n 0, we expand n = i ɛ i(n) i into its binary expansion, and then define z n = i ɛ i(n) i. That is, we flip the powers of from the numerator to the denominator. This is just what did to form the x n, namely, we flipped the Fibonacci numbers in the expansion of n from the numerators to the denominators. Is this hinting at some general principal for generating well-distributed sequences?
13 It would be very interesting to understand the analogous problems for two (or more) dimensions. These questions are well known to be difficult. Even for the case of two-dimensional diophantine approximation (with the sup norm), the value of γ = sup θ,φ lim inf q max( qθ, qφ ) q is not known. It is known that γ 7 (see [3]). This implies that the analogue D (x) of D(x) for a sequence x [0, ] [0, ] with the sup norm d, namely D (x) = inf lim inf n d(xm+n, x m ), n m can remain above 7 ɛ for any ɛ > 0 for a suitable sequence x. This is probably not the best possible value, however. It would be very interesting to know the truth in this case. The authors wish to express their thanks to a diligent referee who made many excellent comments. References [] J. Beck and W. Chen, Irregularities of Distribution, Cambridge Tracts in Mathematics 89, Cambridge Univ. Pr., Cambridge, (987) xiv + 94 pp. [] J. Beck and V. T. Sós, Discrepancy Theory, in Handbook of Combinatorics, Vol II, R. L. Graham, M. Grötschel and L. Lovász, eds., Elsevier Science B. V, Amsterdam, (99), [3] J. W. S. Cassels, Simultaneous diophantine approximation, J. London Math. Soc., 30, (9), 9. [4] A Panorama of Discrepancy Theory, W. Chen, A. Srivastav and G. Travaglini, eds., Lecture Notes in Mathematics 07, Springer, Heidelberg, (04), xii + 69 pp. [] F. R. K. Chung and R. L. Graham, On irregularities of distribution, Finite and Infinite Sets, Colloquia Mathematica Societatis János Bolyai 37, (98), 8. [6] N. de Bruijn and P. Erdős, Sequences of Points on a Circle, Indagationes Math.,, [7] P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory, Monographies de L Enseignement Mathématique 8, Université de Genève, Geneva, (980), 8 pp. 3
14 [8] R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, nd ed., Addison-Wesley, Reading, Mass, (994), xiii+67pp. [9] L. Kuipers and H. Niederreiter, Uniform Distribution of Sequences, Pure and Applied Mathematics, Wiley Interscience, New York, (974) xiv pp. [0] J. Matoušek, Geometric Discrepancy, An Illustrated Guide, Algorithms and Combinatorics 8,, Springer-Verlag, Berlin, (999), xii + 88 pp. [] I. Niven, Irrational Numbers, The Carus Mathematical Monographs, Math. Assoc. Amer., (96), xii + 64 pp. [] A. Ostrowski, Zum Schubfäfacherprinzip in einem linearen Intervall, Mathematische Miezellen XXVI, Jber. Deutsch. Math. Verein. 60, (97), [3] A. Ostrowski, Eine Verschärfung des Schubfächerprinzips in einem linearen Intervall, Arch. Math. 8 (97), 0. [4] G. Toulmin, Subdivision of an interval by a sequence of points, Archiv Math. 8, (97),
An arithmetic extension of van der Waerden s theorem on arithmetic progressions
An arithmetic extension of van der Waerden s theorem on arithmetic progressions Kevin A. Broughan University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz A short proof is given of a new
More informationEGYPTIAN 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 informationAn Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting
BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 31(2) (2008), 175 183 An Application of Catalan Numbers on Cayley Tree of Order 2:
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationNeighborly families of boxes and bipartite coverings
Neighborly families of boxes and bipartite coverings Noga Alon Dedicated to Professor Paul Erdős on the occasion of his 80 th birthday Abstract A bipartite covering of order k of the complete graph K n
More informationANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99
ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS N. HEGYVÁRI, F. HENNECART AND A. PLAGNE Abstract. We study the gaps in the sequence of sums of h pairwise distinct elements
More informationCombinatorial Proof of the Hot Spot Theorem
Combinatorial Proof of the Hot Spot Theorem Ernie Croot May 30, 2006 1 Introduction A problem which has perplexed mathematicians for a long time, is to decide whether the digits of π are random-looking,
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationLATTICE POINT COVERINGS
LATTICE POINT COVERINGS MARTIN HENK AND GEORGE A. TSINTSIFAS Abstract. We give a simple proof of a necessary and sufficient condition under which any congruent copy of a given ellipsoid contains an integral
More informationTHE RALEIGH GAME. Received: 1/6/06, Accepted: 6/25/06. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7(2) (2007), #A13 THE RALEIGH GAME Aviezri S. Fraenkel 1 Department of Computer Science and Applied Mathematics, Weizmann Institute of Science,
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 informationDiscrete Mathematics 22 (1978) North-Holland Publishing Company ON ADDITIVE PARTITIONS OF INTEGERS K. ALLADI University of California, Los A
Discrete Mathematics 22 (1978) 20 1-211. North-Holland Publishing Company ON ADDITIVE PARTITIONS OF INTEGERS K. ALLADI University of California, Los Angeles, CA 90024, U.S.A. P. ERDŐS The Hungarian Academy
More informationCollatz cycles with few descents
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.
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
More informationSingle processor scheduling with time restrictions
Single processor scheduling with time restrictions Oliver Braun Fan Chung Ron Graham Abstract We consider the following scheduling problem 1. We are given a set S of jobs which are to be scheduled sequentially
More informationOn judicious bipartitions of graphs
On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationJumping Sequences. Steve Butler Department of Mathematics University of California, Los Angeles Los Angeles, CA
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.4.5 Jumping Sequences Steve Butler Department of Mathematics University of California, Los Angeles Los Angeles, CA 90095 butler@math.ucla.edu
More informationON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS
Fizikos ir matematikos fakulteto Seminaro darbai, Šiaulių universitetas, 8, 2005, 5 13 ON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS Boris ADAMCZEWSKI 1, Yann BUGEAUD 2 1 CNRS, Institut Camille Jordan,
More informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
More informationarxiv: v1 [math.co] 11 Mar 2013
arxiv:1303.2526v1 [math.co] 11 Mar 2013 On the Entropy of a Two Step Random Fibonacci Substitution Johan Nilsson Bielefeld University, Germany jnilsson@math.uni-bielefeld.de Abstract We consider a random
More informationA Smorgasbord of Applications of Fourier Analysis to Number Theory
A Smorgasbord of Applications of Fourier Analysis to Number Theory by Daniel Baczkowski Uniform Distribution modulo Definition. Let {x} denote the fractional part of a real number x. A sequence (u n R
More informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationSELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN
SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More informationA LeVeque-type lower bound for discrepancy
reprinted from Monte Carlo and Quasi-Monte Carlo Methods 998, H. Niederreiter and J. Spanier, eds., Springer-Verlag, 000, pp. 448-458. A LeVeque-type lower bound for discrepancy Francis Edward Su Department
More informationMonochromatic simplices of any volume
Monochromatic simplices of any volume Adrian Dumitrescu Department of Computer Science University of Wisconsin Milwaukee WI 53201-0784, USA Email: ad@cs.uwm.edu Minghui Jiang Department of Computer Science
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationarxiv: v2 [math.co] 27 Aug 2016
On the Erdős-Szekeres convex polygon problem Andrew Suk arxiv:1604.08657v2 [math.co] 27 Aug 26 Abstract Let ES(n) be the smallest integer such that any set of ES(n) points in the plane in general position
More informationEnumerating split-pair arrangements
Journal of Combinatorial Theory, Series A 115 (28 293 33 www.elsevier.com/locate/jcta Enumerating split-pair arrangements Ron Graham 1, Nan Zang Department of Computer Science, University of California
More informationAn estimate for the probability of dependent events
Statistics and Probability Letters 78 (2008) 2839 2843 Contents lists available at ScienceDirect Statistics and Probability Letters journal homepage: www.elsevier.com/locate/stapro An estimate for the
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 informationNew Minimal Weight Representations for Left-to-Right Window Methods
New Minimal Weight Representations for Left-to-Right Window Methods James A. Muir 1 and Douglas R. Stinson 2 1 Department of Combinatorics and Optimization 2 School of Computer Science University of Waterloo
More informationOn the maximum number of isosceles right triangles in a finite point set
On the maximum number of isosceles right triangles in a finite point set Bernardo M. Ábrego, Silvia Fernández-Merchant, and David B. Roberts Department of Mathematics California State University, Northridge,
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationFermat 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 informationDiscrepancy and Uniform Distribution. by Daniel Baczkowski
Discrepancy and Uniform Distribution by Daniel Baczkowski A sequence (u n ) R is uniformly distributed mod 1 if lim N # { n N : {u n } [a, b] } N = b a for every 0 a < b 1. Weyl s Criterion says TFAE 1.
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 informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationEfficient packing of unit squares in a square
Loughborough University Institutional Repository Efficient packing of unit squares in a square This item was submitted to Loughborough University's Institutional Repository by the/an author. Additional
More informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
More informationCullen 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 informationA COMBINATORIAL PROOF AND REFINEMENT OF A PARTITION IDENTITY OF SILADIĆ
A COMBINATORIAL PROOF AND REFINEMENT OF A PARTITION IDENTITY OF SILADIĆ JEHANNE DOUSSE Abstract. In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity
More informationFunctional Analysis, Math 7320 Lecture Notes from August taken by Yaofeng Su
Functional Analysis, Math 7320 Lecture Notes from August 30 2016 taken by Yaofeng Su 1 Essentials of Topology 1.1 Continuity Next we recall a stronger notion of continuity: 1.1.1 Definition. Let (X, d
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS. Yann Bugeaud Université de Strasbourg, France
GLASNIK MATEMATIČKI Vol. 44(64)(2009), 323 331 ON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS Yann Bugeaud Université de Strasbourg, France Abstract. Let n be a positive integer. Let ξ
More informationVan der Corput sets with respect to compact groups
Van der Corput sets with respect to compact groups Michael Kelly and Thái Hoàng Lê Abstract. We study the notion of van der Corput sets with respect to general compact groups. Mathematics Subject Classification
More informationCMSC Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade. 1. (6 points) Let a
More informationAsymptotic Counting Theorems for Primitive. Juggling Patterns
Asymptotic Counting Theorems for Primitive Juggling Patterns Erik R. Tou January 11, 2018 1 Introduction Juggling patterns are typically described using siteswap notation, which is based on the regular
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 informationHeights of characters and defect groups
[Page 1] Heights of characters and defect groups Alexander Moretó 1. Introduction An important result in ordinary character theory is the Ito-Michler theorem, which asserts that a prime p does not divide
More informationMathematics 228(Q1), Assignment 2 Solutions
Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k
More information#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC
#A11 INTEGERS 12 (2012) FIBONACCI VARIATIONS OF A CONJECTURE OF POLIGNAC Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Received: 9/17/10, Revised:
More informationOn the Entropy of a Two Step Random Fibonacci Substitution
Entropy 203, 5, 332-3324; doi:0.3390/e509332 Article OPEN ACCESS entropy ISSN 099-4300 www.mdpi.com/journal/entropy On the Entropy of a Two Step Random Fibonacci Substitution Johan Nilsson Department of
More informationA SUMMATION FORMULA FOR SEQUENCES INVOLVING FLOOR AND CEILING FUNCTIONS
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 36, Number 5, 006 A SUMMATION FORMULA FOR SEQUENCES INVOLVING FLOOR AND CEILING FUNCTIONS M.A. NYBLOM ABSTRACT. A closed form expression for the Nth partial
More informationarxiv: v1 [math.co] 22 May 2014
Using recurrence relations to count certain elements in symmetric groups arxiv:1405.5620v1 [math.co] 22 May 2014 S.P. GLASBY Abstract. We use the fact that certain cosets of the stabilizer of points are
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationA lattice point problem and additive number theory
A lattice point problem and additive number theory Noga Alon and Moshe Dubiner Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract
More informationC.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 informationAverage Orders of Certain Arithmetical Functions
Average Orders of Certain Arithmetical Functions Kaneenika Sinha July 26, 2006 Department of Mathematics and Statistics, Queen s University, Kingston, Ontario, Canada K7L 3N6, email: skaneen@mast.queensu.ca
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationarxiv: v1 [math.co] 8 Feb 2013
ormal numbers and normality measure Christoph Aistleitner arxiv:302.99v [math.co] 8 Feb 203 Abstract The normality measure has been introduced by Mauduit and Sárközy in order to describe the pseudorandomness
More informationCross-Intersecting Sets of Vectors
Cross-Intersecting Sets of Vectors János Pach Gábor Tardos Abstract Given a sequence of positive integers p = (p 1,..., p n ), let S p denote the set of all sequences of positive integers x = (x 1,...,
More informationIntersections of Leray Complexes and Regularity of Monomial Ideals
Intersections of Leray Complexes and Regularity of Monomial Ideals Gil Kalai Roy Meshulam Abstract For a simplicial complex X and a field K, let h i X) = dim H i X; K). It is shown that if X,Y are complexes
More informationPUTNAM TRAINING MATHEMATICAL INDUCTION. Exercises
PUTNAM TRAINING MATHEMATICAL INDUCTION (Last updated: December 11, 017) Remark. This is a list of exercises on mathematical induction. Miguel A. Lerma 1. Prove that n! > n for all n 4. Exercises. Prove
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationMonochromatic Solutions to Equations with Unit Fractions
Monochromatic Solutions to Equations with Unit Fractions Tom C. Brown and Voijtech Rödl Citation data T.C. Brown and V. Rödl, Monochromatic solutions to equations with unit fractions, Bull. Aus. Math.
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationON HOFSTADTER S MARRIED FUNCTIONS
THOMAS STOLL Abstract. In this note we show that Hofstadter s married functions generated by the intertwined system of recurrences a(0) = 1, b(0) = 0, b(n) = n a(b(n 1)), a(n) = n b(a(n 1)) has the solutions
More informationA Geometric Proof that e is Irrational and a New Measure of its Irrationality
A Geometric Proof that e is Irrational and a New Measure of its Irrationality Jonathan Sondow. INTRODUCTION. While there exist geometric proofs of irrationality for 2 [2], [27], no such proof for e, π,
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationThe Banach-Tarski paradox
The Banach-Tarski paradox 1 Non-measurable sets In these notes I want to present a proof of the Banach-Tarski paradox, a consequence of the axiom of choice that shows us that a naive understanding of the
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 number of ways of writing t as a product of factorials
On the number of ways of writing t as a product of factorials Daniel M. Kane December 3, 005 Abstract Let N 0 denote the set of non-negative integers. In this paper we prove that lim sup n, m N 0 : n!m!
More informationarxiv: v1 [math.co] 20 Aug 2015
arxiv:1508.04953v1 [math.co] 20 Aug 2015 On Polynomial Identities for Recursive Sequences Ivica Martinak and Iva Vrsalko Faculty of Science University of Zagreb Bienička cesta 32, HR-10000 Zagreb Croatia
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationThe van der Corput embedding of ax + b and its interval exchange map approximation
The van der Corput embedding of ax + b and its interval exchange map approximation Yuihiro HASHIMOTO Department of Mathematics Education Aichi University of Education Kariya 448-854 Japan Introduction
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationA proof of a partition conjecture of Bateman and Erdős
proof of a partition conjecture of Bateman and Erdős Jason P. Bell Department of Mathematics University of California, San Diego La Jolla C, 92093-0112. US jbell@math.ucsd.edu 1 Proposed Running Head:
More informationCLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS
CLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS DANIEL FISHMAN AND STEVEN J. MILLER ABSTRACT. We derive closed form expressions for the continued fractions of powers of certain
More informationMulticolour Ramsey Numbers of Odd Cycles
Multicolour Ramsey Numbers of Odd Cycles JOHNSON, JR; Day, A 2017 Elsevier Inc This is a pre-copyedited, author-produced PDF of an article accepted for publication in Journal of Combinatorial Theory, Series
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 informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationOblivious and Adaptive Strategies for the Majority and Plurality Problems
Oblivious and Adaptive Strategies for the Majority and Plurality Problems Fan Chung 1, Ron Graham 1, Jia Mao 1, and Andrew Yao 2 1 Department of Computer Science and Engineering, University of California,
More informationSTRONG 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 informationSQUARES AND DIFFERENCE SETS IN FINITE FIELDS
SQUARES AND DIFFERENCE SETS IN FINITE FIELDS C. Bachoc 1 Univ Bordeaux, Institut de Mathématiques de Bordeaux, 351, cours de la Libération 33405, Talence cedex, France bachoc@math.u-bordeaux1.fr M. Matolcsi
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationThe discrepancy of permutation families
The discrepancy of permutation families J. H. Spencer A. Srinivasan P. Tetali Abstract In this note, we show that the discrepancy of any family of l permutations of [n] = {1, 2,..., n} is O( l log n),
More informationLinear Algebra and its Applications
Linear Algebra its Applications 432 21) 394 41 Contents lists available at ScienceDirect Linear Algebra its Applications journal homepage: wwwelseviercom/locate/laa On the Perron exponents of discrete
More informationTopological lower bounds for multichromatic numbers
University of Szeged Faculty of Science and Informatics Doctoral School in Mathematics and Computer Science Topological lower bounds for multichromatic numbers Abstract of the Ph.D. Thesis József Osztényi
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More information