Prime Numbers in Linear Patterns
From Math Images
Line 19: | Line 19: | ||
Proof. | Proof. | ||
Given any prime number <math> p</math>, assume that <math>p </math> is neither congruent to 1 (mod 30) nor <math> q</math> (mod 30) for every prime <math> q</math> less than 30. Then <math> p </math> is congruent to <math>x </math> (mod 30), where <math> x </math> is some integer less than 30 that is not 1 and not a prime. Prime factorization of <math> x </math> must contain one of 2, 3, and 5. (If the prime factorization of <math>x </math> did not contain any of 2, 3, or 5, then the smallest possible value of <math> x</math> will be <math>7 * 7 =49 </math>, which is greater than 30). Thus, <math> x=2^a3^b5^c</math>, where <math> a,b,c >=0</math>, and at least one of <math> a,b,c</math> is greater than 0. Since <math> p </math> is congruent to <math> x</math>, we can write <math>p </math> as <math> p=30*n+2^a3^b5^c</math>, where <math>n </math> is an integer greater than or equal to 1. Then, <math>p=30*n+2^a3^b5^c=(2*3*5)n+2^a3^b5^c </math>. <math> p</math> is then equal to one of <math> 2(3*5*n+2^{a-1}3^b5^c</math> or <math> 3(2*5*n+2^a3^{b-1}5^c)</math> or <math>5(2*3*n+2^a3^b5^{c-1})</math>, which contradicts <math>p </math> being a prime number. Thus, <math> p \equiv 1 \pmod {30}</math> or <math> p \equiv q \pmod {30}</math>. | Given any prime number <math> p</math>, assume that <math>p </math> is neither congruent to 1 (mod 30) nor <math> q</math> (mod 30) for every prime <math> q</math> less than 30. Then <math> p </math> is congruent to <math>x </math> (mod 30), where <math> x </math> is some integer less than 30 that is not 1 and not a prime. Prime factorization of <math> x </math> must contain one of 2, 3, and 5. (If the prime factorization of <math>x </math> did not contain any of 2, 3, or 5, then the smallest possible value of <math> x</math> will be <math>7 * 7 =49 </math>, which is greater than 30). Thus, <math> x=2^a3^b5^c</math>, where <math> a,b,c >=0</math>, and at least one of <math> a,b,c</math> is greater than 0. Since <math> p </math> is congruent to <math> x</math>, we can write <math>p </math> as <math> p=30*n+2^a3^b5^c</math>, where <math>n </math> is an integer greater than or equal to 1. Then, <math>p=30*n+2^a3^b5^c=(2*3*5)n+2^a3^b5^c </math>. <math> p</math> is then equal to one of <math> 2(3*5*n+2^{a-1}3^b5^c</math> or <math> 3(2*5*n+2^a3^{b-1}5^c)</math> or <math>5(2*3*n+2^a3^b5^{c-1})</math>, which contradicts <math>p </math> being a prime number. Thus, <math> p \equiv 1 \pmod {30}</math> or <math> p \equiv q \pmod {30}</math>. | ||
- | |||
- | |||
- | |||
|AuthorName=Iris Yoon | |AuthorName=Iris Yoon | ||
|Field=Algebra | |Field=Algebra | ||
|InProgress=No | |InProgress=No | ||
}} | }} |
Revision as of 23:02, 7 December 2012
Prime numbers in table with 180 columns |
---|
Prime numbers in table with 180 columns
- Prime numbers marked in a table with 180 columns
Contents |
Basic Description
Arranging natural numbers in a particular way and marking the prime numbers can lead to interesting patterns. For example, consider a table with 180 columns and infinitely many rows. Write positive integers in increasing order from left to right, and top to bottom. If we mark all the prime numbers, we get a pattern shown in the figure. We can see that prime numbers show patterns of vertical line segments.A More Mathematical Explanation
Instead of studying a table with 180 columns, we will study a table with 30 columns, as shown in [[#1 [...]
Instead of studying a table with 180 columns, we will study a table with 30 columns, as shown in Image 1.
Construction
First, create a table with 30 columns and sufficiently many rows. Write all positive integers starting from 1 as one moves from left to right, and top to bottom. Then, each row will start with a multiple of 30 added by 1, such as 1, 31, 61, 91, 121, ... . If we mark the prime numbers in this table we get Image 2.
Theorem 1
All prime numbers appear on columns that have a 1 or a prime number on its top row. In other words, for every prime number , either , or there exists a prime number less than 30 such that .
Proof. Given any prime number , assume that is neither congruent to 1 (mod 30) nor (mod 30) for every prime less than 30. Then is congruent to (mod 30), where is some integer less than 30 that is not 1 and not a prime. Prime factorization of must contain one of 2, 3, and 5. (If the prime factorization of did not contain any of 2, 3, or 5, then the smallest possible value of will be , which is greater than 30). Thus, , where , and at least one of is greater than 0. Since is congruent to , we can write as , where is an integer greater than or equal to 1. Then, . is then equal to one of or or , which contradicts being a prime number. Thus, or .
Teaching Materials
- There are currently no teaching materials for this page. Add teaching materials.
Leave a message on the discussion page by clicking the 'discussion' tab at the top of this image page.