Wheels on wheels: how mathematics draws symmetrical flowers stefana.r.vutova penyo.m.michev patrons: john.rosenthal david.brown.

Slides:



Advertisements
Similar presentations
Another example of interference that is often observed is interference from a thin film. Light incident on the surface of a thin film is reflected from.
Advertisements

Section 4.1: Primes, Factorization, and the Euclidean Algorithm Practice HW (not to hand in) From Barr Text p. 160 # 6, 7, 8, 11, 12, 13.
The Integers and Division. Outline Division: Factors, multiples Exercise 2.3 Primes: The Fundamental Theorem of Arithmetic. The Division Algorithm Greatest.
1 Section 2.4 The Integers and Division. 2 Number Theory Branch of mathematics that includes (among other things): –divisibility –greatest common divisor.
Table of Contents Finding the LCM of Expressions The LCD of the rational expressions is the same as the Least Common Multiple (LCM) of the two denominators.
Finding the LCM of Expressions The LCD of the rational expressions is the same as the Least Common Multiple (LCM) of the two denominators. When adding.
R OLLING W HEELS I NVESTIGATING C URVES WITH D YNAMIC S OFTWARE Effective Use of Dynamic Mathematical Software in the Classroom David A. Brown – Ithaca.
CSE115/ENGR160 Discrete Mathematics 03/15/11
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
7/5/20141FCI. Prof. Nabila M. Hassan Faculty of Computer and Information Fayoum University 2013/2014 7/5/20142FCI.
1 Integers and Division CS/APMA 202 Rosen section 2.4 Aaron Bloomfield.
Foundations of Physics
Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.
Peter Lam Discrete Math CS.  Sometimes Referred to Clock Arithmetic  Remainder is Used as Part of Value ◦ i.e Clocks  24 Hours in a Day However, Time.
BY MISS FARAH ADIBAH ADNAN IMK
Mathematics of Cryptography Part I: Modular Arithmetic, Congruence,
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 3 (Part 2): The Fundamentals: Algorithms, the.
9/2/2015Discrete Structures1 Let us get into… Number Theory.
MATH 2A CHAPTER EIGHT POWERPOINT PRESENTATION
Section 2.2: Affine Ciphers; More Modular Arithmetic Practice HW (not to hand in) From Barr Textbook p. 80 # 2a, 3e, 3f, 4, 5a, 7, 8 9, 10 (Use affinecipherbreaker.
Mathematics of Cryptography Part I: Modular Arithmetic
Module :MA3036NI Cryptography and Number Theory Lecture Week 7
Mathematics of Cryptography Modular Arithmetic, Congruence,
Equation A statement that two mathematical expressions are equal.
RSA and its Mathematics Behind
Chapter 1Chapter 2Chapter 3 Chapter 4 Chapter 6 Chapter 7Chapter 11 Chapter 13Chapter 12.
Mathematics Review Exponents Logarithms Series Modular arithmetic Proofs.
Chapter 1 Algebraic Reasoning Chapter 2 Integers and Rational Numbers Chapter 3 Applying Rational Numbers Chapter 4 Patterns and Functions Chapter 5 Proportional.
Numbers MST101. Number Types 1.Counting Numbers (natural numbers) 2.Whole Numbers 3.Fractions – represented by a pair of whole numbers a/b where b ≠ 0.
Copyright © Curt Hill Divisibility and Modular Arithmetic A Topic in Number Theory.
FCI. Faculty of Computers and Information Fayoum University 2014/ FCI.
CompSci 102 Discrete Math for Computer Science
Math Vocabulary Project By: J’amezz Martin. Integer A whole number; a number that is not a fraction.
16-6 Wave Speed on a Stretched String
Computational Number Theory - traditional number theory Prime Numbers Factors Counting Factors D- functions.
RSA and its Mathematics Behind July Topics  Modular Arithmetic  Greatest Common Divisor  Euler’s Identity  RSA algorithm  Security in RSA.
Section 2.2: Affine Ciphers; More Modular Arithmetic Shift ciphers use an additive key. To increase security, we can add a multiplicative parameter. –For.
Chapter 2 (Part 1): The Fundamentals: Algorithms, the Integers & Matrices The Integers and Division (Section 2.4)
Pipes and Standing Sound Waves HW #5 HW check tomorrow!
Tuesday’s lecture: Today’s lecture: One-way permutations (OWPs)
Prerequisites for Calculus
5.1.4 Interference, Standing Waves, and Resonance
Wave Interference Superposition Principle – when two or more waves encounter each other while traveling through a medium, the resultant wave is found by.
Introduction to Number Theory
Introduction to Elliptic Curves CSCI 5857: Encoding and Encryption.
Discrete Mathematics
Chapter 2: Reasoning & Proof 2.4 Reasoning in Algebra.
Introduction: Vectors and Integrals. Vectors Vectors are characterized by two parameters: length (magnitude) direction These vectors are the same Sum.
Cryptography Lecture 14 Arpita Patra © Arpita Patra.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 2 The Fundamentals: Algorithms,
The Fundamentals: Algorithms, Integers, and Matrices CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.
Ch04-Number Theory and Cryptography 1. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic.
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 3. Mathematics of Cryptography.
Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.
Music Music is a “ pleasant ” sound (longitudinal) wave. The pitch is the frequency of the wave. The loudness is the amplitude of the wave. Music is made.
Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,
CS 210 Discrete Mathematics The Integers and Division (Section 3.4)
Mathematics of Cryptography
Lecture 11 WAVE.
2nd Nine Weeks Vocabulary Review Coach Whitlock
MATH301- DISCRETE MATHEMATICS Copyright © Nahid Sultana Dr. Nahid Sultana Chapter 4: Number Theory and Cryptography.
Applied Discrete Mathematics Week 4: Number Theory
Discrete Math for CS CMPSC 360 LECTURE 12 Last time: Stable matching
Standing Waves Waves and Sound
Introduction to physics
Standing waves and wave behavior
WAVE PROPERTIES 1) Reflection- Wave is turned back due to a barrier. (Ex- echo) Law of reflection: When a wave is reflected at a boundary, the incident.
CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston
Applied Discrete Mathematics Week 10: Introduction to Counting
Presentation transcript:

wheels on wheels: how mathematics draws symmetrical flowers stefana.r.vutova penyo.m.michev patrons: john.rosenthal david.brown

introduction epicycles definition: a circle the center of which moves on the circumference of a larger circle parametric equation:

parameters relative ratio of the radii of the circles relative rate at which each one rotates relative direction in which they rotate phase differences between each rotation, that is the relative initial starting positions

changing the parameters changing the relative size of the radii of the circles: does not change symmetry

changing the parameters all rotating in the same direction (1,7,13) (1,7,-11) does not change symmetry changing the direction of one circle

adding a phase : changing the parameters does not change symmetry opening the curves by using phase changes is a way of seeing features that are otherwise hidden from view

changing the parameters relative rate of rotation (frequency) (5, 17, 31) (11, 25, 43) (irrational ratio) changes symmetry

modular arithmetic and symmetry definition: a system of arithmetic for integers where numbers “wrap around” after they reach a certain value – the modulus. two integers a and b are said to be congruent modulo m if their difference (a-b) is an integer multiple of m. This is expressed mathematically as: a ≡ b (mod m)

complex notation adopting complex notation is the key to unfolding symmetry in epicycle curves:

q prime to m symmetry behavior of the parametric equation when we increase time by the term represents an angle by which the function rotates

q prime to m symmetry what this means: if we divide the cartesian plane into m sectors, then the function will trace a certain pattern every q th sector, and if q is prime to m, then eventually all m sectors will be filled and the function will produce m-fold symmetry if we pick frequencies (3,11,-21) with congruence relation 3 mod(8) congruence

GCD symmetry (q not prime m) if we again look at the behavior of our parametric function as time is advanced by, we see that when q is not relatively prime to m things change: the term is no longer in reduced form, which means that the curve will trace its pattern in less than m sectors, or in other words the angle by which it advances is increased, in effect reducing the symmetry

GCD symmetry (q not prime m) if we have then a set of frequencies all congruent to 4 mod(24) we will not see 24-fold symmetry, but rather 24/GCD(4, 24) = 6-fold: frequencies (4,28,-52) with congruence relation 4 mod(24)

k-multiplication symmetry behavior of the function when all frequencies are multiplied by some integer k

k-multiplication symmetry both functions produce the same curves g(s) requires k-times less time to trace out the particular pattern introducing a new variable

k-multiplication symmetry original set: k-multiplied set: does not change the symmetry (1,15,-27) (2,30,-54)

restating conjectures 1. frequencies all congruent to q mod(m) where q is relatively prime to m produce m-fold symmetry 2. multiplying a set of frequencies does not change the symmetry 3. if q is not prime to m, then the symmetry displayed is m/GCD(q, m)-fold

conflict ? the contradiction: choose 2 mod(14) congruence statement 2 claims: statement 3 claims: same congruence, different symmetry (2,16,-26) (2,30,-54)

standing wave analogy what is a standing wave: A standing wave is a pattern of constructive and destructive interference amongst incident and reflected waves that travel through it. These standing wave patterns represent the lowest energy vibration modes of an object, that is they are favored because they result in highest amplitude output for least amount of energy. all harmonic frequencies are integer multiples of the fundamental

finding the greatest symmetry steps: 1. search for the largest possible m 2. search for GCD of a, b, c, q and m, divide by it 3. search for GCD of q and m, divide by it 4. applying steps 1-3 will produce the m which will determine the symmetry displayed by a given set of coefficients given a set: (2,30,-54) largest m = 28 GCD(a,b,c,q,m) = 2 (2,30,-54)  (1,15,-27) m=28  m/GCD=14 q=1, m=14 prime congruence

c onclusions so far: rigorous mathematical proof of GCD symmetry future work: finding a mathematical proof for the steps required to find the actual symmetry given a set of coefficients