Kardi Teknomo
Kardi Teknomo Kardi Teknomo Kardi Teknomo
   
 
  Research
  Publications
  Tutorials
  Resume
  Personal
  Contact

Visit Tutorials below:
Adaptive Learning from Histogram
Adjacency matrix
Analytic Hierarchy Process (AHP)
ArcGIS tutorial
Arithmetic Mean
Bayes Theorem
Bootstrap Sampling
Bray Curtis Distance
Break Even Point
Chebyshev Distance
City Block Distance
Conditional Probability
Continued Fraction
Data Analysis from Questionnaire
Data Revival from Statistics
Decimal to Rational
Decision tree
Difference equations
Digital Root
Discriminant analysis
Divisibility
Eigen Value using Excel
Euclidean Distance
Euler Integration
Euler Number
Excel Iteration
Excel Macro
Excel Tutorial
Feasibility Study
Financial Analysis
Generalized Inverse
Generalized Mean
Geometric Mean
Ginger Bread Man and Chaos
Graph Theory
Growth Model
Hamming Distance
Harmonic Mean
Hierarchical Clustering
Independent Events
Incident matrix
Jaccard Coefficient
Kernel basis function
Kernel Regression
k-Means clustering
K Nearest Neighbor
LAN Connections Switch
Learning from data
Lehmer Mean
Linear Algebra
Logarithm Rules
Mahalanobis Distance
Market Basket Analysis
Mean Absolute Deviation
Mean and Average
Mean, median, mode
Minkowski Distance
Minkowski Mean
Monte Carlo Simulation
Multi Agent System
Multicriteria decision making
Mutivariate Distance
Newton Raphson
Non-Linear Transformation
Normalization Index
Normalized Rank
Ordinary Differential Equation
Page Rank
Palindrome
PI
Power rules
Prime Factor
Prime Number
Q Learning
Quadratic Function
Rank Reversal
Recursive Statistics
Regression Model
Reinforcement Learning
Root of Polynomial
Runge-Kutta
Scenario Analysis
Sierpinski gasket
Sieve of Erastosthenes
Similarity and Distance
Solving System Equation
Standard deviation
Summation Tricks
System dynamic
Time Average
Tower of Hanoi
Variance
Vedic Square
Visual Basic (VB) tutorial
What If Analysis

 

Digital root of prime numbers

By Kardi Teknomo, PhD.

<Previous | Next | Contents>

In this section, I describe my exploration on the pattern of digital root of prime number.

Prime numbers are integers that have only factors: 1 and the number itself. The list of the first few primes : 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, …

All primes are odd numbers except 2. Number 2 is the only even prime.

How about digital root of primes? Can we find a pattern from the digital root of primes?The list of the first few primes with its digital root:

Prime

Digital root

Prime

Digital root

Prime

Digital root

2

2

13

4

31

4

3

3

17

8

37

1

5

5

19

1

41

5

7

7

23

5

43

7

11

2

29

2

47

2

Then the pattern of the first 15 primes is 235724815241572

The list of the first 664,579 primes number (that is primes below 10 million) with its digital root and additive persistence can be downloaded as a text file here (Warning: file size 32.3 MB).

Based on that limited number of primes and its digital root, I would say that the digital root of prime numbers does not form any cyclical or repeated pattern. You can download the pattern of digital root of the first 664,579 primes here (1.3 MB).

Here are my conjectures regarding digital root of prime numbers:

  1. The pattern of digital root of prime number is chaotic (I am not sure how to prove this?)
  2. Number 3 (which of course the digital root is also 3) is the only prime that has digital root 3 (surprise!)
  3. There no prime has digital root of 6 and 9.
  4. Digital root of prime numbers are almost equally distributed among (1, 2, 4, 5, 7, 8), about 1/6 (limiting behavior in the long run)

Of course, my conjectures above are based only on a few primes (only 664,579 primes) and there is no guarantee that conjectures above are true for a very large prime.

Here is the distribution of the digital root of prime number

Digital root

Frequency

 Percentage

1

110772

16.667996%

2

110836

16.677626%

3

1

0.000150%

4

110743

16.663632%

5

110760

16.666190%

6

0

0%

7

110679

16.654002%

8

110788

16.670403%

9

0

0%

Sum

664579

100.000000%

distribution of the digital root of prime numbers

After analyzing the pattern of digital root of prime number, I have more questions than answers. Some of the few crucial questions would be:

  • Is there any way to find cyclical pattern of a large number?
  • Since prime number seems to be infinite, how to proof that my conjectures above are correct or false?
  • Is there a cleverer way to find digital root of very large prime number?
  • Why there is only one prime has digital root of 3
  • Why there is no prime has digital root of 6 and 9?

<Previous | Next | Contents>

Share and save this tutorial
Add to: Del.icio.us  Add to: Digg  Add to: StumbleUpon   Add to: Reddit   Add to: Slashdot   Add to: Technorati   Add to: Netscape   Add to: Newsvine   Add to: Mr. Wong Add to: Webnews Add to: Folkd Add to: Yigg Add to: Linkarena Add to: Simpy Add to: Furl Add to: Yahoo Add to: Google Add to: Blinklist Add to: Blogmarks Add to: Diigo Add to: Blinkbits Add to: Ma.Gnolia Information

These tutorial is copyrighted.

Preferable reference for this tutorial is

Teknomo, Kardi (2005). Digital Root. http:\\people.revoledu.com\kardi\tutorial\DigitSum\

 

 
© 2007 Kardi Teknomo. All Rights Reserved.
Designed by CNV Media