投稿

On the Relationship Between a Complete Classification of Odd Composite Numbers and Artin's Primitive Root Conjecture

Abstract This paper examines the possible relationship between the author's odd composite classification formula \(K(p,d)=p(p+2d-2)\) and Artin's Primitive Root Conjecture. While the Kawano Equation provides a complete representation of odd composite numbers and yields odd primes as a complementary set, Artin's conjecture concerns the multiplicative structure of finite fields modulo prime numbers. These theories operate at different structural levels of number theory. Nevertheless, by interpreting the Kawano Equation as a filtering mechanism on the odd integers and Artin's conjecture as a secondary classification within the resulting prime set, a hierarchical framework for prime distribution is proposed. 1. Introduction The classification of prime and composite numbers has occupied a central position in number theory. The Kawano Equation \(K(p,d)=p(p+2d-2)\) was introduced as a complete parametrization of odd composite numbers. If all integer...

Geometric Infinite Expansion of Squares and the Fractal Model of Prime Creation at the +1 Boundary

イメージ
This paper introduces a geometric framework that defines numbers not as dimensionless points, but as the areas of squares, emphasizing dimension and spatial extension. By modeling the interaction between the infinity of the integer space and the self-similar (fractal) expansion of squares . This is my formula which generate prime numbers. In geometric terms, this formula is rigorously illustrated as follows: 1. Core Formation: A closed square domain of area p^2 , with a side length equal to the prime p. 2. Asymmetric Expansion (Gnomon): Two rectangular domains of width (d−1) and length p, structurally appended to the horizontal and vertical boundaries, denoted by 2p(d−1). This process represents an infinite expansion algorithm wherein the square consumes the external integer space while strictly preserving its own self-similarity. Squares possess the highest structural affinity for fractals due to their capacity for infinite grid-like division and consolidation. As d progr...

Erdős–Straus conjecture

イメージ
This is Erdős–Straus conjecture. n is prime number. This is Diophantine equation . You can write this. Y=nX Therefore, you need to know prime numbers in my blog. n=p(p+2d−2) Ex. p≡1 (mod4) p=5

Descartes' theorem

イメージ
This is four kissing circles . The bigger is the smaller curvature. -10 is the outer circle. You put the numbers on it. This is religion in my country.

The kissing number problem

イメージ
The kissing number has no overlapping spheres. A kissing number is defined as the independent sphere which is touched. In lattice packing , the kissing number is the same, but arbitrary sphere packing is different because of the random shape of spheres. It is the maximum possible kissing number for n-dimensional spheres in (n + 1)-dimensional Euclidean space. In one dimension, the kissing number is 2 . In two dimensions, the kissing number is 6. This is isosceles. D=1 ⇒ 2 D=2 ⇒ 6 D=3 ⇒ 12 D=4 ⇒ 24 D=5 ⇒ 40 This is like exponential function.

The Invisible Boundaries of Number: Transcendence and the Diophantine World

​At first glance, the study of Diophantine equations —seeking whole-number solutions to polynomial equations—seems like the most grounded form of mathematics. It deals with integers, the very building blocks of counting. However, to understand the limits of these "simple" numbers, mathematicians must often journey into the realm of Transcendence Theory , which deals with numbers that are essentially "too complex" to be captured by standard algebra. ​The Problem of Rational Shadows ​The central challenge in solving Diophantine equations is determining whether a specific equation has a finite or infinite number of solutions. To solve this, mathematicians look at how "irrational" certain numbers are. ​In the 19th century, Joseph Liouville discovered that some numbers are so far removed from the world of algebra that they cannot be easily mimicked by fractions. These are transcendental numbers . Think of them as targets on a map; algebraic numbers (the ...

The Determinism of Density: From Prime Composites to the Event Horizon

​I. The Mathematical Anchor: The n = p^2 + 2p(d-1) Framework ​In the study of number theory, the distribution of prime numbers has often been characterized by its apparent randomness—a "noise" that mathematicians have sought to tune into for centuries. Your formula, n = p^2 + 2p(d-1), shifts the focus from the search for primes to the deterministic mapping of composite numbers. ​By setting p as a prime base and d as a natural number (d = 1, 2, 3, \dots), the formula identifies a specific arithmetic progression of composite numbers. When d=1, we find the "origin" of the sequence at p^2. As d increases, we map out the "multiples" that are specifically generated by that prime's interaction with the number line. ​This approach suggests a Sieve of Eratosthenes viewed through a structured lens. Instead of removing "random" non-primes, we are identifying the "gravity" that prime numbers exert on the integers surrounding them. If primes...