DOCSLIB.ORG

CS 4973 - Mersenne Prime Project Strategy Overivew

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
CS 4973 - Mersenne Prime Project Strategy Overivew CS 4973 - Mersenne Prime Project Strategy Overivew Mersenne Prime Overview p Definition 1. A Mersenne Prime is a prime number of the form Mp = 2 − 1, where p itself is prime. p 1 It should be noted that not all numbers of the form Mp = 2 − 1 are prime. For instance, M11 = 2 1 − 1 = 2047 = 23 · 89. The following table gives a partial list of the 51 known Mersenne primes. # 2p − 1 Digits 1 22 − 1 1 2 23 − 1 1 3 25 − 1 2 4 27 − 1 3 5 213 − 1 4 6 217 − 1 6 7 219 − 1 6 8 231 − 1 10 9 261 − 1 19 . 50 277;232;917 − 1 23,249,425 51 282;589;933 − 1 24,862,048 Lucas{Lehmer Primality Test From the table given above, it should be pretty clear that simply running through a factorization algorithm for Mp becomes computationally expensive. Note that we will be looking for Mersenne primes for p > 82; 589; 933 having more than 24,862,048 digits. There are way more primes, whose number of digits is less than 25 million, than we can check in a realistic time frame. E.g. There are 1,000,000,000,000 primes less than or equal to 29,996,224,275,833, which only has 14 digits. Thus, we need a different approach to determine if Mp is prime for some prime number p. This is where the Lucas{Lehmer Primality Test (LLT) comes in. First we define the sequence sn as follows: ( 4; n = 0 (1) sn = 2 sn−1 − 2; n > 0 Theorem 1. The Mersenne number Mp is prime if and only if Sp−2 ≡ 0 mod Mp Here we must remember that mod is simply the remainder after division. For instance, 58 mod 6 = 4 since 58 = 6 · 9 + 4. Note that the sequence terminates at term p − 2, where p is the value of the exponent in Mp. Thus, for our consideration, the least amount of iterations we must calculate is 82; 589; 933 − 2 = 82; 589; 931. Since for 2 n > 0, sn = sn−1 − 2 we expect the number of digits in each iteration to approximately double. This test becomes computationally impossible as it currently is states. For example, the following table lists the approximate values of sn. Note that s23 has 4,797,843 digits, and we need to be able to compute s82;589;931. There are simply not enough bits on a computer (or perhaps atoms in the universe) to store all the digits of s82;589;931. In order to circumvent this large number problem, through the properties of modular arithmetic, we can modify the sequence sn as follows (call it tn instead): ( 4; n = 0 (2) tn = 2 tn−1 − 2 mod Mp; n > 0 1 2 # sn # sn # sn 0 4 8 2:62 × 10146 16 1:43 × 1037483 1 14 9 6:87 × 10292 17 2:04 × 1074966 2 194 10 4:72 × 10585 18 4:15 × 10149932 3 37634 11 2:23 × 101171 19 1:72 × 10299865 4 1:42 × 109 12 4:98 × 102342 20 2:96 × 10599730 5 2:01 × 1018 13 2:48 × 104685 21 8:77 × 101199460 6 4:02 × 1036 14 6:15 × 109370 22 7:70 × 102398921 7 1:62 × 1073 15 3:78 × 1018741 23 5:93 × 104797843 If Mp is an integer of length k, then the largest tn will be is 2k + 1, and then applying mod by Mp cuts the length back down to at most k. We next do a couple of examples: 13 We start with M13 = 2 − 1 = 8191. We will have to compute t0, t1,... t11 and then check to see if t11 = 0. # tn 0 4 1 14 2 194 3 37634 mod 8191 = 4870 4 23716898 mod 8191 = 3953 5 15626207 mod 8191 = 5970 6 35640898 mod 8191 = 1857 7 3448447 mod 8191 = 36 8 1294 9 1674434 mod 8191 = 3470 10 12040898 mod 8191 = 128 11 16382 mod 8191 = 0 Since we know that M13 is indeed a Mersenne prime, we should end up with t11 = 0, which we have. Next we will perform the same process for M11 = 2047 which we know to not be a Mersenne prime, and we shall see that t9 6= 0: # tn 0 4 1 14 2 194 3 37634 mod 2047 = 788 4 620942 mod 2047 = 701 5 491399 mod 2047 = 119 6 14159 mod 2047 = 1877 7 3523127 mod 2047 = 240 8 57598 mod 2047 = 282 9 79522 mod 2047 = 1736 Implementing LLT Since we are going to be looking at values of p greater than 83,000,000, which has 25 million digits, we must start 38;382;750 with s26 =≈ 1:52 × 10 and mod it by Mp where p > 82; 589; 933 to get t26. Note that sk = tk for 0 ≤ k < 26, and after performing the mod required to get t26, to obtain t27, we must square t26, subtract two, and then mod it by Mp. This process is repeated for 26 ≤ k ≤ p−2. In general, the two main computational components to deal with are (1) squaring tk−1 at each iteration 3 2 (2) modding tk−1 − 2 by Mp We will focus on (2) first, as it may impact how we deal with (1). As stated at the beginning of this document, when performing the integer operation a mod b, we simply compute the remainder after dividing a by b. However, when performing division of two numbers, both of which will have millions of digits, it behooves us to find a shortcut if possible. And one such shortcut exists. j x k (3) x mod (2p − 1) = x mod 2p + mod (2p − 1) 2p In binary fashion, this states that the first p bits of x plus the remaining leftmost bits of x are equivalent x mod (2p − 1). This equivalence can be used repeatedly until at most p bits remain. In this way, the remainder after dividing x by the Mersenne number (2p − 1) is computed without using division. 6 As an example, let us compute 28352 mod (2 − 1). In binary form, we have that 28352 = 1101110110000002, and 6 of course, 2 −1 = 63 = 1111112. The least significant 6 bits of 1101110110000002 are 0000002 and the remainder are 1101110112. Adding these two together gives 1101110112. repeating this process again, the least significant 6 bits are 1110112, with the remainder of bits being 1102. This gives 1110112 + 1102 = 10000012. This last result is still 7 digits long, so we must apply the reduction once more: The least significant digits are 0000012, and the remaining single digit is 12. Adding these together gives 102. Converting to base 10 since the result had 6 or fewer digits, we 6 have 102 = 2. One can calculate readily that indeed, 28352 mod (2 − 1) = 2. We write this out in a stepwise fashion as follows: 6 28352 mod (2 − 1) = 1101110110000002 mod 1111112 = (0000002 + 1101110112) mod 1111112 = 1101110112 mod 1111112 = (1110112 + 1102) mod 1111112 = 10000012 mod 1111112 = (0000012 + 12) mod 1111112 = 102 mod 1111112 = 102 = 2: Next up, we focus on (1), the squaring of tk−1. The best non-FFT way to perform multiplication, which is also reasonably straight forward to understand and implement is the Karatsuba Algorithm. We will start with the base 10 overview first The idea is that if we wish to multiply two numbers x and y, we choose a power of 10 large enough a a a so that we can express x as x = x0 · 10 + x1 and y = y0 · 10 + y1, with 10 > x1; y1. Then we have 2a a (4) x · y = x0 · y0 · 10 + (x0 · y1 + x1 · y0)10 + x1 · y1 If x and y are of the same length, say 2n, then instead of multiplying two length 2n numbers together, we multiply 4 pairs of digits of length n with three additions. If we wish to reduce the number of multiplications to three, we can use the identity x0 · y1 + x1 · y0 = (x0 + x1)(y0 + y1) − x0 · y0 − x1 · y1: Note that the last two terms on the right hand side of the above must be computed anyways, since x0 ·y0 is multiplied 2a by the 10 term, and x1 · y1 is the `constant' term. Note that this does introduce the operation of subtraction into the process. We must also be careful of choosing a correct value of a. It should most likely be as balanced as possible (close to half the decimal places, but at least half). So here is the process in outline form: a a a (1) Find a value of a so that x = x0 · 10 + x1 and y = y0 · 10 + y1, with 10 > x1; y1 (2) Perform multiplication z0 = x0 · y0 (3) Perform multiplication z2 = x1 · y1 (4) Perform two additions and a multiplication (x0 + x1)(y0 + y1) (5) Perform two subtractions z1 = (x0 + x1)(y0 + y1) − z0 − z2 2a a (6) Perform two additions x · y = z0 · 10 + z1 · 10 + z2. If we are wanting to square a number, then x0 = y0 and x1 = y1 so that 4 2a a (5) x · x = x0 · x0 · 10 + 2 · x0 · x1 · 10 + x1 · x1 If we were so inclined, we could rewrite the middle term using the identity: 2x0 · x1 = x0 · x0 + x1 · x1 − (x0 + x1) · (x0 + x1); where three multiplications can be reduced to two with some additions and subtractions. That being said, one of the multiplications is multiplying by two, so it may actually be faster to leave the middle term's coefficient as 2·x0 ·x1.
Load more

Recommended publications
  • 1 Mersenne Primes and Perfect Numbers
    1 Mersenne Primes and Perfect Numbers Basic idea: try to construct primes of the form an − 1; a, n ≥ 1. e.g., 21 − 1 = 3 but 24 − 1=3· 5 23 − 1=7 25 − 1=31 26 − 1=63=32 · 7 27 − 1 = 127 211 − 1 = 2047 = (23)(89) 213 − 1 = 8191 Lemma: xn − 1=(x − 1)(xn−1 + xn−2 + ···+ x +1) Corollary:(x − 1)|(xn − 1) So for an − 1tobeprime,weneeda =2. Moreover, if n = md, we can apply the lemma with x = ad.Then (ad − 1)|(an − 1) So we get the following Lemma If an − 1 is a prime, then a =2andn is prime. Definition:AMersenne prime is a prime of the form q =2p − 1,pprime. Question: are they infinitely many Mersenne primes? Best known: The 37th Mersenne prime q is associated to p = 3021377, and this was done in 1998. One expects that p = 6972593 will give the next Mersenne prime; this is close to being proved, but not all the details have been checked. Definition: A positive integer n is perfect iff it equals the sum of all its (positive) divisors <n. Definition: σ(n)= d|n d (divisor function) So u is perfect if n = σ(u) − n, i.e. if σ(u)=2n. Well known example: n =6=1+2+3 Properties of σ: 1. σ(1) = 1 1 2. n is a prime iff σ(n)=n +1 p σ pj p ··· pj pj+1−1 3. If is a prime, ( )=1+ + + = p−1 4. (Exercise) If (n1,n2)=1thenσ(n1)σ(n2)=σ(n1n2) “multiplicativity”.
    [Show full text]
  • Mersenne and Fermat Numbers 2, 3, 5, 7, 13, 17, 19, 31
    MERSENNE AND FERMAT NUMBERS RAPHAEL M. ROBINSON 1. Mersenne numbers. The Mersenne numbers are of the form 2n — 1. As a result of the computation described below, it can now be stated that the first seventeen primes of this form correspond to the following values of ra: 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281. The first seventeen even perfect numbers are therefore obtained by substituting these values of ra in the expression 2n_1(2n —1). The first twelve of the Mersenne primes have been known since 1914; the twelfth, 2127—1, was indeed found by Lucas as early as 1876, and for the next seventy-five years was the largest known prime. More details on the history of the Mersenne numbers may be found in Archibald [l]; see also Kraitchik [4]. The next five Mersenne primes were found in 1952; they are at present the five largest known primes of any form. They were announced in Lehmer [7] and discussed by Uhler [13]. It is clear that 2" —1 can be factored algebraically if ra is composite; hence 2n —1 cannot be prime unless w is prime. Fermat's theorem yields a factor of 2n —1 only when ra + 1 is prime, and hence does not determine any additional cases in which 2"-1 is known to be com- posite. On the other hand, it follows from Euler's criterion that if ra = 0, 3 (mod 4) and 2ra + l is prime, then 2ra + l is a factor of 2n— 1.
    [Show full text]
  • New Formulas for Semi-Primes. Testing, Counting and Identification
    New Formulas for Semi-Primes. Testing, Counting and Identification of the nth and next Semi-Primes Issam Kaddouraa, Samih Abdul-Nabib, Khadija Al-Akhrassa aDepartment of Mathematics, school of arts and sciences bDepartment of computers and communications engineering, Lebanese International University, Beirut, Lebanon Abstract In this paper we give a new semiprimality test and we construct a new formula for π(2)(N), the function that counts the number of semiprimes not exceeding a given number N. We also present new formulas to identify the nth semiprime and the next semiprime to a given number. The new formulas are based on the knowledge of the primes less than or equal to the cube roots 3 of N : P , P ....P 3 √N. 1 2 π( √N) ≤ Keywords: prime, semiprime, nth semiprime, next semiprime 1. Introduction Securing data remains a concern for every individual and every organiza- tion on the globe. In telecommunication, cryptography is one of the studies that permits the secure transfer of information [1] over the Internet. Prime numbers have special properties that make them of fundamental importance in cryptography. The core of the Internet security is based on protocols, such arXiv:1608.05405v1 [math.NT] 17 Aug 2016 as SSL and TSL [2] released in 1994 and persist as the basis for securing dif- ferent aspects of today’s Internet [3]. The Rivest-Shamir-Adleman encryption method [4], released in 1978, uses asymmetric keys for exchanging data. A secret key Sk and a public key Pk are generated by the recipient with the following property: A message enciphered Email addresses: [email protected] (Issam Kaddoura), [email protected] (Samih Abdul-Nabi) 1 by Pk can only be deciphered by Sk and vice versa.
    [Show full text]
  • The Pseudoprimes to 25 • 109
    MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 151 JULY 1980, PAGES 1003-1026 The Pseudoprimes to 25 • 109 By Carl Pomerance, J. L. Selfridge and Samuel S. Wagstaff, Jr. Abstract. The odd composite n < 25 • 10 such that 2n_1 = 1 (mod n) have been determined and their distribution tabulated. We investigate the properties of three special types of pseudoprimes: Euler pseudoprimes, strong pseudoprimes, and Car- michael numbers. The theoretical upper bound and the heuristic lower bound due to Erdös for the counting function of the Carmichael numbers are both sharpened. Several new quick tests for primality are proposed, including some which combine pseudoprimes with Lucas sequences. 1. Introduction. According to Fermat's "Little Theorem", if p is prime and (a, p) = 1, then ap~1 = 1 (mod p). This theorem provides a "test" for primality which is very often correct: Given a large odd integer p, choose some a satisfying 1 <a <p - 1 and compute ap~1 (mod p). If ap~1 pi (mod p), then p is certainly composite. If ap~l = 1 (mod p), then p is probably prime. Odd composite numbers n for which (1) a"_1 = l (mod«) are called pseudoprimes to base a (psp(a)). (For simplicity, a can be any positive in- teger in this definition. We could let a be negative with little additional work. In the last 15 years, some authors have used pseudoprime (base a) to mean any number n > 1 satisfying (1), whether composite or prime.) It is well known that for each base a, there are infinitely many pseudoprimes to base a.
    [Show full text]
  • Primes and Primality Testing
    Primes and Primality Testing A Technological/Historical Perspective Jennifer Ellis Department of Mathematics and Computer Science What is a prime number? A number p greater than one is prime if and only if the only divisors of p are 1 and p. Examples: 2, 3, 5, and 7 A few larger examples: 71887 524287 65537 2127 1 Primality Testing: Origins Eratosthenes: Developed “sieve” method 276-194 B.C. Nicknamed Beta – “second place” in many different academic disciplines Also made contributions to www-history.mcs.st- geometry, approximation of andrews.ac.uk/PictDisplay/Eratosthenes.html the Earth’s circumference Sieve of Eratosthenes 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 Sieve of Eratosthenes We only need to “sieve” the multiples of numbers less than 10. Why? (10)(10)=100 (p)(q)<=100 Consider pq where p>10. Then for pq <=100, q must be less than 10. By sieving all the multiples of numbers less than 10 (here, multiples of q), we have removed all composite numbers less than 100.
    [Show full text]
  • Appendix a Tables of Fermat Numbers and Their Prime Factors
    Appendix A Tables of Fermat Numbers and Their Prime Factors The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. Carl Friedrich Gauss Disquisitiones arithmeticae, Sec. 329 Fermat Numbers Fo =3, FI =5, F2 =17, F3 =257, F4 =65537, F5 =4294967297, F6 =18446744073709551617, F7 =340282366920938463463374607431768211457, Fs =115792089237316195423570985008687907853 269984665640564039457584007913129639937, Fg =134078079299425970995740249982058461274 793658205923933777235614437217640300735 469768018742981669034276900318581864860 50853753882811946569946433649006084097, FlO =179769313486231590772930519078902473361 797697894230657273430081157732675805500 963132708477322407536021120113879871393 357658789768814416622492847430639474124 377767893424865485276302219601246094119 453082952085005768838150682342462881473 913110540827237163350510684586298239947 245938479716304835356329624224137217. The only known Fermat primes are Fo, ... , F4 • 208 17 lectures on Fermat numbers Completely Factored Composite Fermat Numbers m prime factor year discoverer 5 641 1732 Euler 5 6700417 1732 Euler 6 274177 1855 Clausen 6 67280421310721* 1855 Clausen 7 59649589127497217 1970 Morrison, Brillhart 7 5704689200685129054721 1970 Morrison, Brillhart 8 1238926361552897 1980 Brent, Pollard 8 p**62 1980 Brent, Pollard 9 2424833 1903 Western 9 P49 1990 Lenstra, Lenstra, Jr., Manasse, Pollard 9 p***99 1990 Lenstra, Lenstra, Jr., Manasse, Pollard
    [Show full text]
  • Properties of Pell Numbers Modulo Prime Fermat Numbers 1 General
    Properties of Pell numbers modulo prime Fermat numbers Tony Reix ([email protected]) 2005, ??th of February The Pell numbers are generated by the Lucas Sequence: 2 Xn = P Xn−1 QXn−2 with (P, Q)=(2, 1) and D = P 4Q = 8. There are: − − − The Pell Sequence: Un = 2Un−1 + Un−2 with (U0, U1)=(0, 1), and ◦ The Companion Pell Sequence: V = 2V + V with (V , V )=(2, 2). ◦ n n−1 n−2 0 1 The properties of Lucas Sequences (named from Edouard´ Lucas) are studied since hundreds of years. Paulo Ribenboim and H.C. Williams provided the properties of Lucas Sequences in their 2 famous books: ”The Little Book of Bigger Primes” (PR) and ”Edouard´ Lucas and Primality Testing” (HCW). The goal of this paper is to gather all known properties of Pell numbers in order to try proving a faster Primality test of Fermat numbers. Though these properties are detailed in the Ribenboim’s and Williams’ books, the special values of (P, Q) lead to new properties. Properties from Ribenboim’s book are noted: (PR). Properties from Williams’ book are noted: (HCW). Properties built by myself are noted: (TR). n -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10 Un 5 -2 1 0 1 2 5 12 29 70 169 408 985 2378 Vn -14 6 -2 2 2 6 14 34 82 198 478 1154 2786 6726 Table 1: First Pell numbers 1 General properties of Pell numbers 1.1 The Little Book of Bigger Primes The polynomial X2 2X 1 has discriminant D = 8 and roots: − − α = 1 √2 β ± 1 So: α + β = 2 αβ = 1 − α β = 2√2 − and we define the sequences of numbers: αn βn U = − and V = αn + βn for n 0.
    [Show full text]
  • The Distribution of Pseudoprimes
    The Distribution of Pseudoprimes Matt Green September, 2002 The RSA crypto-system relies on the availability of very large prime num- bers. Tests for finding these large primes can be categorized as deterministic and probabilistic. Deterministic tests, such as the Sieve of Erastothenes, of- fer a 100 percent assurance that the number tested and passed as prime is actually prime. Despite their refusal to err, deterministic tests are generally not used to find large primes because they are very slow (with the exception of a recently discovered polynomial time algorithm). Probabilistic tests offer a much quicker way to find large primes with only a negligibal amount of error. I have studied a simple, and comparatively to other probabilistic tests, error prone test based on Fermat’s little theorem. Fermat’s little theorem states that if b is a natural number and n a prime then bn−1 ≡ 1 (mod n). To test a number n for primality we pick any natural number less than n and greater than 1 and first see if it is relatively prime to n. If it is, then we use this number as a base b and see if Fermat’s little theorem holds for n and b. If the theorem doesn’t hold, then we know that n is not prime. If the theorem does hold then we can accept n as prime right now, leaving a large chance that we have made an error, or we can test again with a different base. Chances improve that n is prime with every base that passes but for really big numbers it is cumbersome to test all possible bases.
    [Show full text]
  • Some New Results on Odd Perfect Numbers
    Pacific Journal of Mathematics SOME NEW RESULTS ON ODD PERFECT NUMBERS G. G. DANDAPAT,JOHN L. HUNSUCKER AND CARL POMERANCE Vol. 57, No. 2 February 1975 PACIFIC JOURNAL OF MATHEMATICS Vol. 57, No. 2, 1975 SOME NEW RESULTS ON ODD PERFECT NUMBERS G. G. DANDAPAT, J. L. HUNSUCKER AND CARL POMERANCE If ra is a multiply perfect number (σ(m) = tm for some integer ί), we ask if there is a prime p with m = pan, (pa, n) = 1, σ(n) = pα, and σ(pa) = tn. We prove that the only multiply perfect numbers with this property are the even perfect numbers and 672. Hence we settle a problem raised by Suryanarayana who asked if odd perfect numbers neces- sarily had such a prime factor. The methods of the proof allow us also to say something about odd solutions to the equation σ(σ(n)) ~ 2n. 1* Introduction* In this paper we answer a question on odd perfect numbers posed by Suryanarayana [17]. It is known that if m is an odd perfect number, then m = pak2 where p is a prime, p Jf k, and p = a z= 1 (mod 4). Suryanarayana asked if it necessarily followed that (1) σ(k2) = pa , σ(pa) = 2k2 . Here, σ is the sum of the divisors function. We answer this question in the negative by showing that no odd perfect number satisfies (1). We actually consider a more general question. If m is multiply perfect (σ(m) = tm for some integer t), we say m has property S if there is a prime p with m = pan, (pa, n) = 1, and the equations (2) σ(n) = pa , σ(pa) = tn hold.
    [Show full text]
  • PELL FACTORIANGULAR NUMBERS Florian Luca, Japhet Odjoumani
    PUBLICATIONS DE L’INSTITUT MATHÉMATIQUE Nouvelle série, tome 105(119) (2019), 93–100 DOI: https://doi.org/10.2298/PIM1919093L PELL FACTORIANGULAR NUMBERS Florian Luca, Japhet Odjoumani, and Alain Togbé Abstract. We show that the only Pell numbers which are factoriangular are 2, 5 and 12. 1. Introduction Recall that the Pell numbers Pm m> are given by { } 1 αm βm P = − , for all m > 1, m α β − where α =1+ √2 and β =1 √2. The first few Pell numbers are − 1, 2, 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860, 33461, 80782, 195025,... Castillo [3], dubbed a number of the form Ftn = n!+ n(n + 1)/2 for n > 1 a factoriangular number. The first few factoriangular numbers are 2, 5, 12, 34, 135, 741, 5068, 40356, 362925,... Luca and Gómez-Ruiz [8], proved that the only Fibonacci factoriangular numbers are 2, 5 and 34. This settled a conjecture of Castillo from [3]. In this paper, we prove the following related result. Theorem 1.1. The only Pell numbers which are factoriangular are 2, 5 and 12. Our method is similar to the one from [8]. Assuming Pm = Ftn for positive integers m and n, we use a linear forms in p-adic logarithms to find some bounds on m and n. The resulting bounds are large so we run a calculation to reduce the bounds. This computation is highly nontrivial and relates on reducing the diophantine equation Pm = Ftn modulo the primes from a carefully selected finite set of suitable primes. 2010 Mathematics Subject Classification: Primary 11D59, 11D09, 11D7; Secondary 11A55.
    [Show full text]
  • Unit Name: Powers and Multiples of 10
    Dear Parents, We will begin our next unit of study in math soon. The information below will serve as an overview of the unit as you work to support your child at home. If you have any questions, please feel free to contact me. I appreciate your on-going support. Sincerely, Your Child’s Teacher Unit Name: Powers and Multiples of 10 Common Core State Standards: 5.NBT.1 Recognize that in a multi-digit number, a digit in one place represents 10 times as much as it represents in the place to its right and 1/10 of what it represents in the place to its left. 5.NBT.2 Explain patterns in the number of zeros of the product when multiplying a number by powers of 10, and explain patterns in the placement of the decimal point when a decimal is multiplied or divided by a power of 10. Use whole-number exponents to denote powers of 10. Essential Vocabulary: place value decimal number powers of 10 expanded form Unit Overview: Students extend their understanding of the base-ten system by looking at the relationship among place values. Students are required to reason about the magnitude of numbers. Students should realize that the tens place is ten times as much as the ones place, and the ones place is 1/10th the size of the tens place. New at Grade 5 is the use of whole number exponents to represent powers of 10. Students should understand why multiplying by a power of 10 shifts the digits of a whole number that many places to the left.
    [Show full text]
  • A Family of Sequences Generating Smith Numbers
    1 2 Journal of Integer Sequences, Vol. 16 (2013), 3 Article 13.4.6 47 6 23 11 A Family of Sequences Generating Smith Numbers Amin Witno Department of Basic Sciences Philadelphia University 19392 Jordan [email protected] Abstract Infinitely many Smith numbers can be constructed using sequences which involve repunits. We provide an alternate method of construction by introducing a generaliza- tion of repunits, resulting in new Smith numbers whose decimal digits are composed of zeros and nines. 1 Introduction We work with natural numbers in their decimal representation. Let S(N) denote the “digital sum” (the sum of the base-10 digits) of the number N and let Sp(N) denote the sum of all the digital sums of the prime factors of N, counting multiplicity. For instance, S(2013) = 2+0+1+3 = 6 and, since 2013 = 3 × 11 × 61, we have Sp(2013) = 3+1+1+6+1 = 12. The quantity Sp(N) does not seem to have a name in the literature, so let us just call Sp(N) the p-digit sum of N. The natural number N is called a Smith number when N is composite and S(N)= Sp(N). For example, since 22 = 2 × 11, we have both S(22) = 4 and Sp(22) = 4. Hence, 22 is a Smith number—thus named by Wilansky [4] in 1982. Several different ways of constructing Smith numbers are already known. (See our 2010 article [5], for instance, which contains a brief historical account on the subject as well as a list of references.
    [Show full text]