Some results on k-free numbers

Size: px
Start display at page:

Download "Some results on k-free numbers"

Transcription

1 Patrick Letendre 05 october 2013 Patrick Letendre Some results on k-free numbers 05 october / 17

2 A local point of view (1) Patrick Letendre Some results on k-free numbers 05 october / 17

3 A local point of view (1) Let where µ k (n) = Q k (x) := x µ k (n), n=1 { 1 if n is k-free 0 if n is not k-free. Patrick Letendre Some results on k-free numbers 05 october / 17

4 A local point of view (1) Let where µ k (n) = Q k (x) := x µ k (n), n=1 { 1 if n is k-free 0 if n is not k-free. For h N, we define g k (h) := max x 0 Q k(x + h) Q k (x). Patrick Letendre Some results on k-free numbers 05 october / 17

5 A local point of view (2) Patrick Letendre Some results on k-free numbers 05 october / 17

6 A local point of view (2) For some c 1,k, c 2,k > 0 we have c 1,k h 1/k (ln h) 1/k (ln ln h) 1 1/k g k(h) h ζ(k) c h 2/(k+1) 2,k (ln h). 2k/(k+1) Patrick Letendre Some results on k-free numbers 05 october / 17

7 A local point of view (2) For some c 1,k, c 2,k > 0 we have c 1,k h 1/k (ln h) 1/k (ln ln h) 1 1/k g k(h) h ζ(k) c h 2/(k+1) 2,k (ln h). 2k/(k+1) It is unclear what is the exact order for g k (h). We expect that for each ɛ > 0. g k (h) h ζ(k) h1/k+ɛ Patrick Letendre Some results on k-free numbers 05 october / 17

8 A local point of view (2) For some c 1,k, c 2,k > 0 we have c 1,k h 1/k (ln h) 1/k (ln ln h) 1 1/k g k(h) h ζ(k) c h 2/(k+1) 2,k (ln h). 2k/(k+1) It is unclear what is the exact order for g k (h). We expect that g k (h) h ζ(k) h1/k+ɛ for each ɛ > 0. Under a plausible conjecture we can show that for each ɛ > 0. g k (h) h ζ(k) h3/(2k+1)+ɛ Patrick Letendre Some results on k-free numbers 05 october / 17

9 A local point of view (3) Patrick Letendre Some results on k-free numbers 05 october / 17

10 A local point of view (3) On the opposite direction, we can find gaps of length ζ(k) k ln x (1 + o(1)) ln ln x as x. So at least everything in 0 Q k (x + h) Q k (x) h ζ(k) + c h 1/k 1,k (ln h) 1/k (ln ln h) 1 1/k happen. Patrick Letendre Some results on k-free numbers 05 october / 17

11 A first global point of view (1) Patrick Letendre Some results on k-free numbers 05 october / 17

12 A first global point of view (1) We want to know the normal behavior of Q k (x + h) Q k (x). Patrick Letendre Some results on k-free numbers 05 october / 17

13 A first global point of view (1) We want to know the normal behavior of Q k (x + h) Q k (x). We define N 1 h M k (N, h) := µ k (n + a) h 2 ζ(k). n=0 a=1 Patrick Letendre Some results on k-free numbers 05 october / 17

14 A first global point of view (2) Theorem. (Hall, L.) We have M k (N, h) = γ k h 1/k N + E k (h, N) where and E k (h, N) Nh 1/2k exp( c ln h) + Nh θ k +N 2/(k+1) h 2 2/(k+1) ln N + h 2 N 1/k ln N ζ(1/k 1) γ k := 2 1/k 1 ( p 1 1 p 2 2 p k + 2 p k+1 ). Patrick Letendre Some results on k-free numbers 05 october / 17

15 A first global point of view (3) Patrick Letendre Some results on k-free numbers 05 october / 17

16 A first global point of view (3) We can take θ 2 = 11 53, θ 3 = 1 6, θ 4 = , θ 5 = , θ 6 = θ k { 6 7k+6 for k {7, 8, 9, 10, 11} 1 for k 12 k+3. Patrick Letendre Some results on k-free numbers 05 october / 17

17 A first global point of view (3) We can take θ 2 = 11 53, θ 3 = 1 6, θ 4 = , θ 5 = , θ 6 = θ k { 6 7k+6 for k {7, 8, 9, 10, 11} 1 for k 12 k+3. With the exponent pairs conjecture, we have for each ɛ > 0. θ k = 1 2k ɛ Patrick Letendre Some results on k-free numbers 05 october / 17

18 A first global point of view (4) Patrick Letendre Some results on k-free numbers 05 october / 17

19 A first global point of view (4) For all but Nh 2ɛ value of x [0, N] N we have Q k (x + h) Q k (x) = for h N k 1 2k 1 /ln k 2k 1 N. h ζ(k) + O(h1/2k+ɛ ) Patrick Letendre Some results on k-free numbers 05 october / 17

20 A first global point of view (4) For all but Nh 2ɛ value of x [0, N] N we have Q k (x + h) Q k (x) = for h N k 1 2k 1 /ln k 2k 1 N. We also have the upper bound for h N 1/2. M k (h, N) Nh 2/k h ζ(k) + O(h1/2k+ɛ ) Patrick Letendre Some results on k-free numbers 05 october / 17

21 A first global point of view (4) For all but Nh 2ɛ value of x [0, N] N we have Q k (x + h) Q k (x) = for h N k 1 2k 1 /ln k 2k 1 N. We also have the upper bound for h N 1/2. M k (h, N) Nh 2/k h ζ(k) + O(h1/2k+ɛ ) There is a lot of overlapping of intervals in the definition of M k (N, h). Patrick Letendre Some results on k-free numbers 05 october / 17

22 A second global point of view (1) Patrick Letendre Some results on k-free numbers 05 october / 17

23 A second global point of view (1) For N = h(m + 1) and for each β [0, h 1] N we define M h T k (β, h, M) := µ k (nh + a + β) h 2 ζ(k). n=0 a=1 Patrick Letendre Some results on k-free numbers 05 october / 17

24 A second global point of view (1) For N = h(m + 1) and for each β [0, h 1] N we define T k (β, h, M) := We have the relation M h µ k (nh + a + β) h 2 ζ(k). n=0 a=1 h 1 T k (β, h, M) = M k (N, h). β=0 Patrick Letendre Some results on k-free numbers 05 october / 17

25 A second global point of view (2) Theorem. (L.) For N = h(m + 1) we have where T k (β, h, M) = γ k h 1/k (M + 1) + R k (h, N) R k (h, N) Mh θ k + Mh 1/2k p j (h,γ k (h)) +h 2 M 1/k ln N + hm 2/(k+1) ln N p h ( p k j p 1 j/2k ( ) p k/(k+1) ) Patrick Letendre Some results on k-free numbers 05 october / 17

26 A second global point of view (3) Patrick Letendre Some results on k-free numbers 05 october / 17

27 A second global point of view (3) We also have the upper bound T k (β, h, N) Mh 2/k for h N 1/3. Patrick Letendre Some results on k-free numbers 05 october / 17

28 A second global point of view (3) We also have the upper bound T k (β, h, N) Mh 2/k for h N 1/3. We have found a way to cut the interval [1, N] in small subsets and show that the average of µ k on those subsets is what we expect for most of them. Can we do the same for more general partition of [1, N] like µ k (n) I 2 n ζ(k) n 1 a I n where I n are intervals with h I n 2h, I n = [1, N], I n I m = n m. n Patrick Letendre Some results on k-free numbers 05 october / 17

29 Arithmetic progression (1) Patrick Letendre Some results on k-free numbers 05 october / 17

30 Arithmetic progression (1) We define where and Q k (a, q, x) := g k (a, q) := 1 qζ(k) W k (q, x) := x n=1 n a mod q q E k (a, q, x) 2 a=1 µ k (n) =: g k (a, q)x + E k (a, q, x) ( 1 1 ) 1 p k p q p q (q,p k ) a ( 1 (q, ) pk ). p k Patrick Letendre Some results on k-free numbers 05 october / 17

31 Arithmetic progression (2) Theorem. (L.) For x = qm, with M 1 and M R, we have W K (q, x) = γ k (q)qm 1/k + R k (q, x) where R k (q, x) 2 ω(q) q ( ) 2p p q +M θ k q ( p kθ k p q + l(kθ k )M 1/2k q p q ) + 2ω(q) x 1+1/k ln x. q ( ) p 1/2 Patrick Letendre Some results on k-free numbers 05 october / 17

32 Arithmetic progression (3) ζ(1/k 1) γ k (q) := 2 1/k 1 p α q (r 1)k<α rk r j=1 1 p jk 1 p α+r α/r (( 1 1 p ( p q 1 1 p 2 2 p k + 2 p k+1 )(( 1 1 p 2 2 p k + 2 p k+1 ( µ(p j ) 1 p 1 p p k+1 )) ([ ] 1 1 r p 1 p + 2 )) 2 p k+1 ) ) Patrick Letendre Some results on k-free numbers 05 october / 17

33 Arithmetic progression (4) Corollary. For 1 q x we have W k (q, x) x 2/k q 1 2/k. Patrick Letendre Some results on k-free numbers 05 october / 17

34 Applications Some results on k-free numbers Patrick Letendre Some results on k-free numbers 05 october / 17

35 Applications Some results on k-free numbers Evaluate for various functions. x µ k (n)f (n) n=1 Patrick Letendre Some results on k-free numbers 05 october / 17

36 Applications Evaluate for various functions. x µ k (n)f (n) n=1 Counting the solutions to the congruence f (x 1,..., x n ) 0 mod q for a polynomial f Z[x 1,..., x n ] when (x 1,..., x n ) [1, x] n with q x. Patrick Letendre Some results on k-free numbers 05 october / 17

37 References Some results on k-free numbers T. Cochrane and S. Shi, The congruence x 1 x 2 x 3 x 4 (mod m) and mean values of character sums, J. Number Theory 130 (2010), S. W. Graham, Moments of gaps between k-free numbers, J. Number Theory 44 (1993), R. R. Hall, Squarefree numbers on short intervals, Mathematika 29 (1982), P. Letendre, to appear. Patrick Letendre Some results on k-free numbers 05 october / 17

Integer factorization, part 1: the Q sieve. D. J. Bernstein

Integer factorization, part 1: the Q sieve. D. J. Bernstein Integer factorization, part 1: the Q sieve D. J. Bernstein Sieving small integers 0 using primes 3 5 7: 1 3 3 4 5 5 6 3 7 7 8 9 3 3 10 5 11 1 3 13 14 7 15 3 5 16 17 18 3 3 19 0 5 etc. Sieving and 611 +

More information

Primes of the Form x 2 + ny 2

Primes of the Form x 2 + ny 2 Primes of the Form x 2 + ny 2 Steven Charlton 28 November 2012 Outline 1 Motivating Examples 2 Quadratic Forms 3 Class Field Theory 4 Hilbert Class Field 5 Narrow Class Field 6 Cubic Forms 7 Modular Forms

More information

Roots and Coefficients Polynomials Preliminary Maths Extension 1

Roots and Coefficients Polynomials Preliminary Maths Extension 1 Preliminary Maths Extension Question If, and are the roots of x 5x x 0, find the following. (d) (e) Question If p, q and r are the roots of x x x 4 0, evaluate the following. pq r pq qr rp p q q r r p

More information

' Liberty and Umou Ono and Inseparablo "

' Liberty and Umou Ono and Inseparablo 3 5? #< q 8 2 / / ) 9 ) 2 ) > < _ / ] > ) 2 ) ) 5 > x > [ < > < ) > _ ] ]? <

More information

Wilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes

Wilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes Wilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes Steiner systems S(2, k, v) For k 3, a Steiner system S(2, k, v) is usually defined as a pair (V, B), where V is a set

More information

EXPONENTIAL SUMS EQUIDISTRIBUTION

EXPONENTIAL SUMS EQUIDISTRIBUTION EXPONENTIAL SUMS EQUIDISTRIBUTION PSEUDORANDOMNESS (1) Exponential sums over subgroups General philosophy: multiplicative subgroups are well-distributed even if they are very small Conjecture. (M-V-W)

More information

BILINEAR FORMS WITH KLOOSTERMAN SUMS

BILINEAR FORMS WITH KLOOSTERMAN SUMS BILINEAR FORMS WITH KLOOSTERMAN SUMS 1. Introduction For K an arithmetic function α = (α m ) 1, β = (β) 1 it is often useful to estimate bilinear forms of the shape B(K, α, β) = α m β n K(mn). m n complex

More information

Counting subgroups of the multiplicative group

Counting subgroups of the multiplicative group Counting subgroups of the multiplicative group Lee Troupe joint w/ Greg Martin University of British Columbia West Coast Number Theory 2017 Question from I. Shparlinski to G. Martin, circa 2009: How many

More information

Φ + θ = {φ + θ : φ Φ}

Φ + θ = {φ + θ : φ Φ} 74 3.7 Cyclic designs Let Θ Z t. For Φ Θ, a translate of Φ is a set of the form Φ + θ {φ + θ : φ Φ} for some θ in Θ. Of course, Φ is a translate of itself. It is possible to have Φ + θ 1 Φ + θ 2 even when

More information

Small gaps between primes

Small gaps between primes CRM, Université de Montréal Princeton/IAS Number Theory Seminar March 2014 Introduction Question What is lim inf n (p n+1 p n )? In particular, is it finite? Introduction Question What is lim inf n (p

More information

Homework 8 Solutions to Selected Problems

Homework 8 Solutions to Selected Problems Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x

More information

On approximation of real, complex, and p-adic numbers by algebraic numbers of bounded degree. by K. I. Tsishchanka

On approximation of real, complex, and p-adic numbers by algebraic numbers of bounded degree. by K. I. Tsishchanka On approximation of real, complex, and p-adic numbers by algebraic numbers of bounded degree by K. I. Tsishchanka I. On approximation by rational numbers Theorem 1 (Dirichlet, 1842). For any real irrational

More information

Polynomial analogues of Ramanujan congruences for Han s hooklength formula

Polynomial analogues of Ramanujan congruences for Han s hooklength formula Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition

More information

Results of modern sieve methods in prime number theory and more

Results of modern sieve methods in prime number theory and more Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications

More information

Mathematical Induction Again

Mathematical Induction Again Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Mathematical Induction Simple POMI Examples

More information

Mathematical Induction Again

Mathematical Induction Again Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 2, 207 Outline Mathematical Induction 2 Simple POMI Examples

More information

Almost Primes of the Form p c

Almost Primes of the Form p c Almost Primes of the Form p c University of Missouri zgbmf@mail.missouri.edu Pre-Conference Workshop of Elementary, Analytic, and Algorithmic Number Theory Conference in Honor of Carl Pomerance s 70th

More information

SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ω(q) AND ν(q) S.N. Fathima and Utpal Pore (Received October 13, 2017)

SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ω(q) AND ν(q) S.N. Fathima and Utpal Pore (Received October 13, 2017) NEW ZEALAND JOURNAL OF MATHEMATICS Volume 47 2017), 161-168 SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ωq) AND νq) S.N. Fathima and Utpal Pore Received October 1, 2017) Abstract.

More information

PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS

PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,

More information

Baltic Way 2008 Gdańsk, November 8, 2008

Baltic Way 2008 Gdańsk, November 8, 2008 Baltic Way 008 Gdańsk, November 8, 008 Problems and solutions Problem 1. Determine all polynomials p(x) with real coefficients such that p((x + 1) ) = (p(x) + 1) and p(0) = 0. Answer: p(x) = x. Solution:

More information

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

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

More information

MATH 361: NUMBER THEORY FOURTH LECTURE

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

More information

ON TESTING THE DIVISIBILITY OF LACUNARY POLYNOMIALS BY CYCLOTOMIC POLYNOMIALS

ON TESTING THE DIVISIBILITY OF LACUNARY POLYNOMIALS BY CYCLOTOMIC POLYNOMIALS ON TESTING THE DIVISIBILITY OF LACUNARY POLYNOMIALS BY CYCLOTOMIC POLYNOMIALS Michael Filaseta 1 and Andrzej Schinzel August 30, 2002 1 The first author gratefully acknowledges support from the National

More information

On rational numbers associated with arithmetic functions evaluated at factorials

On rational numbers associated with arithmetic functions evaluated at factorials On rational numbers associated with arithmetic functions evaluated at factorials Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive

More information

The Complexity of Computing the Sign of the Tutte Polynomial

The Complexity of Computing the Sign of the Tutte Polynomial The Complexity of Computing the Sign of the Tutte Polynomial Leslie Ann Goldberg (based on joint work with Mark Jerrum) Oxford Algorithms Workshop, October 2012 The Tutte polynomial of a graph G = (V,

More information

Explicit formulas and symmetric function theory

Explicit formulas and symmetric function theory and symmetric function theory Department of Mathematics University of Michigan Number Theory and Function Fields at the Crossroads University of Exeter January 206 Arithmetic functions on Z over short

More information

On the Frobenius Numbers of Symmetric Groups

On the Frobenius Numbers of Symmetric Groups Journal of Algebra 221, 551 561 1999 Article ID jabr.1999.7992, available online at http://www.idealibrary.com on On the Frobenius Numbers of Symmetric Groups Yugen Takegahara Muroran Institute of Technology,

More information

Roth s Theorem on 3-term Arithmetic Progressions

Roth s Theorem on 3-term Arithmetic Progressions Roth s Theorem on 3-term Arithmetic Progressions Mustazee Rahman 1 Introduction This article is a discussion about the proof of a classical theorem of Roth s regarding the existence of three term arithmetic

More information

Dirichlet Series Associated with Cubic and Quartic Fields

Dirichlet Series Associated with Cubic and Quartic Fields Dirichlet Series Associated with Cubic and Quartic Fields Henri Cohen, Frank Thorne Institut de Mathématiques de Bordeaux October 23, 2012, Bordeaux 1 Introduction I Number fields will always be considered

More information

INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3

INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3 INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3 SILVIU RADU AND JAMES A. SELLERS Abstract. In 2007, Andrews and Paule introduced the family of functions k n) which enumerate the number

More information

Modular forms, combinatorially and otherwise

Modular forms, combinatorially and otherwise Modular forms, combinatorially and otherwise p. 1/103 Modular forms, combinatorially and otherwise David Penniston Sums of squares Modular forms, combinatorially and otherwise p. 2/103 Modular forms, combinatorially

More information

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings

More information

SOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,

SOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2, SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.

More information

Are ζ-functions able to solve Diophantine equations?

Are ζ-functions able to solve Diophantine equations? Are ζ-functions able to solve Diophantine equations? An introduction to (non-commutative) Iwasawa theory Mathematical Institute University of Heidelberg CMS Winter 2007 Meeting Leibniz (1673) L-functions

More information

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite

More information

arxiv:math/ v1 [math.nt] 9 Feb 1998

arxiv:math/ v1 [math.nt] 9 Feb 1998 ECONOMICAL NUMBERS R.G.E. PINCH arxiv:math/9802046v1 [math.nt] 9 Feb 1998 Abstract. A number n is said to be economical if the prime power factorisation of n can be written with no more digits than n itself.

More information

Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn

Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Randomization Randomized Algorithm: An algorithm that uses (or can use) random coin flips in order to make decisions We will see: randomization

More information

Fast reversion of power series

Fast reversion of power series Fast reversion of power series Fredrik Johansson November 2011 Overview Fast power series arithmetic Fast composition and reversion (Brent and Kung, 1978) A new algorithm for reversion Implementation results

More information

On the missing values of n! mod p

On the missing values of n! mod p On the missing values of n! mod p Kevin A. Broughan and A. Ross Barnett University of Waikato, Hamilton, New Zealand Version: 15th Jan 2009 E-mail: kab@waikato.ac.nz, arbus@math.waikato.ac.nz We show that

More information

CDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018

CDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018 CDM Finite Fields Klaus Sutner Carnegie Mellon University Fall 2018 1 Ideals The Structure theorem Where Are We? 3 We know that every finite field carries two apparently separate structures: additive and

More information

Arithmetic Functions Evaluated at Factorials!

Arithmetic Functions Evaluated at Factorials! Arithmetic Functions Evaluated at Factorials! Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive integers n and m for which

More information

THE SUM OF DIGITS OF n AND n 2

THE SUM OF DIGITS OF n AND n 2 THE SUM OF DIGITS OF n AND n 2 KEVIN G. HARE, SHANTA LAISHRAM, AND THOMAS STOLL Abstract. Let s q (n) denote the sum of the digits in the q-ary expansion of an integer n. In 2005, Melfi examined the structure

More information

Wilson s Theorem and Fermat s Little Theorem

Wilson s Theorem and Fermat s Little Theorem Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =

More information

Sieve weight smoothings and moments

Sieve weight smoothings and moments Sieve weight smoothings and moments Andrew Granville, with Dimitris Koukoulopoulos & James Maynard Université de Montréal & UCL Workshop in Number Theory and Function Fields Exeter, Friday, January 21,

More information

Average Orders of Certain Arithmetical Functions

Average 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 information

Quadratic Forms and Congruences for l-regular Partitions Modulo 3, 5 and 7. Tianjin University, Tianjin , P. R. China

Quadratic Forms and Congruences for l-regular Partitions Modulo 3, 5 and 7. Tianjin University, Tianjin , P. R. China Quadratic Forms and Congruences for l-regular Partitions Modulo 3, 5 and 7 Qing-Hu Hou a, Lisa H. Sun b and Li Zhang b a Center for Applied Mathematics Tianjin University, Tianjin 30007, P. R. China b

More information

Sydney University Mathematical Society Problems Competition Solutions.

Sydney University Mathematical Society Problems Competition Solutions. Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed

More information

Modular Arithmetic Instructor: Marizza Bailey Name:

Modular Arithmetic Instructor: Marizza Bailey Name: Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find

More information

Moreover this binary operation satisfies the following properties

Moreover this binary operation satisfies the following properties Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................

More information

arxiv: v1 [math.cv] 14 Nov 2017

arxiv: v1 [math.cv] 14 Nov 2017 EXTENDING A FUNCTION JUST BY MULTIPLYING AND DIVIDING FUNCTION VALUES: SMOOTHNESS AND PRIME IDENTITIES arxiv:1711.07887v1 [math.cv] 14 Nov 2017 PATRICK ARTHUR MILLER ABSTRACT. We describe a purely-multiplicative

More information

Irreducible Polynomials and Factorization Properties of the Ring of Integer-Valued Polynomials

Irreducible Polynomials and Factorization Properties of the Ring of Integer-Valued Polynomials Trinity University Digital Commons @ Trinity Math Honors Theses Mathematics Department 4-18-2007 Irreducible Polynomials and Factorization Properties of the Ring of Integer-Valued Polynomials Megan Gallant

More information

Distribution of the Figures 0 and 1

Distribution of the Figures 0 and 1 Distribution of the Figures 0 and 1 in the Various Orders of Binary Representations of kth Powers of Integers By W. Gross and R. Vacca Leibniz' observation (in Mathematischen Schriften, edited by C. I.

More information

arithmetic properties of weighted catalan numbers

arithmetic properties of weighted catalan numbers arithmetic properties of weighted catalan numbers Jason Chen Mentor: Dmitry Kubrak May 20, 2017 MIT PRIMES Conference background: catalan numbers Definition The Catalan numbers are the sequence of integers

More information

SUMS PROBLEM COMPETITION, 2000

SUMS PROBLEM COMPETITION, 2000 SUMS ROBLEM COMETITION, 2000 SOLUTIONS 1 The result is well known, and called Morley s Theorem Many proofs are known See for example HSM Coxeter, Introduction to Geometry, page 23 2 If the number of vertices,

More information

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element. The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

More information

Representing numbers as the sum of squares and powers in the ring Z n

Representing numbers as the sum of squares and powers in the ring Z n Representing numbers as the sum of squares powers in the ring Z n Rob Burns arxiv:708.03930v2 [math.nt] 23 Sep 207 26th September 207 Abstract We examine the representation of numbers as the sum of two

More information

The distribution of prime geodesics for Γ \ H and analogues for free groups

The distribution of prime geodesics for Γ \ H and analogues for free groups Outline The distribution of prime geodesics for Γ \ H and analogues for free groups Yiannis Petridis 1 Morten S. Risager 2 1 The Graduate Center and Lehman College City University of New York 2 Aarhus

More information

Review of Power Series

Review of Power Series Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power

More information

Math 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums

Math 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums Math 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums Finally, we consider upper bounds on exponential sum involving a character,

More information

Quasi-reducible Polynomials

Quasi-reducible Polynomials Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let

More information

Random processes and probability distributions. Phys 420/580 Lecture 20

Random processes and probability distributions. Phys 420/580 Lecture 20 Random processes and probability distributions Phys 420/580 Lecture 20 Random processes Many physical processes are random in character: e.g., nuclear decay (Poisson distributed event count) P (k, τ) =

More information

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

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

More information

Coloured Kac-Moody algebras, Part I

Coloured Kac-Moody algebras, Part I Coloured Kac-Moody algebras, Part I Alexandre Bouayad Abstract We introduce a parametrization of formal deformations of Verma modules of sl 2. A point in the moduli space is called a colouring. We prove

More information

SUMS OF VALUES OF A RATIONAL FUNCTION. x k i

SUMS OF VALUES OF A RATIONAL FUNCTION. x k i SUMS OF VALUES OF A RATIONAL FUNCTION BJORN POONEN Abstract. Let K be a number field, and let f K(x) be a nonconstant rational function. We study the sets { n } f(x i ) : x i K {poles of f} and { n f(x

More information

k DIVISOR FUNCTION 177 THEOREM 2. Conjecture B is true. More precisely, let k be fixed, ak = k(21 /k - 1). Then for sufficiently large x, C,(k) x(log

k DIVISOR FUNCTION 177 THEOREM 2. Conjecture B is true. More precisely, let k be fixed, ak = k(21 /k - 1). Then for sufficiently large x, C,(k) x(log Values of the Divisor Function on Short Intervals P. ERDŐS Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary AND R. R. HALL Department of Mathematics, University of York, York

More information

Partition Congruences in the Spirit of Ramanujan

Partition Congruences in the Spirit of Ramanujan Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research

More information

On sum-free and solution-free sets of integers

On sum-free and solution-free sets of integers On sum-free and solution-free sets of integers Andrew Treglown Joint work with József Balogh, Hong Liu, Maryam Sharifzadeh, and Robert Hancock University of Birmingham 7th October 2016 Introduction Definition

More information

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups

More information

Relations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.

Relations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B. Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:

More information

On a certain vector crank modulo 7

On a certain vector crank modulo 7 On a certain vector crank modulo 7 Michael D Hirschhorn School of Mathematics and Statistics University of New South Wales Sydney, NSW, 2052, Australia mhirschhorn@unsweduau Pee Choon Toh Mathematics &

More information

Public-key Cryptography: Theory and Practice

Public-key Cryptography: Theory and Practice Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues

More information

Maximal Class Numbers of CM Number Fields

Maximal Class Numbers of CM Number Fields Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis

More information

Contents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition

Contents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition Contents Preface to the First Edition Preface to the Second Edition Preface to the Third Edition i iii iv Glossary of Symbols A. Prime Numbers 3 A1. Prime values of quadratic functions. 7 A2. Primes connected

More information

ROTH S THEOREM THE FOURIER ANALYTIC APPROACH NEIL LYALL

ROTH S THEOREM THE FOURIER ANALYTIC APPROACH NEIL LYALL ROTH S THEOREM THE FOURIER AALYTIC APPROACH EIL LYALL Roth s Theorem. Let δ > 0 and ep ep(cδ ) for some absolute constant C. Then any A {0,,..., } of size A = δ necessarily contains a (non-trivial) arithmetic

More information

1 The Fundamental Theorem of Arithmetic. A positive integer N has a unique prime power decomposition. Primality Testing. and. Integer Factorisation

1 The Fundamental Theorem of Arithmetic. A positive integer N has a unique prime power decomposition. Primality Testing. and. Integer Factorisation 1 The Fundamental Theorem of Arithmetic A positive integer N has a unique prime power decomposition 2 Primality Testing Integer Factorisation (Gauss 1801, but probably known to Euclid) The Computational

More information

GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT

GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL

More information

SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS

SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS 31 October, 2007 1 INTRODUCTION 2 ORTHOGONAL POLYNOMIALS Properties of Orthogonal Polynomials 3 GAUSS INTEGRATION Gauss- Radau Integration Gauss -Lobatto Integration

More information

Carmichael numbers and the sieve

Carmichael numbers and the sieve June 9, 2015 Dedicated to Carl Pomerance in honor of his 70th birthday Carmichael numbers Fermat s little theorem asserts that for any prime n one has a n a (mod n) (a Z) Carmichael numbers Fermat s little

More information

Integer Partitions With Even Parts Below Odd Parts and the Mock Theta Functions

Integer Partitions With Even Parts Below Odd Parts and the Mock Theta Functions Integer Partitions With Even Parts Below Odd Parts and the Mock Theta Functions by George E. Andrews Key Words: Partitions, mock theta functions, crank AMS Classification Numbers: P84, P83, P8, 33D5 Abstract

More information

Amicable numbers. CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014

Amicable numbers. CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Amicable numbers CRM Workshop on New approaches in probabilistic and multiplicative number theory December 8 12, 2014 Carl Pomerance, Dartmouth College (U. Georgia, emeritus) Recall that s(n) = σ(n) n,

More information

CLASS FIELD THEORY NOTES

CLASS FIELD THEORY NOTES CLASS FIELD THEORY NOTES YIWANG CHEN Abstract. This is the note for Class field theory taught by Professor Jeff Lagarias. Contents 1. Day 1 1 1.1. Class Field Theory 1 1.2. ABC conjecture 1 1.3. History

More information

CSE 1400 Applied Discrete Mathematics Definitions

CSE 1400 Applied Discrete Mathematics Definitions CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine

More information

Ramanujan s first letter to Hardy: 5 + = 1 + e 2π 1 + e 4π 1 +

Ramanujan s first letter to Hardy: 5 + = 1 + e 2π 1 + e 4π 1 + Ramanujan s first letter to Hardy: e 2π/ + + 1 = 1 + e 2π 2 2 1 + e 4π 1 + e π/ 1 e π = 2 2 1 + 1 + e 2π 1 + Hardy: [These formulas ] defeated me completely. I had never seen anything in the least like

More information

Predictive criteria for the representation of primes by binary quadratic forms

Predictive criteria for the representation of primes by binary quadratic forms ACTA ARITHMETICA LXX3 (1995) Predictive criteria for the representation of primes by binary quadratic forms by Joseph B Muskat (Ramat-Gan), Blair K Spearman (Kelowna, BC) and Kenneth S Williams (Ottawa,

More information

Harmonic sets and the harmonic prime number theorem

Harmonic sets and the harmonic prime number theorem Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes

More information

https://hal.inria.fr/hal /

https://hal.inria.fr/hal / https://hal.inria.fr/hal-00767404/ sk sk Encrypt sk (m ) = c Decrypt sk (c ) = m Encrypt sk (m ) = c Decrypt sk (c ) = m m, m c, c Encrypt Decrypt sk pk, sk Encrypt pk (m) = c Decrypt sk (c) = m pk sk

More information

* 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields. * 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

More information

(for k n and p 1,p 2,...,p k 1) I.1. x p1. x p2. i 1. i k. i 2 x p k. m p [X n ] I.2

(for k n and p 1,p 2,...,p k 1) I.1. x p1. x p2. i 1. i k. i 2 x p k. m p [X n ] I.2 October 2, 2002 1 Qsym over Sym is free by A. M. Garsia and N. Wallach Astract We study here the ring QS n of Quasi-Symmetric Functions in the variables x 1,x 2,...,x n. F. Bergeron and C. Reutenauer [4]

More information

q-binomial coefficient congruences

q-binomial coefficient congruences CARMA Analysis and Number Theory Seminar University of Newcastle August 23, 2011 Tulane University, New Orleans 1 / 35 Our first -analogs The natural number n has the -analog: [n] = n 1 1 = 1 + +... n

More information

Partial Sums of Powers of Prime Factors

Partial Sums of Powers of Prime Factors 1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec

More information

Definition. Example: In Z 13

Definition. Example: In Z 13 Difference Sets Definition Suppose that G = (G,+) is a finite group of order v with identity 0 written additively but not necessarily abelian. A (v,k,λ)-difference set in G is a subset D of G of size k

More information

1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.

1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents. Math120 - Precalculus. Final Review. Fall, 2011 Prepared by Dr. P. Babaali 1 Algebra 1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.

More information

4. Congruence Classes

4. Congruence Classes 4 Congruence Classes Definition (p21) The congruence class mod m of a Z is Example With m = 3 we have Theorem For a b Z Proof p22 = {b Z : b a mod m} [0] 3 = { 6 3 0 3 6 } [1] 3 = { 2 1 4 7 } [2] 3 = {

More information

Complex Numbers. Rich Schwartz. September 25, 2014

Complex Numbers. Rich Schwartz. September 25, 2014 Complex Numbers Rich Schwartz September 25, 2014 1 From Natural Numbers to Reals You can think of each successive number system as arising so as to fill some deficits associated with the previous one.

More information

Congruences for Coefficients of Power Series Expansions of Rational Functions. Bachelor Thesis

Congruences for Coefficients of Power Series Expansions of Rational Functions. Bachelor Thesis Congruences for Coefficients of Power Series Expansions of Rational Functions Bachelor Thesis Author Marc Houben 4094573 Supervisor prof. dr. Frits Beukers Acknowledgements First and foremost I would like

More information

Mathematics 136 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 19 and 21, 2016

Mathematics 136 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 19 and 21, 2016 Mathematics 36 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 9 and 2, 206 Every rational function (quotient of polynomials) can be written as a polynomial

More information

An Erdős-Ko-Rado problem on the strip

An Erdős-Ko-Rado problem on the strip An Erdős-Ko-Rado problem on the strip Steve Butler 1 1 Department of Mathematics University of California, San Diego www.math.ucsd.edu/~sbutler GSCC 2008 12 April 2008 Extremal set theory We will consider

More information

The complexity of factoring univariate polynomials over the rationals

The complexity of factoring univariate polynomials over the rationals The complexity of factoring univariate polynomials over the rationals Mark van Hoeij Florida State University ISSAC 2013 June 26, 2013 Papers [Zassenhaus 1969]. Usually fast, but can be exp-time. [LLL

More information

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the

More information

Examples. f (x) = 3x 2 + 2x + 4 f (x) = 2x 4 x 3 + 2x 2 5x 2 f (x) = 3x 6 5x 5 + 7x 3 x

Examples. f (x) = 3x 2 + 2x + 4 f (x) = 2x 4 x 3 + 2x 2 5x 2 f (x) = 3x 6 5x 5 + 7x 3 x Section 4 3A: Power Functions Limits A power function is a polynomial function with the x terms raised to powers that are positive integers. The terms are written in decreasing powers of x. Examples f

More information