bounding least common multiples with triangles
play

Bounding Least Common Multiples with Triangles ITP 2016: Proof Pearl - PowerPoint PPT Presentation

Sep 30, 2022 •172 likes •1.08k views

Bounding Least Common Multiples with Triangles ITP 2016: Proof Pearl Hing-Lun Chan and Michael Norrish College of Engineering and Computer Science Australian National University August 2016, Nancy, France. Hing-Lun Chan & Michael Norrish

  1. Bounding Least Common Multiples with Triangles ITP 2016: Proof Pearl Hing-Lun Chan and Michael Norrish College of Engineering and Computer Science Australian National University August 2016, Nancy, France. Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 1 / 21

  2. Motivation AKS mechanisation AKS mechanisation Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 2 / 21

  3. Motivation AKS mechanisation AKS mechanisation Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 2 / 21

  4. Motivation AKS mechanisation AKS mechanisation ◦ Replacing 2 m by 2 m / 2 makes the lower bound valid for all m > 0. ◦ This change won’t affect the conclusion: AKS algorithm is in class P . Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 2 / 21

  5. Motivation AKS mechanisation Nair’s Paper Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 3 / 21

  6. Motivation AKS mechanisation Nair’s Paper Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 3 / 21

  7. Motivation AKS mechanisation Nair’s Paper ◦ The cryptic “difference operator” means Leibniz’s Harmonic Triangle! Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 3 / 21

  8. LCM of Consecutive Numbers LCM of Consecutive Numbers LCM of a List list_lcm [1] list_lcm [1; 2] list_lcm [1; 2; 3] list_lcm [1; 2; 3; 4] list_lcm [1; 2; 3; 4; 5] list_lcm [1; 2; 3; 4; 5; 6] Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 4 / 21

  9. LCM of Consecutive Numbers LCM of Consecutive Numbers LCM of a List list_lcm [1] = 1 list_lcm [1; 2] = 2 list_lcm [1; 2; 3] = 6 list_lcm [1; 2; 3; 4] = 12 list_lcm [1; 2; 3; 4; 5] = 60 list_lcm [1; 2; 3; 4; 5; 6] = 60 Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 4 / 21

  10. LCM of Consecutive Numbers LCM of Consecutive Numbers LCM of a List ≥ 2 0 = 1 list_lcm [1] = 1 ≥ 2 1 = 2 list_lcm [1; 2] = 2 ≥ 2 2 = 4 list_lcm [1; 2; 3] = 6 ≥ 2 3 = 8 list_lcm [1; 2; 3; 4] = 12 ≥ 2 4 = 16 list_lcm [1; 2; 3; 4; 5] = 60 ≥ 2 5 = 32 list_lcm [1; 2; 3; 4; 5; 6] = 60 Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 4 / 21

  11. LCM of Consecutive Numbers LCM of Consecutive Numbers LCM of a List ≥ 2 0 = 1 list_lcm [1] = 1 ≥ 2 1 = 2 list_lcm [1; 2] = 2 ≥ 2 2 = 4 list_lcm [1; 2; 3] = 6 ≥ 2 3 = 8 list_lcm [1; 2; 3; 4] = 12 ≥ 2 4 = 16 list_lcm [1; 2; 3; 4; 5] = 60 ≥ 2 5 = 32 list_lcm [1; 2; 3; 4; 5; 6] = 60 Theorem Lower bound for the LCM of consecutive numbers. ⊢ 2 n ≤ list_lcm [ 1 .. n + 1 ] Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 4 / 21

  12. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Lower Bound Let ℓ = [ a ; b ; c ] . Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 5 / 21

  13. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Lower Bound Let ℓ = [ a ; b ; c ] . Since LCM is a common multiple of each element (in fact, the least), a ≤ list_lcm [ a ; b ; c ] b ≤ list_lcm [ a ; b ; c ] c ≤ list_lcm [ a ; b ; c ] Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 5 / 21

  14. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Lower Bound Let ℓ = [ a ; b ; c ] . Since LCM is a common multiple of each element (in fact, the least), a ≤ list_lcm [ a ; b ; c ] b ≤ list_lcm [ a ; b ; c ] c ≤ list_lcm [ a ; b ; c ] Hence a + b + c ≤ 3 × list_lcm [ a ; b ; c ] Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 5 / 21

  15. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Lower Bound Let ℓ = [ a ; b ; c ] . Since LCM is a common multiple of each element (in fact, the least), a ≤ list_lcm [ a ; b ; c ] b ≤ list_lcm [ a ; b ; c ] c ≤ list_lcm [ a ; b ; c ] Hence a + b + c ≤ 3 × list_lcm [ a ; b ; c ] Theorem For a list ℓ of positive numbers, SUM ℓ ≤ LENGTH ℓ × list_lcm ℓ . Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 5 / 21

  16. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Lower Bound – Applications Theorem For a list ℓ of positive numbers, SUM ℓ ≤ LENGTH ℓ × list_lcm ℓ . Naïve application: ( n + 1 )( n + 2 ) ≤ ( n + 1 ) × list_lcm [ 1 .. n + 1 ] 2 ( n + 2 ) ≤ list_lcm [ 1 .. n + 1 ] 2 Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 6 / 21

  17. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Lower Bound – Applications Theorem For a list ℓ of positive numbers, SUM ℓ ≤ LENGTH ℓ × list_lcm ℓ . Naïve application: ( n + 1 )( n + 2 ) ≤ ( n + 1 ) × list_lcm [ 1 .. n + 1 ] 2 ( n + 2 ) disappointing! ≤ list_lcm [ 1 .. n + 1 ] 2 Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 6 / 21

  18. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Lower Bound – Applications Theorem For a list ℓ of positive numbers, SUM ℓ ≤ LENGTH ℓ × list_lcm ℓ . Naïve application: ( n + 1 )( n + 2 ) ≤ ( n + 1 ) × list_lcm [ 1 .. n + 1 ] 2 ( n + 2 ) disappointing! ≤ list_lcm [ 1 .. n + 1 ] 2 Need a clever idea to obtain this lower bound: 2 n ≤ list_lcm [ 1 .. much better! n + 1 ] Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 6 / 21

  19. LCM of Consecutive Numbers LCM Lower Bound for a List LCM Bound Comparison list_lcm [ 1 .. n + 1 ] 10 3 2 n ( n + 2 ) / 2 10 2 10 1 10 0 0 2 4 6 8 n Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 7 / 21

  20. Triangles Pascal’s Triangle Yang Hui’s Triangle Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 8 / 21

  21. Triangles Pascal’s Triangle Pascal’s Triangle 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 9 / 21

  22. Triangles Pascal’s Triangle Pascal’s Triangle 1 1 1 1 1 1 1 1 2 1 1 1 1 3 3 1 1 1 1 4 6 4 1 1 1 1 5 10 10 5 1 1 1 1 6 15 20 15 6 1 1 Each boundary entry: always 1. Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 9 / 21

  23. Triangles Pascal’s Triangle Pascal’s Triangle 1 1 1 1 1 2 2 1 1 3 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 Each boundary entry: always 1. Each inside entry: sum of two immediate parents. Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 9 / 21

  24. Triangles Pascal’s Triangle Pascal’s Triangle 1 1 1 1 2 1 1 3 3 1 1 4 4 6 6 4 1 1 5 10 10 10 5 1 1 6 15 20 15 6 1 Each boundary entry: always 1. Each inside entry: sum of two immediate parents. Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 9 / 21

  25. Triangles Pascal’s Triangle Pascal’s Triangle 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 10 5 5 1 1 6 15 20 15 15 6 1 Each boundary entry: always 1. Each inside entry: sum of two immediate parents. Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 9 / 21

  26. Triangles Pascal’s Triangle Pascal’s Triangle 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 1 6 6 15 15 20 20 15 15 6 6 1 1 Each boundary entry: always 1. Each inside entry: sum of two immediate parents. Sum of the n -th row: n � n � = ( 1 + 1 ) n = 2 n � k k = 0 Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 9 / 21

  27. Triangles Leibniz’s Triangle Leibniz’s Harmonic Triangle 1 1 1 1 2 2 1 1 1 3 6 3 1 1 1 1 4 12 12 4 1 1 1 1 1 5 20 30 20 5 1 1 1 1 1 1 6 30 60 60 30 6 1 1 1 1 1 1 1 7 42 105 140 105 42 7 Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 10 / 21

  28. Triangles Leibniz’s Triangle Leibniz’s Harmonic Triangle 1 1 1 1 1 1 1 1 2 2 2 2 1 1 1 1 1 3 3 6 3 3 1 1 1 1 1 1 4 4 12 12 4 4 1 1 1 1 1 1 1 5 5 20 30 20 5 5 1 1 1 1 1 1 1 1 6 6 30 60 60 30 6 6 1 1 1 1 1 1 1 1 1 7 7 42 105 140 105 42 7 7 1 Each boundary entry: for the n -th row, n = 0 , 1 , · · · ( n + 1 ) Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 10 / 21

  29. Triangles Leibniz’s Triangle Leibniz’s Harmonic Triangle 1 1 1 1 1 2 2 2 1 1 1 1 1 3 3 6 6 3 1 1 1 1 4 12 12 4 1 1 1 1 1 5 20 30 20 5 1 1 1 1 1 1 6 30 60 60 30 6 1 1 1 1 1 1 1 7 42 105 140 105 42 7 1 Each boundary entry: for the n -th row, n = 0 , 1 , · · · ( n + 1 ) Each entry (inside or not): sum of two immediate children. Hing-Lun Chan & Michael Norrish (ANU) Bounding LCM with Triangles ITP 2016 10 / 21

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Least Common Multiples The first number you see in both lists is 36. The least common multiple

Least Common Multiples The first number you see in both lists is 36. The least common multiple

9/22/2020 12, 24, 36, 48, 60 18, 36, 54, 72, 90 Least Common Multiples The first number you see in both lists is 36. The least common multiple of 12 and 18 is 36. Example 2: Least Common Multiple (LCM) Find the LCM of 9 and 10 The

250 views • 3 slides
Geometry Triangles Triangles Return to Table of Contents www.njctl.org Slide 5 / 210 Slide 6

Geometry Triangles Triangles Return to Table of Contents www.njctl.org Slide 5 / 210 Slide 6

Slide 1 / 210 Slide 2 / 210 Table of Contents Click on the topic to go to that section Triangles Triangle Sum Theorem Exterior Angle Theorem Inequalities in Triangles Similar Triangles Questions from Released PARCC Test Slide

772 views • 35 slides
Rasterization May 1, 2006 Triangles Only We will discuss the rasterization of triangles

Rasterization May 1, 2006 Triangles Only We will discuss the rasterization of triangles

Rasterization May 1, 2006 Triangles Only We will discuss the rasterization of triangles only. Why? Polygon can be decomposed into triangles. A triangle is always convex. Results in algorithms that are more hardware

407 views • 9 slides
Problem Solving with Similar and Right Triangles Triangles Three basic approaches to real world

Problem Solving with Similar and Right Triangles Triangles Three basic approaches to real world

Slide 1 / 252 Slide 2 / 252 Geometry Similar Triangles & Trigonometry 2015-10-22 www.njctl.org Slide 3 / 252 Slide 4 / 252 Table of Contents Throughout this unit, the Standards for Mathematical Practice are used. click on the topic to

906 views • 42 slides
Slide 4 / 252 Throughout this unit, the Standards for Mathematical Practice are used. MP1:

Slide 4 / 252 Throughout this unit, the Standards for Mathematical Practice are used. MP1:

Slide 1 / 252 Slide 2 / 252 Geometry Similar Triangles & Trigonometry 2015-10-22 www.njctl.org Slide 3 / 252 Table of Contents click on the topic to go to that section Problem Solving with Similar Triangles Similar Triangles and

1.83k views • 131 slides
Hierarchical Bounding Volume October 11, 2005 () Hierarchical Bounding Volume October 11, 2005

Hierarchical Bounding Volume October 11, 2005 () Hierarchical Bounding Volume October 11, 2005

Hierarchical Bounding Volume October 11, 2005 () Hierarchical Bounding Volume October 11, 2005 1 / 15 Outline Introduction to hierarchical bounding volume (HBV) Tree generation Other optimization issues () Hierarchical Bounding Volume

350 views • 16 slides
Computer Graphics MTAT.03.015 Raimond Tunnel The Road So Far... Bounding Box With bounding

Computer Graphics MTAT.03.015 Raimond Tunnel The Road So Far... Bounding Box With bounding

Computer Graphics MTAT.03.015 Raimond Tunnel The Road So Far... Bounding Box With bounding boxes you can detect collisions between boxes. Our hangar just happens to be a box. The chopper is not a box, but the collision

718 views • 25 slides
On the Need for Provably Secure Distance Bounding Serge Vaudenay COLE POLYTECHNIQUE

On the Need for Provably Secure Distance Bounding Serge Vaudenay COLE POLYTECHNIQUE

On the Need for Provably Secure Distance Bounding Serge Vaudenay COLE POLYTECHNIQUE FDRALE DE LAUSANNE http://lasec.epfl.ch/ SV 2012 distance bounding CIoT 2012 1 / 39 Introduction to Distance-Bounding 1 Some Insecurity Case

600 views • 39 slides
CS 6958 LECTURE 7 TRIANGLES, BVH January 29, 2014 Triangles 2 Lets try to derive an

CS 6958 LECTURE 7 TRIANGLES, BVH January 29, 2014 Triangles 2 Lets try to derive an

CS 6958 LECTURE 7 TRIANGLES, BVH January 29, 2014 Triangles 2 Lets try to derive an intersection test Barycentric Coordinates 3 1 2 3 0 1 , 2 , 3 1 1 1 + 2 + 3 = 1 2

203 views • 16 slides
Learning From Data Lecture 6 Bounding The Growth Function Bounding the Growth Function Models

Learning From Data Lecture 6 Bounding The Growth Function Bounding the Growth Function Models

Learning From Data Lecture 6 Bounding The Growth Function Bounding the Growth Function Models are either Good or Bad The VC Bound - replacing |H| with m H ( N ) M. Magdon-Ismail CSCI 4100/6100 recap: The Growth Function m H ( N ) A new

316 views • 31 slides
Investigation 1 Problem 1.3 Playing the Product Game Finding Multiples of Numbers Playing the

Investigation 1 Problem 1.3 Playing the Product Game Finding Multiples of Numbers Playing the

Investigation 1 Problem 1.3 Playing the Product Game Finding Multiples of Numbers Playing the Product Game Problem 1.3 Finding Muliptles of Numbers I can find multiples and describe the relationship between factors and multiples. The

173 views • 13 slides
JUST THE MATHS SLIDES NUMBER 3.4 TRIGONOMETRY 4 (Solution of triangles) by A.J.Hobson

JUST THE MATHS SLIDES NUMBER 3.4 TRIGONOMETRY 4 (Solution of triangles) by A.J.Hobson

JUST THE MATHS SLIDES NUMBER 3.4 TRIGONOMETRY 4 (Solution of triangles) by A.J.Hobson 3.4.1 Introduction 3.4.2 Right-angled triangles 3.4.3 The sine and cosine rules UNIT 3.4 - TRIGONOMETRY 4 SOLUTION OF TRIANGLES 3.4.1

446 views • 9 slides
State of Technology Capital Markets October 1, 2015 LBO Purchase Price Multiples & Equity

State of Technology Capital Markets October 1, 2015 LBO Purchase Price Multiples & Equity

State of Technology Capital Markets October 1, 2015 LBO Purchase Price Multiples & Equity Contribution Large Corporate Purchase Price Multiples 2006 2007 2008 2009 2010 2011 2012 2013 2014 1H15 2Q15 0.0x 2.0x 4.0x 6.0x 6.6x

115 views • 9 slides
Filling multiples of embedded curves and quantifying nonorientability Robert Young New York

Filling multiples of embedded curves and quantifying nonorientability Robert Young New York

Filling multiples of embedded curves and quantifying nonorientability Robert Young New York University https://cims.nyu.edu/~ryoung/slides/TwoTslides.pdf October 2020 Filling multiples of embedded curves If T is an integral 1-cycle (i.e.,

1.14k views • 73 slides
DIVISIBILITY OF THE NATURAL NUMBERS Degree in Primary Education Teaching Multiples and divisors

DIVISIBILITY OF THE NATURAL NUMBERS Degree in Primary Education Teaching Multiples and divisors

Mathematics and Associated Teaching Methods I DIVISIBILITY OF THE NATURAL NUMBERS Degree in Primary Education Teaching Multiples and divisors Definition Equivalence between both concepts To find the multiples and divisors of a

843 views • 7 slides
Spatial Data Structures Hierarchical Bounding Volumes Hierarchical Bounding Volumes Grids Grids

Spatial Data Structures Hierarchical Bounding Volumes Hierarchical Bounding Volumes Grids Grids

Spatial Data Structures Hierarchical Bounding Volumes Hierarchical Bounding Volumes Grids Grids Octrees Octrees BSP Trees BSP Trees 11/7/02 Thursday, April 1, 2010 Speeding Up Computations Ray Tracing Spend a lot of time doing

882 views • 55 slides
IT-H IT-HELPS: F ELPS: Free Online Exchange Tools and A ree Online Exchange Tools and Activities

IT-H IT-HELPS: F ELPS: Free Online Exchange Tools and A ree Online Exchange Tools and Activities

IT-H IT-HELPS: F ELPS: Free Online Exchange Tools and A ree Online Exchange Tools and Activities ctivities ication for In for Intercultural C tercultural Commun ommunication By Nguyen Bui The Australian National University

372 views • 36 slides
Australian Research Collaboration Service (ARCS) & Grid Activities in Australia Prof Anthony

Australian Research Collaboration Service (ARCS) & Grid Activities in Australia Prof Anthony

Australian Research Collaboration Service (ARCS) & Grid Activities in Australia Prof Anthony Williams Executive Director Supported by: ARCS Mission The ARCS Mission is to enable and enhance research through the provision of long-term

642 views • 18 slides
Identity in Humanist Workflows Project Bamboo Infrastructure for collaboration, content access, and

Identity in Humanist Workflows Project Bamboo Infrastructure for collaboration, content access, and

Identity in Humanist Workflows Project Bamboo Infrastructure for collaboration, content access, and provenance tracking Keith Hazelton, Steve Masover http://www.projectbamboo.org Project Bamboo is supported by the Andrew W. Mellon Foundation

220 views • 17 slides
Stanislaw Lojasiewicz Lecture Optimal Transportation in the Twenty First Century Neil. S.

Stanislaw Lojasiewicz Lecture Optimal Transportation in the Twenty First Century Neil. S.

Stanislaw Lojasiewicz Lecture Optimal Transportation in the Twenty First Century Neil. S. Trudinger Centre for Mathematics and its Applications Australian National University 16 May, 2013 Neil. S. Trudinger ANU Optimal Transportation

739 views • 47 slides
Quam Bene Non Quantum Identifying Bias in a Commercial Quantum Random Number Generator Darren

Quam Bene Non Quantum Identifying Bias in a Commercial Quantum Random Number Generator Darren

The UKs European university Real World Crypto 2018 Quam Bene Non Quantum Identifying Bias in a Commercial Quantum Random Number Generator Darren Hurley-Smith & Julio Hernandez-Castro Index Introduction Related works Aims Experimental

563 views • 11 slides
The Maker Movement- Makerspaces and FabLabs Gabriela Avram Introduction to Digital Media 2017

The Maker Movement- Makerspaces and FabLabs Gabriela Avram Introduction to Digital Media 2017

The Maker Movement- Makerspaces and FabLabs Gabriela Avram Introduction to Digital Media 2017 The DIY/Make Culture p The Homebrew Computer Club 1975 p The Whole Earth Catalog 1968-1972 p MAKE Magazine 2005 p Maker Faire- the

818 views • 43 slides
Craig interpolation in displayable logics James Brotherston 1 and Rajeev Gor e 2 1 Imperial

Craig interpolation in displayable logics James Brotherston 1 and Rajeev Gor e 2 1 Imperial

Craig interpolation in displayable logics James Brotherston 1 and Rajeev Gor e 2 1 Imperial College London 2 ANU Canberra TABLEAUX, Universit at Bern, 7 Jul 2011 1/ 14 Craig interpolation Definition A (propositional) logic satisfies Craig

804 views • 52 slides
DYNES: DYnamic NEtwork System Artur Barczyk California Institute of Technology / US LHCNet

DYNES: DYnamic NEtwork System Artur Barczyk California Institute of Technology / US LHCNet

DYNES: DYnamic NEtwork System Artur Barczyk California Institute of Technology / US LHCNet TERENA e2e Workshop TERENA e2e Workshop Prague, November 29 th , 2010 1 2 Deployment Plan What is DYNES OUTLINE Status DYNES Overview What is

316 views • 16 slides

More recommend