DOCSLIB.ORG

Dynamics and Decimal Expansion Representation of Real Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Dynamics and Decimal Expansion Representation of Real Numbers Decimal Expansion Representation of Real Numbers Fall 2016 Do˘ganC¸¨omez Contents: 1. Introduction 2. Decimal Expansion 3. The Connection with the Ten-fold Map 4. The n-fold Map Tn 5. The Full n-shift Space Σn 1. Introduction A real number can be represented in many ways. The most popular representation is by decimal expansion; i.e., expressing a real number as a geometric series with base 10. A modification of this representation is expressing a real number as a geometric series with base n for any positive integer n ≥ 2; called as the n-ary expansion. The decimal expansion of a real number provides a convenient method of representing rational and irrational numbers as well as approxima- tions of irrational numbers by rational numbers. Furthermore, the process of obtaining the decimal expansion of a real number has close connections with dynamical systems and probability theory, which en- ables one investigate its properties in more depth. In this presentation I will briefly introduce the decimal expansion representation of real numbers, obtain some important properties, and then focus on the dy- namical properties of the \n-ary" map and some of its consequences. The concept of decimal expansion goes back to 8th century when Muhammad ibn-Musa Khwarizmi (c. 780-c. 850) introduced the ara- bic number system in his book who on algebra. In its numerous trans- lations into latin during 12th century, one encounters occasional use of decimal notation. The regular use of the decimal point and decimal notation appears to have been introduced about 1585 by Flemish sci- entist Simon Stevinus (c. 1548-1620). It was Scottish mathematician John Napier (1550-1617), the inventor of logarithms in 1614, who first used and then popularized the decimal point to separate the whole part from the fractional part of a number. P1 k When jrj < 1, the geometric series k=0 r converges with the sum 1 1 1−r : If r = 10 and ai 2 f0; 1;:::; 8; 9g; for all i ≥ 0; then the series 1 X ak 10k k=0 converges to a real number by comparison test. The idea of decimal expansion is the process of obtaining the converse of this fact; namely, given a real number x 2 [0; 1), determining the sequence of integers P1 ak 0 ≤ ai ≤ 9 such that x = k=0 10k : There is nothing special about the 1 2 number 10; indeed, one can develop expansion of real numbers with respect to any other base n 2 N as well. In that case, the expansion is called as the n-ary expansion. 2. Decimal Expansion Representation Let's look at the decimal expansion process closely. Given a real number x ≥ 0: (i) Let a0 = [x]; where [] is the greatest integer function. So, x = a0 + p0; where 0 ≤ p0 < 1: Therefore, a0 ≤ x < a0 + 1; and hence 10a0 ≤ 10x ≤ 10a0 + 9: Also, 0 ≤ 10p0 < 10: (ii) Now, 10p0 = a1 + p1; where a1 = [10p0] is an integer and 0 ≤ p0 < 1: Thus, 0 ≤ a1 ≤ 9; and a1 ≤ 10p0 < a1 + 1 () a1 ≤ 10(x − a0) < a1 + 1; which implies that a a 1 a + 1 ≤ x < a + 1 + : 0 10 0 10 10 (iii) Similarly, 10p1 = a2 + p2; where a2 = [10p1] is an integer and 0 ≤ p1 < 1: Thus, 0 ≤ a2 ≤ 9; and a2 ≤ 10p1 < a2 + 1 () a2 ≤ 10(10p0 − a1) < a2 + 1 2 () a2 ≤ 10 p0 − 10a1 < a2 + 1 2 () a2 ≤ 10 (x − a0) − 10a1 < a2 + 1; which implies that a a a 1 a a + 1 + 2 ≤ x < a + 1 + + 2 : 0 10 102 0 10 10 102 Continuing in this process and letting 10pk−1 = ak + pk; where ak = [10pk−1] and 0 ≤ pk < 1; we obtain integers ai 2 f0; 1;:::; 9g; 0 ≤ i ≤ k; such that a a a a 1 a + 1 + ··· + k ≤ x < a + 1 + ··· + k + : 0 10 10k 0 10 10k 10 Observe that if an = 0 for some n; then ai = 0 for all i ≥ n; hence the process terminates. Otherwise the process continues indefinitely. In the case that the process terminates at the nth step, we have a a (1) x = a + 1 + ··· + n ; 0 10 10n and when the process continues indefinitely, we have 1 a1 an X ak (2) x = a + + ··· + + ··· = : 0 10 10n 10k k=0 3 These expressions (1) and (2) are called the decimal expansions of the real number x; where (1) is finite and (2) is infinite, and are denoted by x = a0:a1a2 : : : an−1an; or x = a0:a1a2 : : : an :::; respectively: Remarks. 1. In the case that the process continues indefinitely, the decimal expansion process outlined above shows that, at any step n ≥ 1; we have a a a a 1 a + 1 + ··· + n ≤ x < a + 1 + ··· + n + : 0 10 10n 0 10 10n 10 Hence, we obtain two sequences of finite decimals each converging to x; one increasing from below and the other decreasing from above. By repeating this procedure sufficiently many times, the decimal expansion of x can be obtained to any desired degree of accuracy. 2. In the case that the process continues indefinitely, there are two possibilities: either the sequence of terms faig has no repetition, or it repeats, in the sense that, for some positive integers k and m; ak = ak+m; hence, the decimal expansion has the form a0:a1a2 : : : akak+1ak+2 : : : ak+m−1akak+1 :::; which we denote, for convenience, as a0:a1a2 : : : ak−1akak+1ak+2 : : : ak+m−1; where akak+1ak+2 : : : ak+m−1 denotes that the string of terms ak; ak+1; : : : ; ak+m−1 repeats indefinitely. 3. If a0:a1a2 : : : ak−1ak is a terminating decimal expansion, then it can also be rewritten as as repeating decimal expansion as a0:a1a2 : : : ak−1ak000 ··· = a0:a1a2 : : : ak0: However, in order to distinguish such decimals from the decimals with nonzero repeating parts, we will call them as finite decimal expansion. Pk ai Observe that if x = a0:a1a2 : : : ak0 = i=0 10i ; hence x 2 Q: If x = a0:a1a2 : : : ak−1akak+1ak+2 : : : ak+m−1; then letting y = a0:a1a2 : : : ak−1 and z = 0:akak+1ak+2 : : : ak+m−1; we see that y; z 2 Q: Then, 10m a a a : : : a = z; k k+1 k+2 k+m−1 10m − 1 10m and hence x = y + 10m−1 z 2 Q: Thus, any finite or repeating decimal expansion represents a rational number. The converse of this statement is also valid. Fact.1 If x 2 Q; then it has either finite or repeating decimal expan- sion. Proof. For convenience, we will assume that x 2 (0; 1); hence, we r + have a0 = [x] = 0: Let x = s ; r; s 2 Z ; and recalling the process of 4 r obtaining decimal expansion of numbers above, we observe that p0 = s ; and r r r 10( ) = a + 1 ; where 0 ≤ 1 < 1; s 1 s s r r r 10( 1 ) = a + 2 ; where 0 ≤ 2 < 1; s 2 s s ::: r r r 10( k−1 ) = a + k ; where 0 ≤ k < 1: s k s s Multiplying both sides by s at each step above, we see that this process is exactly the division algorithm: 10r = a1s + r1; where 0 ≤ r1 < s; 10r1 = a2s + r2; where 0 ≤ r2 < s; ::: 10rk−1 = ak + rk; where 0 ≤ rk < s: Notice that if one of rk = 0; then ri = 0 for all i ≥ k; i.e., the process stops and we have finite decimal expansion. For otherwise, since ri 2 f1; 2;:::; 9g; there will be integers k < m such that rm = rk: Then, by division algorithm, we will have rm+i = rk+i for 0 ≤ i ≤ m − k: In turn, we also have that am+i = ak+i for 0 ≤ i ≤ m − k; hence the block akak+1 : : : am−1 repats, which yields to repeating decimal expansion. Corollary. A real number x is irrational if and only if it has a non- repeating decimal expansion. Remark. Observe that, if x = a0:a1a2 : : : an; i.e., x has finite decimal expansion, then, by the division algorithm, we also have that x = a0:a1a2 : : : an−1(an − 1)999 ··· = a0:a1a2 : : : an−1(an − 1)9: Thus, decimal expansion of a rational numbers need not be unique! This is an unpleasant situation. Question. Can we circumvent this problem? It turns out that the remedy is bringing some tolls of dynamical systems into the process. Hence, dynamics comes to the rescue! Next we will discuss this in length and at the same time study an interesting type of dynamical systems. 3. The Connection with the Ten-fold Map Let's look at the process of finding the (decimal) digits in decimal expansion process in an alternative way. Again, we will focus on x 2 [0; 1): i i+1 Partition [0; 1) into 10 equal subintervals [ 10 ; 10 ); 0 ≤ i ≤ 9; and, if i i+1 i i+1 x 2 [ 10 ; 10 ); let a1 = i: Then divide [ 10 ; 10 ) into 10 equal subintervals 5 i j i+1 j i j i+1 j [ 10 + 102 ; 10 + 102 ); 0 ≤ j ≤ 9; and, if x 2 [ 10 + 102 ; 10 + 102 ); let a2 = j: Continuing in this manner, we obtain all the digits ak such that x = 0:a1a2a3 : : : an :::: At each step, this process is the same as multiplication of x by 10 and taking mod 1: Namely, repeated the action of the ten-fold map T on [0; 1); where 8 1 > > 10x − 0 if 0 ≤ x < > 10 > 1 2 <> 10x − 1 if ≤ x < T (x) = 10 10 > ::: > > 9 > 10x − 9 if ≤ x < 1: : 10 Therefore, i1 i1+1 a1 = i1 if 10 ≤ x < 10 () T x = 10x − i1 i2 i2+1 2 a2 = i2 if 10 ≤ T x < 10 () T x = 10(T x) − i2 ::: ik ik+1 k k−1 ak = ik if 10 ≤ x < 10 () T x = 10(T x) − ik; and consequently, a 1 x = 1 + T x 10 10 a 1 a 1 = 1 + ( 2 + T 2x) 10 10 10 10 ::: a a a a = 1 + 2 + 3 + ··· + k T kx: 10 102 103 10k k−1 Remark.
Load more

Recommended publications
  • Exploring Unit Fractions
    Page 36 Exploring Unit Fractions Alan Christison [email protected] INTRODUCTION In their article “The Beauty of Cyclic Numbers”, Duncan Samson and Peter Breetzke (2014) explored, among other things, unit fractions and their decimal expansions6. They showed that for a unit fraction to terminate, its denominator must be expressible in the form 2푛. 5푚 where 푛 and 푚 are non-negative integers, both not simultaneously equal to zero. In this article I take the above observation as a starting point and explore it further. FURTHER OBSERVATIONS 1 For any unit fraction of the form where 푛 and 푚 are non-negative integers, both not 2푛.5푚 simultaneously equal to zero, the number of digits in the terminating decimal will be equal to the larger 1 1 of 푛 or 푚. By way of example, has 4 terminating decimals (0,0625), has 5 terminating decimals 24 55 1 (0,00032), and has 6 terminating decimals (0,000125). The reason for this can readily be explained by 26.53 1 converting the denominators into a power of 10. Consider for example which has six terminating 26.53 decimals. In order to convert the denominator into a power of 10 we need to multiply both numerator and denominator by 53. Thus: 1 1 53 53 53 125 = × = = = = 0,000125 26. 53 26. 53 53 26. 56 106 1000000 1 More generally, consider a unit fraction of the form where 푛 > 푚. Multiplying both the numerator 2푛.5푚 and denominator by 5푛−푚 gives: 1 1 5푛−푚 5푛−푚 5푛−푚 = × = = 2푛. 5푚 2푛.
    [Show full text]
  • 0.999… = 1 an Infinitesimal Explanation Bryan Dawson
    0 1 2 0.9999999999999999 0.999… = 1 An Infinitesimal Explanation Bryan Dawson know the proofs, but I still don’t What exactly does that mean? Just as real num- believe it.” Those words were uttered bers have decimal expansions, with one digit for each to me by a very good undergraduate integer power of 10, so do hyperreal numbers. But the mathematics major regarding hyperreals contain “infinite integers,” so there are digits This fact is possibly the most-argued- representing not just (the 237th digit past “Iabout result of arithmetic, one that can evoke great the decimal point) and (the 12,598th digit), passion. But why? but also (the Yth digit past the decimal point), According to Robert Ely [2] (see also Tall and where is a negative infinite hyperreal integer. Vinner [4]), the answer for some students lies in their We have four 0s followed by a 1 in intuition about the infinitely small: While they may the fifth decimal place, and also where understand that the difference between and 1 is represents zeros, followed by a 1 in the Yth less than any positive real number, they still perceive a decimal place. (Since we’ll see later that not all infinite nonzero but infinitely small difference—an infinitesimal hyperreal integers are equal, a more precise, but also difference—between the two. And it’s not just uglier, notation would be students; most professional mathematicians have not or formally studied infinitesimals and their larger setting, the hyperreal numbers, and as a result sometimes Confused? Perhaps a little background information wonder .
    [Show full text]
  • Almost Periodic Sequences and Functions with Given Values
    ARCHIVUM MATHEMATICUM (BRNO) Tomus 47 (2011), 1–16 ALMOST PERIODIC SEQUENCES AND FUNCTIONS WITH GIVEN VALUES Michal Veselý Abstract. We present a method for constructing almost periodic sequences and functions with values in a metric space. Applying this method, we find almost periodic sequences and functions with prescribed values. Especially, for any totally bounded countable set X in a metric space, it is proved the existence of an almost periodic sequence {ψk}k∈Z such that {ψk; k ∈ Z} = X and ψk = ψk+lq(k), l ∈ Z for all k and some q(k) ∈ N which depends on k. 1. Introduction The aim of this paper is to construct almost periodic sequences and functions which attain values in a metric space. More precisely, our aim is to find almost periodic sequences and functions whose ranges contain or consist of arbitrarily given subsets of the metric space satisfying certain conditions. We are motivated by the paper [3] where a similar problem is investigated for real-valued sequences. In that paper, using an explicit construction, it is shown that, for any bounded countable set of real numbers, there exists an almost periodic sequence whose range is this set and which attains each value in this set periodically. We will extend this result to sequences attaining values in any metric space. Concerning almost periodic sequences with indices k ∈ N (or asymptotically almost periodic sequences), we refer to [4] where it is proved that, for any precompact sequence {xk}k∈N in a metric space X , there exists a permutation P of the set of positive integers such that the sequence {xP (k)}k∈N is almost periodic.
    [Show full text]
  • A Theorem on Repeating Decimals
    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Faculty Publications, Department of Mathematics Mathematics, Department of 6-1967 A THEOREM ON REPEATING DECIMALS William G. Leavitt University of Nebraska - Lincoln Follow this and additional works at: https://digitalcommons.unl.edu/mathfacpub Part of the Mathematics Commons Leavitt, William G., "A THEOREM ON REPEATING DECIMALS" (1967). Faculty Publications, Department of Mathematics. 48. https://digitalcommons.unl.edu/mathfacpub/48 This Article is brought to you for free and open access by the Mathematics, Department of at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in Faculty Publications, Department of Mathematics by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. The American Mathematical Monthly, Vol. 74, No. 6 (Jun. - Jul., 1967), pp. 669-673. Copyright 1967 Mathematical Association of America 19671 A THEOREM ON REPEATING DECIMALS A THEOREM ON REPEATING DECIMALS W. G. LEAVITT, University of Nebraska It is well known that a real number is rational if and only if its decimal ex- pansion is a repeating decimal. For example, 2/7 =.285714285714 . Many students also know that if n/m is a rational number reduced to lowest terms (that is, n and m relatively prime), then the number of repeated digits (we call this the length of period) depends only on m. Thus all fractions with denominator 7 have length of period 6. A sharp-eyed student may also notice that when the period (that is, the repeating digits) for 2/7 is split into its two half-periods 285 and 714, then the sum 285+714=999 is a string of nines.
    [Show full text]
  • Repeating Decimals Warm up Problems. A. Find the Decimal Expressions for the Fractions 1 7 , 2 7 , 3 7 , 4 7 , 5 7 , 6 7 . What
    Repeating Decimals Warm up problems. a. Find the decimal expressions for the fractions 1 2 3 4 5 6 ; ; ; ; ; : 7 7 7 7 7 7 What interesting things do you notice? b. Repeat the problem for the fractions 1 2 12 ; ;:::; : 13 13 13 What is interesting about these answers? Every fraction has a decimal representation. These representations either terminate (e.g. 3 8 = 0:375) or or they do not terminate but are repeating (e.g. 3 = 0:428571428571 ::: = 0:428571; ) 7 where the bar over the six block set of digits indicates that that block repeats indefinitely. 1 1. Perform the by hand, long divisions to calculate the decimal representations for 13 2 and 13 . Use these examples to help explain why these fractions have repeating decimals. 2. With these examples can you predict the \interesting things" that you observed in 1 warm up problem b.? Look at the long division for 7 . Does this example confirm your reasoning? 1 3. It turns out that 41 = 0:02439: Write out the long division that shows this and then find (without dividing) the four other fractions whose repeating part has these five digits in the same cyclic order. 4. As it turns out, if you divide 197 by 26, you get a quotient of 7 and a remainder of 15. How can you use this information to find the result when 2 · 197 = 394 is divided by 26? When 5 · 197 = 985 is divided by 26? 5. Suppose that when you divide N by D, the quotient is Q and the remainder is R.
    [Show full text]
  • Irrational Numbers and Rounding Off*
    OpenStax-CNX module: m31341 1 Irrational Numbers and Rounding Off* Rory Adams Free High School Science Texts Project Mark Horner Heather Williams This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3.0 1 Introduction You have seen that repeating decimals may take a lot of paper and ink to write out. Not only is that impossible, but writing numbers out to many decimal places or a high accuracy is very inconvenient and rarely gives practical answers. For this reason we often estimate the number to a certain number of decimal places or to a given number of signicant gures, which is even better. 2 Irrational Numbers Irrational numbers are numbers that cannot be written as a fraction with the numerator and denominator as integers. This means that any number that is not a terminating decimal number or a repeating decimal number is irrational. Examples of irrational numbers are: p p p 2; 3; 3 4; π; p (1) 1+ 5 2 ≈ 1; 618 033 989 tip: When irrational numbers are written in decimal form, they go on forever and there is no repeated pattern of digits. If you are asked to identify whether a number is rational or irrational, rst write the number in decimal form. If the number is terminated then it is rational. If it goes on forever, then look for a repeated pattern of digits. If there is no repeated pattern, then the number is irrational. When you write irrational numbers in decimal form, you may (if you have a lot of time and paper!) continue writing them for many, many decimal places.
    [Show full text]
  • Discrete Signals and Their Frequency Analysis
    Discrete signals and their frequency analysis. Valentina Hubeika, Jan Cernock´yˇ DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz • recapitulation – fundamentals on discrete signals. • periodic and harmonic sequences • discrete signal processing • convolution • Fourier transform with discrete time • Discrete Fourier Transform 1 Sampled signal ⇒ discrete signal During sampling we consider only values of the signal at sampling period multiplies T : x(nT ), nT = ... − 2T, −T, 0,T, 2T, 3T,... For a discrete signal, we forget about real time and simply count the samples. Discrete time becomes : x[n], n = ... − 2, −1, 0, 1, 2, 3,... Thus we often call discrete signals just sequences. 2 Important discrete signals Unit step and unit impulse: 1 for n ≥ 0 1 for n =0 σ[n]= δ[n]= 0 elsewhere 0 elsewhere 3 Periodic discrete signals their behaviour repeats after N samples, the smallest possible N is denoted as N1 and is called fundamental period. Harmonic discrete signals (harmonic sequences) x[n]= C1 cos(ω1n + φ1) (1) • C1 is a positive constant – magnitude. • ω1 is a spositive constant – normalized angular frequency. As n is just a number, the unit of ω1 is [rad]. Note, that in the previous lecture we denoted with the same simbol an angular frequency of continuous signals. Although in the last lecture we used ′ symbol ω1 for discrete time, we will not do it any longer. You will recognize continuous time frequency if there is real time associated with it (for instance cos(ω1t)). If you see discrete time n (for instance cos(ω1n)) you should know we are talking about normalized angular frequency.
    [Show full text]
  • 142857, and More Numbers Like It
    142857, and more numbers like it John Kerl January 4, 2012 Abstract These are brief jottings to myself on vacation-spare-time observations about trans- posable numbers. Namely, 1/7 in base 10 is 0.142857, 2/7 is 0.285714, 3/7 is 0.428571, and so on. That’s neat — can we find more such? What happens when we use denom- inators other than 7, or bases other than 10? The results presented here are generally ancient and not essentially original in their particulars. The current exposition takes a particular narrative and data-driven approach; also, elementary group-theoretic proofs preferred when possible. As much I’d like to keep the presentation here as elementary as possible, it makes the presentation far shorter to assume some first-few-weeks-of-the-semester group theory Since my purpose here is to quickly jot down some observations, I won’t develop those concepts in this note. This saves many pages, at the cost of some accessibility, and with accompanying unevenness of tone. Contents 1 The number 142857, and some notation 3 2 Questions 4 2.1 Are certain constructions possible? . .. 4 2.2 Whatperiodscanexist? ............................. 5 2.3 Whencanfullperiodsexist?........................... 5 2.4 Howdodigitsetscorrespondtonumerators? . .... 5 2.5 What’s the relationship between add order and shift order? . ...... 5 2.6 Why are half-period shifts special? . 6 1 3 Findings 6 3.1 Relationship between expansions and integers . ... 6 3.2 Periodisindependentofnumerator . 6 3.3 Are certain constructions possible? . .. 7 3.4 Whatperiodscanexist? ............................. 7 3.5 Whencanfullperiodsexist?........................... 8 3.6 Howdodigitsetscorrespondtonumerators? . .... 8 3.7 What’s the relationship between add order and shift order? .
    [Show full text]
  • Renormalization Group Calculation of Dynamic Exponent in the Models E and F with Hydrodynamic Fluctuations M
    Vol. 131 (2017) ACTA PHYSICA POLONICA A No. 4 Proceedings of the 16th Czech and Slovak Conference on Magnetism, Košice, Slovakia, June 13–17, 2016 Renormalization Group Calculation of Dynamic Exponent in the Models E and F with Hydrodynamic Fluctuations M. Dančoa;b;∗, M. Hnatiča;c;d, M.V. Komarovae, T. Lučivjanskýc;d and M.Yu. Nalimove aInstitute of Experimental Physics SAS, Watsonova 47, 040 01 Košice, Slovakia bBLTP, Joint Institute for Nuclear Research, Dubna, Russia cInstitute of Physics, Faculty of Sciences, P.J. Safarik University, Park Angelinum 9, 041 54 Košice, Slovakia d‘Peoples’ Friendship University of Russia (RUDN University) 6 Miklukho-Maklaya St, Moscow, 117198, Russian Federation eDepartment of Theoretical Physics, St. Petersburg University, Ulyanovskaya 1, St. Petersburg, Petrodvorets, 198504 Russia The renormalization group method is applied in order to analyze models E and F of critical dynamics in the presence of velocity fluctuations generated by the stochastic Navier–Stokes equation. Results are given to the one-loop approximation for the anomalous dimension γλ and fixed-points’ structure. The dynamic exponent z is calculated in the turbulent regime and stability of the fixed points for the standard model E is discussed. DOI: 10.12693/APhysPolA.131.651 PACS/topics: 64.60.ae, 64.60.Ht, 67.25.dg, 47.27.Jv 1. Introduction measurable index α [4]. The index α has been also de- The liquid-vapor critical point, λ transition in three- termined in the framework of the renormalization group dimensional superfluid helium 4He belong to famous ex- (RG) approach using a resummation procedure [5] up to amples of continuous phase transitions.
    [Show full text]
  • Arxiv:1904.09040V2 [Math.NT]
    PERIODICITIES FOR TAYLOR COEFFICIENTS OF HALF-INTEGRAL WEIGHT MODULAR FORMS PAVEL GUERZHOY, MICHAEL H. MERTENS, AND LARRY ROLEN Abstract. Congruences of Fourier coefficients of modular forms have long been an object of central study. By comparison, the arithmetic of other expansions of modular forms, in particular Taylor expansions around points in the upper-half plane, has been much less studied. Recently, Romik made a conjecture about the periodicity of coefficients around τ0 = i of the classical Jacobi theta function θ3. Here, we generalize the phenomenon observed by Romik to a broader class of modular forms of half-integral weight and, in particular, prove the conjecture. 1. Introduction Fourier coefficients of modular forms are well-known to encode many interesting quantities, such as the number of points on elliptic curves over finite fields, partition numbers, divisor sums, and many more. Thanks to these connections, the arithmetic of modular form Fourier coefficients has long enjoyed a broad study, and remains a very active field today. However, Fourier expansions are just one sort of canonical expansion of modular forms. Petersson also defined [17] the so-called hyperbolic and elliptic expansions, which instead of being associated to a cusp of the modular curve, are associated to a pair of real quadratic numbers or a point in the upper half-plane, respectively. A beautiful exposition on these different expansions and some of their more recent connections can be found in [8]. In particular, there Imamoglu and O’Sullivan point out that Poincar´eseries with respect to hyperbolic expansions include the important examples of Katok [11] and Zagier [26], which are the functions which Kohnen later used [15] to construct the holomorphic kernel for the Shimura/Shintani lift.
    [Show full text]
  • Math 3345-Real Analysis — Lecture 02 9/2/05 1. Are There Really
    Math 3345-Real Analysis — Lecture 02 9/2/05 1. Are there really irrational numbers? We got an indication last time that repeating decimals must be rational. I’ll look at another example, and then we’ll expand that into a quick proof. Consider the number x = 845.7256. The first four digits don’t repeat, but after that the sequence of three digits 256 repeats. If we multiply x by 103 = 1000, we get (1) 1000x = 845,725.6256 That’s part of the trick. Now we subtract (2) 1000x − x = 999x = 845,725.6256 − 845.7256 = 844,879.9000 Therefore, we can write x as 844,879.9 8,448,799 (3) x = = , 999 9990 which is a fraction of integers. The repeating decimal x must be a rational number. Theorem 1. A repeating decimal must be rational. (1) Let x be a repeating decimal. (We want to show that x being rational follows from this assumption.) (2) After some point, we must have n digits repeating forever. (This is what it means to be repeating.) (3) y =10nx − x is a terminating decimal. (When you subtract, the repeating decimals cancel out.) y (4) x = 10n−1 is a fraction of a terminating decimal and an integer. (Basic computation.) (5) x must be a fraction of integers. (You can make any terminating decimal into an integer by multi- plying by a power of 10.) (6) x is rational. (Rationals are fractions of integers.) 1.1. So are all integer fractions repeating decimals? As an example, divide 11 into 235 using long division.
    [Show full text]
  • Situations Conference 2009 Author: Jeanne Shimizu Draft of Situation II (Derived from Personal Experience and Some Input from Glen Blume)
    Situations Conference 2009 Author: Jeanne Shimizu Draft of Situation I: Prompt In a general math class, having just discussed how to convert fractions to their decimal equivalents, students were asked to work on a few practice problems. The following conversation took place. Student A: My group has question. … How do you go backwards? Teacher: What do you mean by “go backwards?” 4 Student A: We know how to take 5 , do 4 divided by 5 and get 0.8. How do you 4 start with 0.8 and get 5 ? Student B: Yeah, and what about 0.333 = 0.3? How do you start with 1 0.333 and get 3 ? What fraction goes with 0.555? Commentary The questions posed by this group of students address the equivalence of a fraction and its decimal counterpart. In other words, for fraction X to be equivalent to decimal number Y, fraction X implies decimal number Y, AND decimal number Y implies fraction X. The mathematical foci use place value, partitions of numbers, and properties of infinite geometric series to illustrate how one might address the latter of these two conditions. Mathematical Foci Mathematical Focus 1: To convert a terminating decimal number to one of its fraction equivalents, we make use of place value. Given A, a rational number where A is expressed in the form, 0.a1a2a3 an , where ai ∈{0,1,2,3,4,5,6,7,8,9}and n is a positive integer. n The place value of the right-most digit of A, an , is 10 ths and serves as the denominator of a fraction equivalent of A.
    [Show full text]