By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or ...By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or algorithm on natural numbers and their sets. The algorithm mechanically yields a sequence of sets, which converges to the set of all primes p such that 2p + 1 divides the Mersenne number Mp. The cardinal sequence corresponding to the sequence of sets is strictly increasing. So that we have captured enough usable structures, without any estimation, the existing theories of those structures allow us to prove an exact result: there are infinitely many Mersenne composite numbers with prime exponents Mp.展开更多
A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the preci...A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M<sub>N</sub>]. This permits the formulation of an extended twin prime conjecture. Moreover, it is found that the prime numbers subsets contained in Mersenne intervals have cardinalities strongly correlated with the corresponding Mersenne numbers.展开更多
Considering Pythagorician divisors theory which leads to a new parameterization, for Pythagorician triplets ( a,b,c )∈ ℕ 3∗ , we give a new proof of the well-known problem of these particular squareless numbers n∈ ℕ...Considering Pythagorician divisors theory which leads to a new parameterization, for Pythagorician triplets ( a,b,c )∈ ℕ 3∗ , we give a new proof of the well-known problem of these particular squareless numbers n∈ ℕ ∗ , called congruent numbers, characterized by the fact that there exists a right-angled triangle with rational sides: ( A α ) 2 + ( B β ) 2 = ( C γ ) 2 , such that its area Δ= 1 2 A α B β =n;or in an equivalent way, to that of the existence of numbers U 2 , V 2 , W 2 ∈ ℚ 2∗ that are in an arithmetic progression of reason n;Problem equivalent to the existence of: ( a,b,c )∈ ℕ 3∗ prime in pairs, and f∈ ℕ ∗ , such that: ( a−b 2f ) 2 , ( c 2f ) 2 , ( a+b 2f ) 2 are in an arithmetic progression of reason n;And this problem is also equivalent to that of the existence of a non-trivial primitive integer right-angled triangle: a 2 + b 2 = c 2 , such that its area Δ= 1 2 ab=n f 2 , where f∈ ℕ ∗ , and this last equation can be written as follows, when using Pythagorician divisors: (1) Δ= 1 2 ab= 2 S−1 d e ¯ ( d+ 2 S−1 e ¯ )( d+ 2 S e ¯ )=n f 2;Where ( d, e ¯ )∈ ( 2ℕ+1 ) 2 such that gcd( d, e ¯ )=1 and S∈ ℕ ∗ , where 2 S−1 , d, e ¯ , d+ 2 S−1 e ¯ , d+ 2 S e ¯ , are pairwise prime quantities (these parameters are coming from Pythagorician divisors). When n=1 , it is the case of the famous impossible problem of the integer right-angled triangle area to be a square, solved by Fermat at his time, by his famous method of infinite descent. We propose in this article a new direct proof for the numbers n=1 (resp. n=2 ) to be non-congruent numbers, based on an particular induction method of resolution of Equation (1) (note that this method is efficient too for general case of prime numbers n=p≡a ( ( mod8 ) , gcd( a,8 )=1 ). To prove it, we use a classical proof by induction on k , that shows the non-solvability property of any of the following systems ( t=0 , corresponding to case n=1 (resp. t=1 , corresponding to case n=2 )): ( Ξ t,k ){ X 2 + 2 t ( 2 k Y ) 2 = Z 2 X 2 + 2 t+1 ( 2 k Y ) 2 = T 2 , where k∈ℕ;and solutions ( X,Y,Z,T )=( D k , E k , f k , f ′ k )∈ ( 2ℕ+1 ) 4 , are given in pairwise prime numbers.2020-Mathematics Subject Classification 11A05-11A07-11A41-11A51-11D09-11D25-11D41-11D72-11D79-11E25 .展开更多
It is given in Weil and Rosenlicht ([1], p. 15) that (resp. 2) for all non-negative integers m and n with m≠n if c is any even (resp. odd) integer. In the present paper we generalize this. Our purpose is to give othe...It is given in Weil and Rosenlicht ([1], p. 15) that (resp. 2) for all non-negative integers m and n with m≠n if c is any even (resp. odd) integer. In the present paper we generalize this. Our purpose is to give other integral sequences such that G.C.D.(ym,yn)=1 for all positive integers m and n with m≠n. Roughly speaking we show the following 1) and 2). 1) There are infinitely many polynomial sequences such that G.C.D.(fm(a),fn(a))=1 for all positive integers m and n with with m≠n and infinitely many rational?integers a. 2) There are polynomial sequences such that G.C.D.(gm(a,b),gn(a,b))=1 for all positive integers m and n with m≠n and arbitrary (rational or odd) integers a and b with G.C.D.(a,b)=1. Main results of the present paper are Theorems 1 and 2, and Corollaries 3, 4 and 5.展开更多
The Fine Structure Constant (α) is a dimensionless value that guides much of quantum physics but with no scientific insight into why this specific number. The number defines the coupling constant for the strength of ...The Fine Structure Constant (α) is a dimensionless value that guides much of quantum physics but with no scientific insight into why this specific number. The number defines the coupling constant for the strength of the electromagnetic force and is precisely tuned to make our universe functional. This study introduces a novel approach to understanding a conceptual model for how this critical number is part of a larger design rather than a random accident of nature. The Fine Structure Constant (FSC) model employs a Python program to calculate n-dimensional property sets for prime number universes where α equals the whole number values 137 and 139, representing twin prime universes without a fractional constant. Each property is defined by theoretical prime number sets that represent focal points of matter and wave energy in their respective universes. This work aims to determine if these prime number sets can reproduce the observed α value, giving it a definable structure. The result of the FSC model produces a α value equal to 137.036, an almost exact match. Furthermore, the model indicates that other twin prime pairs also have a role in our functional universe, providing a hierarchy for atomic orbital energy levels and alignment with the principal and azimuthal quantum numbers. In addition, it construes stable matter as property sets with the highest ratio of twin prime elements. These results provide a new perspective on a mathematical structure that shapes our universe and, if valid, has the structural complexity to guide future research.展开更多
We present an intuitively satisfying geometric proof of Fermat's result for positive integers that for prime moduli p, provided p does not divide a. This is known as Fermat’s Little Theorem. The proof is novel in...We present an intuitively satisfying geometric proof of Fermat's result for positive integers that for prime moduli p, provided p does not divide a. This is known as Fermat’s Little Theorem. The proof is novel in using the idea of colorings applied to regular polygons to establish a number-theoretic result. A lemma traditionally, if ambiguously, attributed to Burnside provides a critical enumeration step.展开更多
Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the n...Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.展开更多
文摘By extending both arithmetical operations into finite sets of natural numbers, from the entire set of natural numbers successively deleting some residue classes modulo a prime, we invented a recursive sieve method or algorithm on natural numbers and their sets. The algorithm mechanically yields a sequence of sets, which converges to the set of all primes p such that 2p + 1 divides the Mersenne number Mp. The cardinal sequence corresponding to the sequence of sets is strictly increasing. So that we have captured enough usable structures, without any estimation, the existing theories of those structures allow us to prove an exact result: there are infinitely many Mersenne composite numbers with prime exponents Mp.
文摘A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M<sub>N</sub>]. This permits the formulation of an extended twin prime conjecture. Moreover, it is found that the prime numbers subsets contained in Mersenne intervals have cardinalities strongly correlated with the corresponding Mersenne numbers.
文摘Considering Pythagorician divisors theory which leads to a new parameterization, for Pythagorician triplets ( a,b,c )∈ ℕ 3∗ , we give a new proof of the well-known problem of these particular squareless numbers n∈ ℕ ∗ , called congruent numbers, characterized by the fact that there exists a right-angled triangle with rational sides: ( A α ) 2 + ( B β ) 2 = ( C γ ) 2 , such that its area Δ= 1 2 A α B β =n;or in an equivalent way, to that of the existence of numbers U 2 , V 2 , W 2 ∈ ℚ 2∗ that are in an arithmetic progression of reason n;Problem equivalent to the existence of: ( a,b,c )∈ ℕ 3∗ prime in pairs, and f∈ ℕ ∗ , such that: ( a−b 2f ) 2 , ( c 2f ) 2 , ( a+b 2f ) 2 are in an arithmetic progression of reason n;And this problem is also equivalent to that of the existence of a non-trivial primitive integer right-angled triangle: a 2 + b 2 = c 2 , such that its area Δ= 1 2 ab=n f 2 , where f∈ ℕ ∗ , and this last equation can be written as follows, when using Pythagorician divisors: (1) Δ= 1 2 ab= 2 S−1 d e ¯ ( d+ 2 S−1 e ¯ )( d+ 2 S e ¯ )=n f 2;Where ( d, e ¯ )∈ ( 2ℕ+1 ) 2 such that gcd( d, e ¯ )=1 and S∈ ℕ ∗ , where 2 S−1 , d, e ¯ , d+ 2 S−1 e ¯ , d+ 2 S e ¯ , are pairwise prime quantities (these parameters are coming from Pythagorician divisors). When n=1 , it is the case of the famous impossible problem of the integer right-angled triangle area to be a square, solved by Fermat at his time, by his famous method of infinite descent. We propose in this article a new direct proof for the numbers n=1 (resp. n=2 ) to be non-congruent numbers, based on an particular induction method of resolution of Equation (1) (note that this method is efficient too for general case of prime numbers n=p≡a ( ( mod8 ) , gcd( a,8 )=1 ). To prove it, we use a classical proof by induction on k , that shows the non-solvability property of any of the following systems ( t=0 , corresponding to case n=1 (resp. t=1 , corresponding to case n=2 )): ( Ξ t,k ){ X 2 + 2 t ( 2 k Y ) 2 = Z 2 X 2 + 2 t+1 ( 2 k Y ) 2 = T 2 , where k∈ℕ;and solutions ( X,Y,Z,T )=( D k , E k , f k , f ′ k )∈ ( 2ℕ+1 ) 4 , are given in pairwise prime numbers.2020-Mathematics Subject Classification 11A05-11A07-11A41-11A51-11D09-11D25-11D41-11D72-11D79-11E25 .
文摘It is given in Weil and Rosenlicht ([1], p. 15) that (resp. 2) for all non-negative integers m and n with m≠n if c is any even (resp. odd) integer. In the present paper we generalize this. Our purpose is to give other integral sequences such that G.C.D.(ym,yn)=1 for all positive integers m and n with m≠n. Roughly speaking we show the following 1) and 2). 1) There are infinitely many polynomial sequences such that G.C.D.(fm(a),fn(a))=1 for all positive integers m and n with with m≠n and infinitely many rational?integers a. 2) There are polynomial sequences such that G.C.D.(gm(a,b),gn(a,b))=1 for all positive integers m and n with m≠n and arbitrary (rational or odd) integers a and b with G.C.D.(a,b)=1. Main results of the present paper are Theorems 1 and 2, and Corollaries 3, 4 and 5.
文摘The Fine Structure Constant (α) is a dimensionless value that guides much of quantum physics but with no scientific insight into why this specific number. The number defines the coupling constant for the strength of the electromagnetic force and is precisely tuned to make our universe functional. This study introduces a novel approach to understanding a conceptual model for how this critical number is part of a larger design rather than a random accident of nature. The Fine Structure Constant (FSC) model employs a Python program to calculate n-dimensional property sets for prime number universes where α equals the whole number values 137 and 139, representing twin prime universes without a fractional constant. Each property is defined by theoretical prime number sets that represent focal points of matter and wave energy in their respective universes. This work aims to determine if these prime number sets can reproduce the observed α value, giving it a definable structure. The result of the FSC model produces a α value equal to 137.036, an almost exact match. Furthermore, the model indicates that other twin prime pairs also have a role in our functional universe, providing a hierarchy for atomic orbital energy levels and alignment with the principal and azimuthal quantum numbers. In addition, it construes stable matter as property sets with the highest ratio of twin prime elements. These results provide a new perspective on a mathematical structure that shapes our universe and, if valid, has the structural complexity to guide future research.
文摘We present an intuitively satisfying geometric proof of Fermat's result for positive integers that for prime moduli p, provided p does not divide a. This is known as Fermat’s Little Theorem. The proof is novel in using the idea of colorings applied to regular polygons to establish a number-theoretic result. A lemma traditionally, if ambiguously, attributed to Burnside provides a critical enumeration step.
文摘Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.