اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe distribution of natural numbers divisible by 2,3,5,11,13 and 17 on the Square Root Spiral
282
0
0.0
(
0
)
تأليف
Harry K. Hahn
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The natural numbers divisible by the Prime Factors 2, 3, 5, 11, 13 and 17 lie on defined spiral graphs, which run through the Square Root Spiral. A mathematical analysis shows, that these spiral graphs are defined by specific quadratic polynomials. Basically all natural number which are divisible by the same prime factor lie on such spiral graphs. And these spiral graphs can be assigned to a certain number of Spiral Graph Systems, which have a defined spatial orientation to each other. This document represents a supplementation to my detailed introduction study to the Square Root Spiral, and it contains the missing diagrams and analyses, showing the distribution of the natural numbers divisible by 2, 3, 5, 11, 13 and 17 on the Square Root Spiral. My introduction study to the Square Root Spiral can be found in the arxiv-archive. The title of this study : The ordered distribution of the natural numbers on the Square Root Spiral.
قيم البحث
اقرأ أيضاً
Natural numbers divisible by the same prime factor lie on defined spiral graphs which are running through the Square Root Spiral (also named as the Spiral of Theodorus or Wurzel Spirale or Einstein Spiral). Prime Numbers also clearly accumulate on su
ch spiral graphs. And the square numbers 4, 9, 16, 25, 36,... form a highly three-symmetrical system of three spiral graphs, which divides the square-root-spiral into three equal areas. A mathematical analysis shows that these spiral graphs are defined by quadratic polynomials. Fibonacci number sequences also play a part in the structure of the Square Root Spiral. Fibonacci Numbers divide the Square Root Spiral into areas and angle sectors with constant proportions. These proportions are linked to the golden mean (or golden section), which behaves as a self-avoiding-walk-constant in the lattice-like structure of the square root spiral.
Prime Numbers clearly accumulate on defined spiral graphs,which run through the Square Root Spiral. These spiral graphs can be assigned to different spiral-systems, in which all spiral-graphs have the same direction of rotation and the same -- second
difference -- between the numbers, which lie on these spiral-graphs. A mathematical analysis shows, that these spiral graphs are caused exclusively by quadratic polynomials. For example the well known Euler Polynomial x2+x+41 appears on the Square Root Spiral in the form of three spiral-graphs, which are defined by three different quadratic polynomials. All natural numbers,divisible by a certain prime factor, also lie on defined spiral graphs on the Square Root Spiral (or Spiral of Theodorus, or Wurzelspirale). And the Square Numbers 4, 9, 16, 25, 36 even form a highly three-symmetrical system of three spiral graphs, which divides the square root spiral into three equal areas. Fibonacci number sequences also play a part in the structure of the Square Root Spiral. With the help of the Number-Spiral, described by Mr. Robert Sachs, a comparison can be drawn between the Square Root Spiral and the Ulam Spiral. The shown sections of his study of the number spiral contain diagrams, which are related to my analysis results, especially in regards to the distribution of prime numbers.
We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.
Let $alpha=0.a_1a_2a_3ldots$ be an irrational number in base $b>1$, where $0leq a_i<b$. The number $alpha in (0,1)$ is a $textit{normal number}$ if every block $(a_{n+1}a_{n+2}ldots a_{n+k})$ of $k$ digits occurs with probability $1/b^k$. A condition
al proof of the normality of the real number $pi$ in base $10$ is presented in this note.
We present the pattern underlying some of the properties of natural numbers, using the framework of complex networks. The network used is a divisibility network in which each node has a fixed identity as one of the natural numbers and the connections
among the nodes are made based on the divisibility pattern among the numbers. We derive analytical expressions for the centrality measures of this network in terms of the floor function and the divisor functions. We validate these measures with the help of standard methods which make use of the adjacency matrix of the network. Thus how the measures of the network relate to patterns in the behaviour of primes and composite numbers becomes apparent from our study.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
