This is my latest study in prime numbers behaviours, and the waves that describes why non prime numbers cannot be described in a single formula easily.
The document provides an introduction to the binomial theorem. It begins by discussing binomial coefficients through the Pascal's triangle. It then derives an explicit formula for binomial coefficients using factorials. Finally, it states the binomial theorem and provides examples of using it to expand algebraic expressions and estimate numerical values.
The document discusses expanding binomial expressions like (x + y)n using Pascal's triangle and the binomial theorem. It explains that each term in the expansion has exponents of x and y that add up to n, with the x exponent decreasing by 1 and the y exponent increasing by 1 in subsequent terms. The coefficients of the terms form Pascal's triangle. It also presents the binomial theorem formula for finding the coefficients and discusses using factorials. It provides an example of finding a specific term in a binomial expansion by identifying which value of k corresponds to that term number.
This document contains explanatory answers to 3 sample number theory questions:
1) The value of n will always be odd if the sum of n consecutive integers is 0.
2) Numbers of the form xy0xy (where x and y are digits) will always be divisible by 143 and 77.
3) The remainder when multiplying 3 numbers (where each is of the form 1xxxx) and dividing the product by 14 is 8.
1. The angles labeled (2a)° and (5a + 5)° are supplementary and add up to 180°. Solving for a gives a = 25. Similarly, the angles labeled (4b +10)° and (2b – 10)° are supplementary and add up to 180°. Solving for b gives b = 30. Therefore, a + b = 25 + 30 = 55.
2. Two parallel lines intersected by a transversal form eight angles. The acute angles are equal and the obtuse angles are equal. The acute angles are supplementary to the obtuse angles. Solving the equation relating the angles gives the answer.
3. The relationship between angles formed when
This document provides 10 problems involving quadratic functions and equations: (1) graphing quadratic equations; (2) solving quadratic equations by factoring; (3) identifying true statements about quadratic equations; (4) solving quadratic equations using the quadratic formula; (5) writing an equation to model profit from bracelet sales; (6) writing an equation for the sum of squares of two consecutive even numbers; (7) analyzing a graph of a quadratic function; (8) finding measurements of diagonals of a rhombus using its area; (9) determining the number of students in a classroom using time per student; (10) analyzing the height of a hot air balloon over time.
1. There are two characteristics that dictate an exponential behavior: the base x must be a decimal with an absolute value less than 1, and it must be a negative number.
2. The document provides examples and explanations for why certain exponential expressions with a negative decimal base will always be positive or negative.
3. It evaluates various inequalities involving exponential expressions with a negative decimal base to determine relationships between the expressions.
This is my latest study in prime numbers behaviours, and the waves that describes why non prime numbers cannot be described in a single formula easily.
The document provides an introduction to the binomial theorem. It begins by discussing binomial coefficients through the Pascal's triangle. It then derives an explicit formula for binomial coefficients using factorials. Finally, it states the binomial theorem and provides examples of using it to expand algebraic expressions and estimate numerical values.
The document discusses expanding binomial expressions like (x + y)n using Pascal's triangle and the binomial theorem. It explains that each term in the expansion has exponents of x and y that add up to n, with the x exponent decreasing by 1 and the y exponent increasing by 1 in subsequent terms. The coefficients of the terms form Pascal's triangle. It also presents the binomial theorem formula for finding the coefficients and discusses using factorials. It provides an example of finding a specific term in a binomial expansion by identifying which value of k corresponds to that term number.
This document contains explanatory answers to 3 sample number theory questions:
1) The value of n will always be odd if the sum of n consecutive integers is 0.
2) Numbers of the form xy0xy (where x and y are digits) will always be divisible by 143 and 77.
3) The remainder when multiplying 3 numbers (where each is of the form 1xxxx) and dividing the product by 14 is 8.
1. The angles labeled (2a)° and (5a + 5)° are supplementary and add up to 180°. Solving for a gives a = 25. Similarly, the angles labeled (4b +10)° and (2b – 10)° are supplementary and add up to 180°. Solving for b gives b = 30. Therefore, a + b = 25 + 30 = 55.
2. Two parallel lines intersected by a transversal form eight angles. The acute angles are equal and the obtuse angles are equal. The acute angles are supplementary to the obtuse angles. Solving the equation relating the angles gives the answer.
3. The relationship between angles formed when
This document provides 10 problems involving quadratic functions and equations: (1) graphing quadratic equations; (2) solving quadratic equations by factoring; (3) identifying true statements about quadratic equations; (4) solving quadratic equations using the quadratic formula; (5) writing an equation to model profit from bracelet sales; (6) writing an equation for the sum of squares of two consecutive even numbers; (7) analyzing a graph of a quadratic function; (8) finding measurements of diagonals of a rhombus using its area; (9) determining the number of students in a classroom using time per student; (10) analyzing the height of a hot air balloon over time.
1. There are two characteristics that dictate an exponential behavior: the base x must be a decimal with an absolute value less than 1, and it must be a negative number.
2. The document provides examples and explanations for why certain exponential expressions with a negative decimal base will always be positive or negative.
3. It evaluates various inequalities involving exponential expressions with a negative decimal base to determine relationships between the expressions.
This document discusses binomial expansion, which is a method for expanding binomials like (x + a)^n without lengthy multiplication. It introduces key concepts like Pascal's triangle for finding coefficients and the binomial theorem for determining the general pattern of terms in the expansion. Examples are worked through to demonstrate expanding specific binomials like (2x - 3y)^6 according to this method.
The binomial theorem provides a formula for expanding binomial expressions of the form (a + b)^n. It states that the terms of the expansion are determined by binomial coefficients. Pascal's triangle is a mathematical arrangement that shows the binomial coefficients and can be used to determine the coefficients in a binomial expansion. The proof of the binomial theorem uses mathematical induction to show that the formula holds true for any positive integer value of n.
- An arithmetic progression is a sequence of numbers where the difference between consecutive terms is constant. It can be represented by the first term (a), common difference (d), and last term (l).
- The general formula for the nth term (Tn) of an AP is: Tn = a + (n-1)d
- The sum (Sn) of the first n terms of an AP can be calculated as: Sn = (n/2)(a + l)
- Inserting arithmetic means between two numbers a and b results in an AP where the common difference (d) is (b-a)/(n+1) and the inserted terms are: a + d, a + 2
This document provides information about percentages, fractions, ratios, averages, and using a calculator. It includes steps for converting fractions to percentages and vice versa. It also covers finding percentages of amounts, increasing and decreasing percentages, and calculating percentage profit/loss. Other topics covered include factors, multiples, primes, prime factorization, indices, fractions, rounding, estimation, ratios, BODMAS order of operations, and Venn diagrams. The document provides examples and explanations for solving problems involving these various mathematical concepts.
MATHS SYMBOLS - OTHER OPERATIONS (1) - ABSOLUTE VALUE - ROUNDING to INTEGER - PLUS or MINUS - RECIPROCAL - RATIO - PROPORTIONS and FIRST PROPERTIES - BRACKETS - EQUALITY SIGN - APPROXIMATELY EQUAL - NOT EQUAL - LESS - MUCH LESS - LESS THAN or EQUAL TO - GREATER - MUCH GREATER THAN - GREATER THAN or EQUAL TO - PROPORTIONALITY - DEFINITION
The document discusses Catalan numbers, which have various interpretations in combinatorics. Specifically:
1) Catalan numbers count the number of ways to triangulate a polygon with n+2 sides. For example, there are 5 ways to triangulate a pentagon.
2) They also count the number of binary trees with n+1 leaves or the number of Dyck words of length 2n.
3) The formula for the nth Catalan number is (4n-2)/(n+1)n. This formula can be derived from Euler's formula for triangulating polygons.
This document defines sequences and series and provides examples of how to write terms of sequences and evaluate partial sums of series. It discusses writing sequences as functions with the natural numbers as the domain and the term values as the range. Examples are provided of finding the next term in a sequence and using Desmos to list terms. The document also defines convergent and divergent sequences, introduces summation notation for writing series, and provides properties and rules for manipulating summations including evaluating finite series.
- There will be no class on Monday for Martin Luther King Day.
- Quiz 1 will be held in class on Wednesday and will cover sections 1.1, 1.2, and 1.3.
- Students should know all definitions clearly for the quiz, which will focus on conceptual understanding rather than lengthy calculations.
The document discusses sequences and their properties. A sequence is a function whose domain is the positive integers. Sequences are commonly represented using subscript notation rather than standard function notation. The nth term of a sequence is denoted an. [/SUMMARY]
This document discusses Catalan numbers, which are a sequence of integers that appear in many counting problems. It provides:
1) An introduction and the formula for Catalan numbers in terms of binomial coefficients.
2) A definition of Catalan numbers using totally balanced sequences and an example of the first few Catalan families and numbers.
3) A proof of the formula for Catalan numbers using Euler's formula for triangulating polygons.
1) Sperner's Lemma states that any triangulation of a triangle that is labeled at the vertices with labels 1, 2, and 3 in clockwise order must contain at least one interior triangle labeled with all three labels.
2) The document provides two proofs of Sperner's Lemma: one using a "paths through rooms" analogy and another using edge labelings.
3) Brouwer's Fixed Point Theorem states that any continuous function from a triangle to itself must have a point that is fixed. The document proves this for n=2 dimensions using Sperner's Lemma and barycentric coordinates.
This document summarizes a senior project that ranks tennis players based on their television ratings using the Perron vector method. It begins with background on the Perron vector theorem and proofs of related theorems about eigenvalues and positive matrices. It then describes how Nielsen television ratings are calculated and outlines the project's plan to apply singular value decomposition to filter noise from the ratings data before ranking players with the Perron vector.
This document discusses solving linear homogeneous recurrence relations with constant coefficients. It begins by defining such a recurrence relation as one where the terms are expressed as a linear combination of previous terms. It then explains that these types of relations can be solved by finding the characteristic roots of the characteristic equation. The document provides an example of solving a degree two recurrence relation and outlines the basic approach of finding a solution of the form an = rn. It also discusses solving coupled recurrence relations by eliminating variables to obtain a single recurrence relation that can be solved. Finally, it revisits the Martian DNA problem and shows its solution is a Fibonacci number.
The document provides information on various math topics including:
1. Graph transformations including stretching and compressing graphs along the x and y axes.
2. Similarity and congruency of triangles.
3. Differentiation including differentiating polynomials and finding derivatives.
4. Integration including integrating polynomials and using integration to find areas.
5. Kinematics equations for velocity, acceleration, and displacement.
6. The binomial distribution and Pascal's triangle for expanding binomial expressions.
7. Using the discriminant of a quadratic equation to determine the nature of its roots.
The document contains the solutions to 5 problems from the 2017 Canadian Mathematical Olympiad. The first problem involves using an inequality to prove that the sum of fractions involving three non-negative real numbers is greater than 2. The second problem relates the number of divisors of a positive integer to a function and proves if the input is prime, the output is also prime. The third problem counts the number of balanced subsets of numbers and proves the count is odd.
This document discusses key concepts related to coordinate geometry including:
- The x and y axes that intersect at the origin to form quadrants in the coordinate plane.
- Using the coordinate system to locate and describe the position of points.
- Defining distance between points based on their coordinates along the x- or y- axes or on the coordinate plane.
- Introducing common conic sections like circles, parabolas, ellipses, and hyperbolas and providing their standard equations.
The document discusses different types of sequences including arithmetic, geometric, special integer sequences like triangular numbers, square numbers, Fibonacci numbers and cube numbers. It provides examples and definitions of each type. It also covers the principles of mathematical induction and how it is used to prove statements for all positive integers, involving two steps: basis step to verify the statement is true for n=1, and inductive step to show the statement is true for n+1 assuming it is true for n. An example is provided to demonstrate a proof using mathematical induction.
The document discusses the p-series test and provides an example of using it to test the convergence of a series.
1) The p-series test states that the series Σ1/np converges if p>1 and diverges if p≤1.
2) As an example, it tests the series Σ(n+1)/(n+2)2 by comparing it to the divergent p-series Σ1/n, showing their limits are equal so the original series must also diverge.
1) Primes are positive integers greater than 1 that are only divisible by 1 and themselves. The fundamental theorem of arithmetic states that every positive integer can be uniquely expressed as the product of primes.
2) Euclid's proof shows there are infinitely many primes. Euclid numbers form a sequence where each term is the sum of the previous terms plus 1, and the early terms are prime. However, not all Euclid numbers are prime.
3) The largest power of a prime p that divides n! is given by the sum of the number of times p divides the numbers from 1 to n in their prime factorizations. This can be determined from the number of 1s in the binary representation
The document defines key concepts related to sequences and series. It explains that a sequence is an ordered list of numbers with a specific pattern or rule. A sequence function is a function whose domain is the set of natural numbers. Terms are the individual numbers in a sequence. Finite sequences have a set number of terms while infinite sequences continue without end. Partial sums refer to adding a specific number of terms. Sigma notation compactly represents the sum of terms in a sequence. The document also introduces the principle of mathematical induction as a method to prove that statements are true for all natural numbers.
Here are the answers to the exercises:
1. The 2007th digit after the period in the decimal expansion of 1/7 is 7, since the expansion repeats with a period of 7 digits (142857...).
2. a) and b) have finite decimal expansions, while c) does not.
3. A = [-1, 2], B = (-∞, -1] ∪ (2, ∞). C = (-∞, 1) ∪ (2, ∞). D = (-∞, 1) ∪ (3, ∞). E = [-1, 2].
The finite sets are A and E.
3. Functions
3
This document discusses binomial expansion, which is a method for expanding binomials like (x + a)^n without lengthy multiplication. It introduces key concepts like Pascal's triangle for finding coefficients and the binomial theorem for determining the general pattern of terms in the expansion. Examples are worked through to demonstrate expanding specific binomials like (2x - 3y)^6 according to this method.
The binomial theorem provides a formula for expanding binomial expressions of the form (a + b)^n. It states that the terms of the expansion are determined by binomial coefficients. Pascal's triangle is a mathematical arrangement that shows the binomial coefficients and can be used to determine the coefficients in a binomial expansion. The proof of the binomial theorem uses mathematical induction to show that the formula holds true for any positive integer value of n.
- An arithmetic progression is a sequence of numbers where the difference between consecutive terms is constant. It can be represented by the first term (a), common difference (d), and last term (l).
- The general formula for the nth term (Tn) of an AP is: Tn = a + (n-1)d
- The sum (Sn) of the first n terms of an AP can be calculated as: Sn = (n/2)(a + l)
- Inserting arithmetic means between two numbers a and b results in an AP where the common difference (d) is (b-a)/(n+1) and the inserted terms are: a + d, a + 2
This document provides information about percentages, fractions, ratios, averages, and using a calculator. It includes steps for converting fractions to percentages and vice versa. It also covers finding percentages of amounts, increasing and decreasing percentages, and calculating percentage profit/loss. Other topics covered include factors, multiples, primes, prime factorization, indices, fractions, rounding, estimation, ratios, BODMAS order of operations, and Venn diagrams. The document provides examples and explanations for solving problems involving these various mathematical concepts.
MATHS SYMBOLS - OTHER OPERATIONS (1) - ABSOLUTE VALUE - ROUNDING to INTEGER - PLUS or MINUS - RECIPROCAL - RATIO - PROPORTIONS and FIRST PROPERTIES - BRACKETS - EQUALITY SIGN - APPROXIMATELY EQUAL - NOT EQUAL - LESS - MUCH LESS - LESS THAN or EQUAL TO - GREATER - MUCH GREATER THAN - GREATER THAN or EQUAL TO - PROPORTIONALITY - DEFINITION
The document discusses Catalan numbers, which have various interpretations in combinatorics. Specifically:
1) Catalan numbers count the number of ways to triangulate a polygon with n+2 sides. For example, there are 5 ways to triangulate a pentagon.
2) They also count the number of binary trees with n+1 leaves or the number of Dyck words of length 2n.
3) The formula for the nth Catalan number is (4n-2)/(n+1)n. This formula can be derived from Euler's formula for triangulating polygons.
This document defines sequences and series and provides examples of how to write terms of sequences and evaluate partial sums of series. It discusses writing sequences as functions with the natural numbers as the domain and the term values as the range. Examples are provided of finding the next term in a sequence and using Desmos to list terms. The document also defines convergent and divergent sequences, introduces summation notation for writing series, and provides properties and rules for manipulating summations including evaluating finite series.
- There will be no class on Monday for Martin Luther King Day.
- Quiz 1 will be held in class on Wednesday and will cover sections 1.1, 1.2, and 1.3.
- Students should know all definitions clearly for the quiz, which will focus on conceptual understanding rather than lengthy calculations.
The document discusses sequences and their properties. A sequence is a function whose domain is the positive integers. Sequences are commonly represented using subscript notation rather than standard function notation. The nth term of a sequence is denoted an. [/SUMMARY]
This document discusses Catalan numbers, which are a sequence of integers that appear in many counting problems. It provides:
1) An introduction and the formula for Catalan numbers in terms of binomial coefficients.
2) A definition of Catalan numbers using totally balanced sequences and an example of the first few Catalan families and numbers.
3) A proof of the formula for Catalan numbers using Euler's formula for triangulating polygons.
1) Sperner's Lemma states that any triangulation of a triangle that is labeled at the vertices with labels 1, 2, and 3 in clockwise order must contain at least one interior triangle labeled with all three labels.
2) The document provides two proofs of Sperner's Lemma: one using a "paths through rooms" analogy and another using edge labelings.
3) Brouwer's Fixed Point Theorem states that any continuous function from a triangle to itself must have a point that is fixed. The document proves this for n=2 dimensions using Sperner's Lemma and barycentric coordinates.
This document summarizes a senior project that ranks tennis players based on their television ratings using the Perron vector method. It begins with background on the Perron vector theorem and proofs of related theorems about eigenvalues and positive matrices. It then describes how Nielsen television ratings are calculated and outlines the project's plan to apply singular value decomposition to filter noise from the ratings data before ranking players with the Perron vector.
This document discusses solving linear homogeneous recurrence relations with constant coefficients. It begins by defining such a recurrence relation as one where the terms are expressed as a linear combination of previous terms. It then explains that these types of relations can be solved by finding the characteristic roots of the characteristic equation. The document provides an example of solving a degree two recurrence relation and outlines the basic approach of finding a solution of the form an = rn. It also discusses solving coupled recurrence relations by eliminating variables to obtain a single recurrence relation that can be solved. Finally, it revisits the Martian DNA problem and shows its solution is a Fibonacci number.
The document provides information on various math topics including:
1. Graph transformations including stretching and compressing graphs along the x and y axes.
2. Similarity and congruency of triangles.
3. Differentiation including differentiating polynomials and finding derivatives.
4. Integration including integrating polynomials and using integration to find areas.
5. Kinematics equations for velocity, acceleration, and displacement.
6. The binomial distribution and Pascal's triangle for expanding binomial expressions.
7. Using the discriminant of a quadratic equation to determine the nature of its roots.
The document contains the solutions to 5 problems from the 2017 Canadian Mathematical Olympiad. The first problem involves using an inequality to prove that the sum of fractions involving three non-negative real numbers is greater than 2. The second problem relates the number of divisors of a positive integer to a function and proves if the input is prime, the output is also prime. The third problem counts the number of balanced subsets of numbers and proves the count is odd.
This document discusses key concepts related to coordinate geometry including:
- The x and y axes that intersect at the origin to form quadrants in the coordinate plane.
- Using the coordinate system to locate and describe the position of points.
- Defining distance between points based on their coordinates along the x- or y- axes or on the coordinate plane.
- Introducing common conic sections like circles, parabolas, ellipses, and hyperbolas and providing their standard equations.
The document discusses different types of sequences including arithmetic, geometric, special integer sequences like triangular numbers, square numbers, Fibonacci numbers and cube numbers. It provides examples and definitions of each type. It also covers the principles of mathematical induction and how it is used to prove statements for all positive integers, involving two steps: basis step to verify the statement is true for n=1, and inductive step to show the statement is true for n+1 assuming it is true for n. An example is provided to demonstrate a proof using mathematical induction.
The document discusses the p-series test and provides an example of using it to test the convergence of a series.
1) The p-series test states that the series Σ1/np converges if p>1 and diverges if p≤1.
2) As an example, it tests the series Σ(n+1)/(n+2)2 by comparing it to the divergent p-series Σ1/n, showing their limits are equal so the original series must also diverge.
1) Primes are positive integers greater than 1 that are only divisible by 1 and themselves. The fundamental theorem of arithmetic states that every positive integer can be uniquely expressed as the product of primes.
2) Euclid's proof shows there are infinitely many primes. Euclid numbers form a sequence where each term is the sum of the previous terms plus 1, and the early terms are prime. However, not all Euclid numbers are prime.
3) The largest power of a prime p that divides n! is given by the sum of the number of times p divides the numbers from 1 to n in their prime factorizations. This can be determined from the number of 1s in the binary representation
The document defines key concepts related to sequences and series. It explains that a sequence is an ordered list of numbers with a specific pattern or rule. A sequence function is a function whose domain is the set of natural numbers. Terms are the individual numbers in a sequence. Finite sequences have a set number of terms while infinite sequences continue without end. Partial sums refer to adding a specific number of terms. Sigma notation compactly represents the sum of terms in a sequence. The document also introduces the principle of mathematical induction as a method to prove that statements are true for all natural numbers.
Here are the answers to the exercises:
1. The 2007th digit after the period in the decimal expansion of 1/7 is 7, since the expansion repeats with a period of 7 digits (142857...).
2. a) and b) have finite decimal expansions, while c) does not.
3. A = [-1, 2], B = (-∞, -1] ∪ (2, ∞). C = (-∞, 1) ∪ (2, ∞). D = (-∞, 1) ∪ (3, ∞). E = [-1, 2].
The finite sets are A and E.
3. Functions
3
This document introduces sequences and series, focusing on arithmetic and geometric progressions. It provides:
1) Definitions of sequences, series, and the differences between them. Arithmetic progressions have a common difference between terms, while geometric progressions multiply the previous term by a common ratio.
2) Formulas for calculating terms and sums of arithmetic and geometric progressions. The sum of an arithmetic progression can be expressed in terms of the first term, last term, number of terms, and common difference.
3) Examples of using the formulas to find specific terms and sums of progressions. Practice with these types of problems is important to master the techniques.
This document introduces arithmetic and geometric progressions. It defines a sequence as a set of numbers written in a particular order. A series is the sum of the terms in a sequence. An arithmetic progression is a sequence where each new term is obtained by adding a constant difference to the preceding term. The sum of an arithmetic progression can be found using the formula: the sum of the first n terms is equal to one-half n times the quantity of two times the first term plus (n - 1) times the common difference.
This document introduces numerical analysis and discusses floating point numbers. It covers topics such as absolute and relative errors, roundoff and truncation errors, Taylor series approximations, interpolation methods, solving nonlinear equations, numerical differentiation and integration, numerical solutions to differential equations, and linear algebra techniques. Example C programs are provided to illustrate various numerical methods.
This document provides an overview of sequences and summations in discrete mathematics. It defines a sequence as a function from a subset of natural numbers to a set, with each term of the sequence denoted as an. Examples of sequences include the terms of an arithmetic progression or geometric progression. Summations represent the sum of terms in a sequence, from an index m to n. Common summation formulas are presented, such as for arithmetic series and geometric series. The document also introduces double summations as the nested summation analog of double loops in programming.
this is a presentation on a a number theory topic concerning primes, it discusses three topics, the sieve of Eratosthenes, the euclids proof that primes is infinite, and solving for tau (n) primes.
This document contains lecture notes for a first semester calculus course. It begins by discussing different types of numbers like integers, rational numbers, and real numbers which are represented by possibly infinite decimal expansions. It then introduces functions and their properties like inverse functions and implicit functions. The notes provide examples and exercises to accompany the explanations.
Computer Representation of Numbers and.pptxTemesgen Geta
- Computers use binary to represent numbers, where each digit is either a 1 or 0. Real numbers are approximated using floating point representation with sign, mantissa, and exponent fields.
- Integers can be stored by reserving bits for the magnitude and using the first bit to indicate sign (sign-magnitude representation) or by using two's complement representation where the most significant bit indicates sign.
- When storing numbers in memory, multiple bytes are typically used to represent integers or floating point values to support a wider range of numbers.
Delaunay triangulation from 2-d delaunay to 3-d delaunaygreentask
The document discusses Delaunay triangulation in 2D and 3D. It covers several key topics:
1. Computing the circumcenter of a triangle and using it to find cavities when inserting a new point.
2. Improving the algorithm to find which edges can form new balls/triangles by recording edges as cavities are found.
3. The complexity of finding cavities and balls, and how finding balls can be optimized.
4. Extending the 2D Delaunay triangulation concepts like cavity detection to 3D meshes. This involves operations to recover missing geometry and merge the cavity mesh.
The document discusses sequences and summations. It provides examples and definitions of different types of sequences such as arithmetic and geometric sequences. It also discusses recurrence relations, which express a term in a sequence based on prior terms. Examples are provided to demonstrate finding terms of sequences given a recurrence relation. The document is a lecture on discrete mathematics concepts related to sequences.
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
The document discusses solving recurrence relations using iterative methods. It provides examples of using forward and backward iteration to predict solutions to recurrence relations given initial conditions. Recurrence relations can be used to model problems involving compound interest, population growth, algorithms like the Tower of Hanoi puzzle, and counting problems. Explicit formulas for the solutions can be derived and proven using induction.
Chemistry (Module 1) introduces several key concepts:
[1] It discusses units and dimensions, and defines the seven SI base units - meter, kilogram, second, kelvin, ampere, candela, and mole.
[2] It explains prefixes that are used to modify the SI units and increase or decrease their magnitude, such as milli, centi, kilo, mega.
[3] It describes derived units which are derived by combining the basic units through multiplication or division, such as m3 for volume, m2 for area, and J for energy.
[4] It discusses the classification of matter as elements, compounds, and mixtures based on their chemical
- The document summarizes Stirling's formula, which approximates n! asymptotically as n approaches infinity.
- It proves a weaker version showing nlogn is the right order of magnitude for log(n!).
- It then proves Stirling's formula precisely by using Euler's integral representation of n!, applying a change of variables to center the integrand at n, and showing the integrand converges to a Gaussian.
SEQUENCE AND SERIES
SEQUENCE
Is a set of numbers written in a definite order such that there is a rule by which the terms are obtained. Or
Is a set of number with a simple pattern.
Example
1. A set of even numbers
• 2, 4, 6, 8, 10 ……
2. A set of odd numbers
• 1, 3, 5, 7, 9, 11….
Knowing the pattern the next number from the previous can be obtained.
Example
1. Find the next term from the sequence
• 2, 7, 12, 17, 22, 27, 32
The next term is 37.
2. Given the sequence
• 2, 4, 6, 8, 10, 12………
Representation of Integer Positive Number as A Sum of Natural SummandsIJERA Editor
In this paper the problem of representation of integer positive number as a sum of natural terms is considered. The new approach to calculation of number of representations is offered. Results of calculations for numbers from 1 to 500 are given. Dependence of partial contributions to total sum of number of representations is investigated. Application of results is discussed.
Similar to Ulam Spiral Hidden Patterns & Waves (20)
Authoring a personal GPT for your research and practice: How we created the Q...Leonel Morgado
Thematic analysis in qualitative research is a time-consuming and systematic task, typically done using teams. Team members must ground their activities on common understandings of the major concepts underlying the thematic analysis, and define criteria for its development. However, conceptual misunderstandings, equivocations, and lack of adherence to criteria are challenges to the quality and speed of this process. Given the distributed and uncertain nature of this process, we wondered if the tasks in thematic analysis could be supported by readily available artificial intelligence chatbots. Our early efforts point to potential benefits: not just saving time in the coding process but better adherence to criteria and grounding, by increasing triangulation between humans and artificial intelligence. This tutorial will provide a description and demonstration of the process we followed, as two academic researchers, to develop a custom ChatGPT to assist with qualitative coding in the thematic data analysis process of immersive learning accounts in a survey of the academic literature: QUAL-E Immersive Learning Thematic Analysis Helper. In the hands-on time, participants will try out QUAL-E and develop their ideas for their own qualitative coding ChatGPT. Participants that have the paid ChatGPT Plus subscription can create a draft of their assistants. The organizers will provide course materials and slide deck that participants will be able to utilize to continue development of their custom GPT. The paid subscription to ChatGPT Plus is not required to participate in this workshop, just for trying out personal GPTs during it.
The binding of cosmological structures by massless topological defectsSérgio Sacani
Assuming spherical symmetry and weak field, it is shown that if one solves the Poisson equation or the Einstein field
equations sourced by a topological defect, i.e. a singularity of a very specific form, the result is a localized gravitational
field capable of driving flat rotation (i.e. Keplerian circular orbits at a constant speed for all radii) of test masses on a thin
spherical shell without any underlying mass. Moreover, a large-scale structure which exploits this solution by assembling
concentrically a number of such topological defects can establish a flat stellar or galactic rotation curve, and can also deflect
light in the same manner as an equipotential (isothermal) sphere. Thus, the need for dark matter or modified gravity theory is
mitigated, at least in part.
Remote Sensing and Computational, Evolutionary, Supercomputing, and Intellige...University of Maribor
Slides from talk:
Aleš Zamuda: Remote Sensing and Computational, Evolutionary, Supercomputing, and Intelligent Systems.
11th International Conference on Electrical, Electronics and Computer Engineering (IcETRAN), Niš, 3-6 June 2024
Inter-Society Networking Panel GRSS/MTT-S/CIS Panel Session: Promoting Connection and Cooperation
https://www.etran.rs/2024/en/home-english/
Current Ms word generated power point presentation covers major details about the micronuclei test. It's significance and assays to conduct it. It is used to detect the micronuclei formation inside the cells of nearly every multicellular organism. It's formation takes place during chromosomal sepration at metaphase.
ESPP presentation to EU Waste Water Network, 4th June 2024 “EU policies driving nutrient removal and recycling
and the revised UWWTD (Urban Waste Water Treatment Directive)”
Unlocking the mysteries of reproduction: Exploring fecundity and gonadosomati...AbdullaAlAsif1
The pygmy halfbeak Dermogenys colletei, is known for its viviparous nature, this presents an intriguing case of relatively low fecundity, raising questions about potential compensatory reproductive strategies employed by this species. Our study delves into the examination of fecundity and the Gonadosomatic Index (GSI) in the Pygmy Halfbeak, D. colletei (Meisner, 2001), an intriguing viviparous fish indigenous to Sarawak, Borneo. We hypothesize that the Pygmy halfbeak, D. colletei, may exhibit unique reproductive adaptations to offset its low fecundity, thus enhancing its survival and fitness. To address this, we conducted a comprehensive study utilizing 28 mature female specimens of D. colletei, carefully measuring fecundity and GSI to shed light on the reproductive adaptations of this species. Our findings reveal that D. colletei indeed exhibits low fecundity, with a mean of 16.76 ± 2.01, and a mean GSI of 12.83 ± 1.27, providing crucial insights into the reproductive mechanisms at play in this species. These results underscore the existence of unique reproductive strategies in D. colletei, enabling its adaptation and persistence in Borneo's diverse aquatic ecosystems, and call for further ecological research to elucidate these mechanisms. This study lends to a better understanding of viviparous fish in Borneo and contributes to the broader field of aquatic ecology, enhancing our knowledge of species adaptations to unique ecological challenges.
EWOCS-I: The catalog of X-ray sources in Westerlund 1 from the Extended Weste...Sérgio Sacani
Context. With a mass exceeding several 104 M⊙ and a rich and dense population of massive stars, supermassive young star clusters
represent the most massive star-forming environment that is dominated by the feedback from massive stars and gravitational interactions
among stars.
Aims. In this paper we present the Extended Westerlund 1 and 2 Open Clusters Survey (EWOCS) project, which aims to investigate
the influence of the starburst environment on the formation of stars and planets, and on the evolution of both low and high mass stars.
The primary targets of this project are Westerlund 1 and 2, the closest supermassive star clusters to the Sun.
Methods. The project is based primarily on recent observations conducted with the Chandra and JWST observatories. Specifically,
the Chandra survey of Westerlund 1 consists of 36 new ACIS-I observations, nearly co-pointed, for a total exposure time of 1 Msec.
Additionally, we included 8 archival Chandra/ACIS-S observations. This paper presents the resulting catalog of X-ray sources within
and around Westerlund 1. Sources were detected by combining various existing methods, and photon extraction and source validation
were carried out using the ACIS-Extract software.
Results. The EWOCS X-ray catalog comprises 5963 validated sources out of the 9420 initially provided to ACIS-Extract, reaching a
photon flux threshold of approximately 2 × 10−8 photons cm−2
s
−1
. The X-ray sources exhibit a highly concentrated spatial distribution,
with 1075 sources located within the central 1 arcmin. We have successfully detected X-ray emissions from 126 out of the 166 known
massive stars of the cluster, and we have collected over 71 000 photons from the magnetar CXO J164710.20-455217.
Immersive Learning That Works: Research Grounding and Paths ForwardLeonel Morgado
We will metaverse into the essence of immersive learning, into its three dimensions and conceptual models. This approach encompasses elements from teaching methodologies to social involvement, through organizational concerns and technologies. Challenging the perception of learning as knowledge transfer, we introduce a 'Uses, Practices & Strategies' model operationalized by the 'Immersive Learning Brain' and ‘Immersion Cube’ frameworks. This approach offers a comprehensive guide through the intricacies of immersive educational experiences and spotlighting research frontiers, along the immersion dimensions of system, narrative, and agency. Our discourse extends to stakeholders beyond the academic sphere, addressing the interests of technologists, instructional designers, and policymakers. We span various contexts, from formal education to organizational transformation to the new horizon of an AI-pervasive society. This keynote aims to unite the iLRN community in a collaborative journey towards a future where immersive learning research and practice coalesce, paving the way for innovative educational research and practice landscapes.
When I was asked to give a companion lecture in support of ‘The Philosophy of Science’ (https://shorturl.at/4pUXz) I decided not to walk through the detail of the many methodologies in order of use. Instead, I chose to employ a long standing, and ongoing, scientific development as an exemplar. And so, I chose the ever evolving story of Thermodynamics as a scientific investigation at its best.
Conducted over a period of >200 years, Thermodynamics R&D, and application, benefitted from the highest levels of professionalism, collaboration, and technical thoroughness. New layers of application, methodology, and practice were made possible by the progressive advance of technology. In turn, this has seen measurement and modelling accuracy continually improved at a micro and macro level.
Perhaps most importantly, Thermodynamics rapidly became a primary tool in the advance of applied science/engineering/technology, spanning micro-tech, to aerospace and cosmology. I can think of no better a story to illustrate the breadth of scientific methodologies and applications at their best.
The debris of the ‘last major merger’ is dynamically youngSérgio Sacani
The Milky Way’s (MW) inner stellar halo contains an [Fe/H]-rich component with highly eccentric orbits, often referred to as the
‘last major merger.’ Hypotheses for the origin of this component include Gaia-Sausage/Enceladus (GSE), where the progenitor
collided with the MW proto-disc 8–11 Gyr ago, and the Virgo Radial Merger (VRM), where the progenitor collided with the
MW disc within the last 3 Gyr. These two scenarios make different predictions about observable structure in local phase space,
because the morphology of debris depends on how long it has had to phase mix. The recently identified phase-space folds in Gaia
DR3 have positive caustic velocities, making them fundamentally different than the phase-mixed chevrons found in simulations
at late times. Roughly 20 per cent of the stars in the prograde local stellar halo are associated with the observed caustics. Based
on a simple phase-mixing model, the observed number of caustics are consistent with a merger that occurred 1–2 Gyr ago.
We also compare the observed phase-space distribution to FIRE-2 Latte simulations of GSE-like mergers, using a quantitative
measurement of phase mixing (2D causticality). The observed local phase-space distribution best matches the simulated data
1–2 Gyr after collision, and certainly not later than 3 Gyr. This is further evidence that the progenitor of the ‘last major merger’
did not collide with the MW proto-disc at early times, as is thought for the GSE, but instead collided with the MW disc within
the last few Gyr, consistent with the body of work surrounding the VRM.
2. Ulam Spiral Hidden Patterns
Page 1 of 15
Contents
Abstract: .......................................................................................................................................... 2
Numbers & Divisors Dependency................................................................................................ 3
An OEN number can have 4 states:......................................................................................... 4
An SVEN number can have 3states: ........................................................................................ 6
An NEIN number can have 4 states:........................................................................................ 6
Divisors Waves............................................................................................................................. 7
List of All Waves: ..................................................................................................................... 9
A Hint on Waves Formula...................................................................................................... 10
Ulman Spiral Pattern Explained................................................................................................. 11
Conclusion ..................................................................................................................................... 14
References..................................................................................................................................... 15
3. Ulam Spiral Hidden Patterns
Page 2 of 15
Abstract:
The Ulam spiral visualization method of prime numbers reveals some patterns and relations that
can be spotted by eye, whoever no formula can link between all prime numbers locations in this
diagram.
In Figure 1, black dots are prime numbers while white area is non-prime dots that are clustered
together. We can see in above diagram some discontinued diagonal lines formed by black dots
i.e. prime numbers.
In this study, focus will be made on white area rather than back dots. As this article suggests, the
tendency of forming diagonal lines of prime numbers are only the negative image of hidden
patterns exist in the white area.
Figure 1: Ulam Spiral Diagram
4. Ulam Spiral Hidden Patterns
Page 3 of 15
Numbers & Divisors Dependency
As per definition a prime number is a natural number greater than 1 that has no positive
divisors other than 1 and itself.
We will classify all numbers either prime or non-prime by its last digit to:
a. OEN: For numbers ended by 1 – will be called Ones-Ended Numbers
This set of numbers can be described as:
(10N +1) where N ε {1,2,3,….}
N represents the index –or order- of the number. For example index =0 is 1 and index =
1 is 11 and index = 2 is 21.
b. TREN: For numbers ended by 3 – will be called Three-Ended Numbers
This set of numbers can be described as:
(3N +1) where N ε {1,2,3,….}
N represents the index –or order- of the number. For example index =0 is 3 and index =
1 is 13 and index = 2 is 23.
c. SVEN: For numbers ended by 7 – will be called Seven-Ended Numbers
This set of numbers can be described as:
(10N +7) where N ε {1,2,3,….}
N represents the index –or order- of the number. For example index =0 is 7 and index =
1 is 17 and index = 2 is 27.
d. NIEN: For numbers ended by 9 – will be called Nine-Ended Numbers
This set of numbers can be described as:
(10N +9) where N ε {1,2,3,….}
Figure 2: Classifying numbers by last digit
5. Ulam Spiral Hidden Patterns
Page 4 of 15
N represents the index –or order- of the number. For example index =0 is 9 and index =
1 is 19 and index = 2 is 29.
We will just ignore even numbers and numbers ended by five as they all non-prime except 2 & 5,
as all even numbers have 2 as a positive divisor and all five-ended numbers have 5 as a positive
divisor.
An OEN number can have 4 states:
a. To have a positive two divisors, both are OEN such as 121, 341 …etc.
b. To have a positive two divisors, one is TREN & the second should be SVEN such as
21, 51, 91 …etc.
c. To have a positive two divisors, both are NIEN such as 81, 171 …etc.
d. If not one of the above then the number is a prime number that is ended by 1. Such
as 1,11,31,41.
OEN of the first state can be describes as:
(10N + 1) * (10M + 1) = (10L + 1) where N,M,L ε {1,2,3,….} eq.1
again N, M & L are indices of numbers all ended by 1 i.e. OEN.
OEN of the second state can be describes as:
(10N + 3) * (10M + 7) = (10L + 1) where N,M,L ε {1,2,3,….} eq.2
N is an index of a TREN number , M is an index of a SVEN number while L is an index of
OEN number.
OEN of the third state can be describes as:
(10N + 9) * (10M +9) = (10L + 1) where N,M,L ε {1,2,3,….} eq.3
N, M are indices of NIEN numbers while L is an index of OEN number.
Now the forth state which is prime numbers that are ended by 1. Cannot be described using a
formula. They are the numbers that remains in OEN set after taking out the three other states.
6. Ulam Spiral Hidden Patterns
Page 5 of 15
Same technique can be applied on TRED, SVEN & NEIN numbers.
Figure 3: Bright dots are NON-PRIME OEN numbers
7. Ulam Spiral Hidden Patterns
Page 6 of 15
An TRED number can have 3 states:
a. To have a positive two divisors, one is TREN & the second should be OEN such as 33,
143 …etc.
(10N + 1) * (10M + 3) = (10L + 3) where N,M,L ε {1,2,3,….} eq.4
b. To have a positive two divisors, one is SVEN & the second should be NEIN such as
63, 133, 153 …etc.
(10N + 7) * (10M + 9) = (10L + 3) where N,M,L ε {1,2,3,….} eq.5
c. If not one of the above then the number is a prime number that is ended by 3. Such
as 3, 13, 23, 43 …etc.
An SVEN number can have 3states:
a. To have a positive two divisors, one is SVEN & the second should be OEN such as 77,
187, 217 …etc.
(10N + 7) * (10M + 1) = (10L + 7) where N,M,L ε {1,2,3,….} eq.6
b. To have a positive two divisors, one is TREN & the second should be NEIN such as
27, 57, 117 …etc.
(10N + 3) * (10M + 9) = (10L + 7) where N,M,L ε {1,2,3,….} eq.7
c. If not one of the above then the number is a prime number that is ended by 7. Such
as 7, 17, 37 …etc.
An NEIN number can have 4 states:
a. To have a positive two divisors, both are TREN such as 9, 39, 169 …etc.
(10N + 3) * (10M + 3) = (10L + 9) where N,M,L ε {1,2,3,….} eq.8
b. To have a positive two divisors, one is OEN & the second should be NIEN such as
209, 319, 589 …etc.
(10N + 1) * (10M + 9) = (10L + 9) where N,M,L ε {1,2,3,….} eq.9
c. To have a positive two divisors, both are SVEN such as 49, 119, 629 …etc.
(10N + 7) * (10M + 7) = (10L + 9) where N,M,L ε {1,2,3,….} eq.10
d. If not one of the above then the number is a prime number that is ended by 9. Such
as 19, 29, 59, 79 …etc.
8. Ulam Spiral Hidden Patterns
Page 7 of 15
Divisors Waves
There are two reasons behind why prime numbers are not distributed uniformly:
1- Prime numbers ended with 1 and 3 and 7 & 9 are all handled together as if they were
related, while there are not. i.e. there is no relation between 13 & 19.
2- Taking numbers ends with 1 OEN:
a. Non prime numbers as defined above “Stated of OEN Numbers” are controlled
by three equations eq. 1, & eq.2 & eq.3 and these equations are not dependent
on each others.
If we study these multiples and there intersections with numbers ends with 1 axis, we will find it
as waves each wave has a wave length and a phase.
Let us start by numbers ended by 1.
The pattern is described as a start –phase- and a length –wave length-. The start is given as
number index i.e. for number (10L +1) L is the number index.
The patterns are
a. (1,11) , (2,21), (3,31) …… ( n , (10n + 1)) pattern 1
b. (2,3) , (9,13), (16,33) ……. ( 7n + 2 , (10n + 3)) pattern 2
c. (8,9), (17,19), (26,29) …… ( 9n + 8 , (10n + 9)) pattern 3
9. Ulam Spiral Hidden Patterns
Page 8 of 15
What we see here is read as follows: There is a wave start at index 1 which is number “11” and
replicated every 11’th index which means at index 1 + 11 = index 12 = number 121, and index 1
+ 11 + 11 = index 23 = number 231 ….etc. this is only generated from (1,11).
Same technique for (2,21) the first number is index 2 = number 21 and the second is index 23 =
231 and the third number is index 44 = number 441 and they are all can be divided by 21 the
original wave phase “the index 2”.
It is logic to say that these
Only in pattern 1 the start point in the pattern is a Prime Number, unless it exists in pattern 2 or
pattern 3. For example 21 is prime for pattern 1 but could be reached by pattern 2 in (2,3)
where 2 is the index number of 21.
In another way, any prime number is a start of a wave with a length of is value, for example 11
starts a wave from prime_index 1 with wave length = 11. In case of number 21 it is the same,
but it is hit by a wave comes from 3.
10. Ulam Spiral Hidden Patterns
Page 9 of 15
Another interesting thing that is logic to expect is the symmetric in above table for values 1 x 1
& 9 x 9 where for numbers ended by 3 & 7 it is not symmetric.
List of All Waves:
OEN Waves:
Start Point Wave Length or Step Examples
N 10 * N + 1 (121,231,…) OEN x OEN
7 * N + 2 10 * N + 3 (21,51,…) TRED x SVEN
9 * N + 8 10 * N + 9 (81,171,361,…) NIEN x NIEN
N is index of a OEN number
TREN Waves:
Start Point Wave Length or Step Examples
N 10 * N + 3 (33,143,…) TRED x OEN
9 * N + 6 10 * N + 7 (63,133,153, …) SVEN x NIEN
N is index of a TRED number
SVEN Waves:
Start Point Wave Length or Step Examples
N 10 * N + 7 (77, 187, …) SVEN x OEN
9 * N + 2 10 * N + 3 (27, 57,…) TRED x NIEN
N is index of a SVEN number
NIEN Waves:
Start Point Wave Length or Step Examples
N 10 * N + 9 (99,189, 209,…) NEIN x OEN
3 * N 10 * N + 3 (39,169, …) TREN x TREN
7 * N + 4 10 * N + 7 (119,287, …) SVEN x SVEN
N is index of a NIEN number
11. Ulam Spiral Hidden Patterns
Page 10 of 15
A Hint on Waves Formula
Take wave result in multiplying SVEN number by TRED number to generate OEN non prime.
Wave is (7 * N + 2 , 10 * N + 3).
When substituting in this wave :
Use N =0
7 * N + 2 = 2 This is the first index which equals to number (10 * N + 1) = 21.
Then increment with step (10 * N + 3) => 2 , 2 + 3, 2 + 3 + 3 …etc. => 21, 51, 81 …..etc.
Then increment N by one to go to the second wave.
7 * N + 2 = 9 which is equal to number 91
Then increment with step (10 * N + 3) => 9 , 9 + 13, 9 + 13 + 13 …etc. => 21, 221, 351 …..etc.
NOTE: for OEN x OEN we skip the very first result as it could be prime, unless it is intersected
with a wave comes from TRED or SVEN.
Same done with TRED , SVEN & NIEN numbers.
These waves enable the generation of non-prime number in one step by substituting in N of the
desired formla. We will use these wave formulas to generate Ulma Spiral Diagram directly
without the need to use classical approach of using isPrime function.
12. Ulam Spiral Hidden Patterns
Page 11 of 15
Ulman Spiral Pattern Explained
As we can see in figure 5, even
numbers in Ulman spiral define a
well-formed pattern.
Again in figure 6 we can see a well-
formed pattern of numbers that are
multiples of 5. This by the way
including numbers ended by 0 which
are even numbers as well, so parts
of these patterns are overlapped.
Actually even if we remove 10’s
from figure 6, we will still get a
pattern, it is only a matter of
changing part of the patter into
black.
If we combine even numbers and
numbers ended by 5 in one
diagram as in figure 6 we can see
diagonal lines appear.
Now coming to less well-formed
patterns, they are patterns that can
be spotted in OEN, TRED, SVEN &
NEIN. There reason behind this is
that these set of numbers which
contains prime numbers in between,
and due to waves equations
mentioned above, waves
intersections that comes from other
sets helps to reduce the
homogeneity and continuity of the
pattern.
Figure 5: Red are even numbers.
Figure 4: Highlighted dots are numbers ended by 5 or 0. i.e. has 5 as a
positive divisor
13. Ulam Spiral Hidden Patterns
Page 12 of 15
In figure 13,14,15,16 we started
added OEN, NIEN, TREN & SVEN in
order to data in figure 6.
Figure 8: Green dots are non-prime numbers ended by 3 Figure 7: Yellow dots are Non-Prime numbers ended by 7
Figure 6: Even & numbers ended by 5 are plotted in white.
14. Ulam Spiral Hidden Patterns
Page 13 of 15
Figure 10: A merge between Non-Prim TRED & SVEN. Figure 9: Purple dots are non-prime numbers ended by 9.
Figure 13: Adding OEN to Even & 5s Figure 14: OEN & NIEN added to even & 5's
Figure 12: Ulam SpiralFigure 11: OEN, TREN, NIEN added to
even & 5's
15. Ulam Spiral Hidden Patterns
Page 14 of 15
Conclusion
Ulam Spiral can be generated without the need to have a list of prime numbers or test if a
number is a prime or not.
Diagonal patterns are due to non-prime even numbers, and non-prime numbers ended by 5.
OEN, TREN & NIEN sets have waves of multiplies with a defined formula , that can be used to
generate non-prime numbers without directly without the need to test if the generated number
is prime or not, or the need of generate these numbers in sequence. We can choose N as any
arbitrary positive integer and substitute in Wave formulas to get a non-prime number.
Adding non-prime (OEN, TREN, NIEN) numbers just make distortion to this pattern and that
gives the impression that prime numbers in Ulman Spiral are related together in lines. While it is
vice versa, even numbers and numbers ended by 5 create the pattern and prime number just
distorted it.
Python Script to Generate Ulam is here
https://www.dropbox.com/s/kl5fzccigl0132g/UlamSpiralGenerator.v1.py?dl=0
16. Ulam Spiral Hidden Patterns
Page 15 of 15
References
Prime Number Validator – Author Mohammad Hefny
http://www.slideshare.net/MHefny/prime-number-validator
Wikipedia (Ulam Spiral): http://en.wikipedia.org/wiki/Ulam_spiral
The Distribution of Prime Numbers on the Square Root Spiral - Authors Harry K. Hahn
http://arxiv.org/ftp/arxiv/papers/0801/0801.1441.pdf