noir - dark arts criticism - Page 2 of 20 - Informare Sub Specie Semioticae %

July 27, 2025July 30, 2025

Density Sequence Analyzer for k \ |6xy + x + y|

The following Python code is intended to calculate the density of each twin prime pair as a relative value in the sequence of all possible twin prime pairs 6k-1,6k+1. (An extension of the empirical investigation here which corroborated the Hardy Littlewood Conjecture 1 by finding an empirical value of 7.53 compared to the conjectured 12*0.66=7.92 using a limited data set of k indices.)

Note: If you want to include 3,5 for a complete count, you can just add 1/1 to the value you consider in the c/n fraction list, so the first value in the below would be 2/2 (as opposed to 1/1).

Recall our reformulation of the Twin Prime Conjecture: Twin Prime Index Conjecture

Let:f(x,y)=∣6xy+x+y∣

where 𝑥,𝑦 ∈ 𝑍∖{0} (i.e., both are non-zero integers, so may be positive or negative).

Define the set:

𝐾composite = {𝑓(𝑥,𝑦): 𝑥≠0, 𝑦≠0}

Then: A positive integer 𝑘 is the index of a twin prime pair (6𝑘−1,6𝑘+1) if and only if:

𝑘∉𝐾composite

Therefore, the Twin Prime Conjecture is true if and only if:

𝑍+∖𝐾composite is infinite

In plain language: There are infinitely many twin primes if and only if there are infinitely many positive integers 𝑘 that cannot be written in the form ∣6𝑥𝑦+𝑥+𝑦∣ for any non-zero integers 𝑥,𝑦.

Decoding the c/n Fraction: A Measure of Twin Prime Density

Our Python script generates a list of fractions in the format c/n. While simple in appearance, each fraction is a data point in the study of the Twin Prime Conjecture. Let’s break down what c and n represent.

What are n and c?

First, n is one of the “uncreatable” integers our script finds. These are special numbers because they are the keys to generating twin primes of the form (6k-1, 6k+1).

n is the Twin Prime Index: When our code produces the fraction 5/7, the denominator n = 7 is an integer that cannot be created by the formula |6xy + x + y|. This means k=7 generates a twin prime pair:
- 6n – 1 = 6(7) – 1 = 41 (a prime)
- 6n + 1 = 6(7) + 1 = 43 (a prime)

Next, c is the rank of that index in the sequence of all such indices found so far.

c is the Cumulative Count: For the fraction 5/7, the numerator c = 5 tells us that 7 is the 5th such special number we have discovered. The sequence of these indices begins: 1, 2, 3, 5, 7, 10, …

Introducing a Counting Function: π_twin_k(N)

To analyze density formally, we define a counting function for our sequence:

Let π_twin_k(N) be the function that counts the number of “uncreatable” integers k that are less than or equal to N.

In our c/n notation, the relationship is simple: c = π_twin_k(n). Therefore, the fraction our code calculates is a precise measure of density:

Density at n = c / n = π_twin_k(n) / n

What This Density Reveals: The Hardy-Littlewood Conjecture

The real power of this analysis comes from comparing our results to the famous First Hardy-Littlewood Conjecture. This conjecture doesn’t just say there are infinite twin primes; it predicts their exact density.

1. The Standard Prediction

The “textbook” version of the conjecture is for the number of primes p (where p ≤ X) such that p+2 is also prime. Let’s call this count π₂(X). The formula is:

π₂(X) ≈ 2 * C₂ * (X / (log X)²)

Here, C₂ is the twin prime constant, approximately 0.66016.

2. Adapting the Formula for Our Sequence

Our script doesn’t count primes p, it counts indices k up to a limit n. To use the formula, we must connect our (k, n) world to the standard (p, X) world.

The crucial link is that our primes are in two arithmetic progressions of the form p = |6k + 1|. This means the primes we are finding extend up to a value of approximately 6n. Therefore, we should substitute X = 6n into the standard formula.

c = π_twin_k(n) ≈ π₂(6n)
c ≈ 2 * C₂ * ( 6n / (log(6n))² )

Now we have a prediction for our count, c.

3. Deriving Our Theoretical Constant K

Our analysis script checked the behavior of the product (c/n) * (log n)². Let’s see what the adapted formula predicts for this value:

First, let’s calculate the predicted density c/n:
c/n ≈ [ 2 * C₂ * (6n / (log(6n))²) ] / n
c/n ≈ 12 * C₂ / (log(6n))²

Now, multiply by (log n)² just as the script did:
K ≈ [ 12 * C₂ / (log(6n))² ] * (log n)²

Using the logarithm property log(6n) = log(6) + log(n), we get:
K ≈ 12 * C₂ * [ (log n)² / (log(6) + log(n))² ]

As n gets very large, the log(n) term dominates the constant log(6), and the fraction (log n)² / (log(6) + log(n))² gets closer and closer to 1.

This leaves us with a stunningly clear prediction for our constant K:

K ≈ 12 * C₂

4. The Final Result

Plugging in the value for the twin prime constant gives us our answer:

K ≈ 12 * 0.6601618… ≈ 7.922

This explains why the script’s calculation was converging to a value near 7, not the 2 * C₂ ≈ 1.32 that a naive application of the formula would suggest. The factor of 6 in our prime-generating formula (6k±1) scales the final constant by 6, turning 2C₂ into 12C₂.

The script’s empirical result (K ≈ 7.360819 at n=150,000,000) acts as a powerful verification of this mathematical reasoning.

Python Code:

"""
Density Sequence Analyzer for Twin Prime Indices

This script investigates the distribution of twin primes by analyzing the Diophantine
equation |6xy + x + y| = k. Based on the conjecture that a number 'k' is the index
of a twin prime pair (6k-1, 6k+1) if and only if it CANNOT be generated by the
expression, this code performs the following analysis:

1.  **Finds "Uncreatable" Numbers**: It identifies all integers up to a specified
    limit (K_LIMIT) that are not solutions to the equation for any non-zero
    integers x and y. These are the twin prime indices.

2.  **Calculates the Largest Twin Prime Pair**: Using the largest uncreatable
    index 'k' found, it calculates the corresponding twin prime pair using the
    formula (6k - 1, 6k + 1).

3.  **Computes the Empirical Hardy-Littlewood Constant**: It calculates the density
    of the uncreatable numbers and uses this to compute an empirical value for a
    constant related to the Hardy-Littlewood twin prime conjecture. This script
    tests the prediction that the value (c/n) * (log n)² should converge to
    12 * C₂, where C₂ is the twin prime constant.

The script outputs truncated lists of the found numbers and their density fractions,
followed by a final summary of the analysis.
"""

from typing import List, Dict, Set, Union
import numpy as np

def find_uncreatable_numbers(max_k: int) -> List[int]:
    """
    Finds all integers up to a limit that cannot be expressed by |6xy + x + y|.

    This function iterates through a bounded range of non-zero integer pairs (x, y)
    and calculates k = |6xy + x + y|. It stores these "creatable" values in a set.
    Finally, it returns the sorted list of numbers from 1 to max_k that were
    never created.

    Args:
        max_k: The upper integer limit (inclusive) for the analysis.

    Returns:
        A sorted list of "uncreatable" integers, which are the indices of
        twin prime pairs of the form (6k-1, 6k+1).
    """
    if not isinstance(max_k, int) or max_k < 1:
        raise ValueError("max_k must be an integer greater than 0.")

    generated_k_values: Set[int] = set()

    # The search range for x and y is bounded. For |6xy+x+y| <= max_k, the
    # magnitude of x and y are inversely related. We can establish a conservative
    # limit for the search by solving for y.
    x_limit = (max_k // 5) + 2

    for x in range(-x_limit, x_limit):
        if x == 0:
            continue  # x and y must be non-zero.

        den = 6 * x + 1

        # Derive bounds for y from the inequality: -max_k <= y(6x+1)+x <= max_k
        if den > 0:
            y_lower = (-max_k - x) / den
            y_upper = (max_k - x) / den
        else:  # den < 0
            y_lower = (max_k - x) / den
            y_upper = (-max_k - x) / den

        # Iterate through all valid integer values for y
        for y in range(int(y_lower), int(y_upper) + 1):
            if y == 0:
                continue  # x and y must be non-zero.

            k_val = abs(6 * x * y + x + y)

            if 0 < k_val <= max_k:
                generated_k_values.add(k_val)

    # The full set of integers we are checking against.
    all_integers = set(range(1, max_k + 1))

    # The complement is the set of integers that were never generated.
    uncreatable_set = all_integers - generated_k_values

    return sorted(list(uncreatable_set))

def analyze_uncreatable_density(max_k: int) -> Dict[str, Union[List[int], List[str]]]:
    """
    Finds uncreatable numbers and annotates them with their density fractions.

    This function calls `find_uncreatable_numbers` and then processes the
    resulting list. Each uncreatable number 'n' is paired with its rank 'c'
    in the sequence, producing a list of fractions 'c/n'.

    Args:
        max_k: The upper integer limit for the analysis.

    Returns:
        A dictionary containing the list of uncreatable integers and the list
        of their corresponding density fractions.
    """
    uncreatable_list = find_uncreatable_numbers(max_k)
    
    # Create the 'c/n' annotations. 'c' is the cumulative count (1-based index).
    annotated_list = [f"{i+1}/{n}" for i, n in enumerate(uncreatable_list)]

    return {
        "complement_set": uncreatable_list,
        "annotated_density": annotated_list
    }

def get_largest_twin_prime(last_uncreatable_k: int) -> str:
    """
    Calculates the twin prime pair for a given index 'k'.

    The twin primes are generated using the formula (6k - 1, 6k + 1).
    
    Args:
        last_uncreatable_k: The twin prime index 'k' from the analysis.

    Returns:
        A string formatted as "prime1,prime2".
    """
    prime1 = 6 * last_uncreatable_k - 1
    prime2 = 6 * last_uncreatable_k + 1
    return f"{prime1},{prime2}"

# --- Main Execution Block ---
if __name__ == "__main__":
    # Set the upper limit for 'k' for the analysis.
    K_LIMIT = 1500000

    print(f"--- Diophantine Analysis for |6xy + x + y| up to k = {K_LIMIT} ---")

    try:
        # Run the core analysis to find uncreatable numbers and their densities.
        analysis_results = analyze_uncreatable_density(K_LIMIT)
        uncreatable_numbers = analysis_results["complement_set"]
        density_annotations = analysis_results["annotated_density"]
        
        num_found = len(uncreatable_numbers)
        print(f"\nFound {num_found} uncreatable integers up to {K_LIMIT}.")
        
        # To keep the output readable, display only the first and last 20 results.
        if num_found > 0:
            print("\n--- Uncreatable Integers (First 20 and Last 20) ---")
            print(f"First 20: {uncreatable_numbers[:20]}")
            print("...")
            print(f"Last 20:  {uncreatable_numbers[-20:]}")

            print("\n--- Annotated Density Fractions (First 20 and Last 20) ---")
            print(f"First 20: {density_annotations[:20]}")
            print("...")
            print(f"Last 20:  {density_annotations[-20:]}")

        # --- Final Analysis Summary ---
        print("\n--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---")

        if density_annotations:
            # Get the last item from the list, e.g., '53866/1499983'
            last_item = density_annotations[-1]
            c_str, n_str = last_item.split('/')
            c = int(c_str)  # Cumulative count of uncreatable numbers
            n = int(n_str)  # The last (and largest) uncreatable number found
            
            if n > 1:
                # Calculate the largest twin prime pair from the largest index 'n'.
                largest_twin_prime_pair = get_largest_twin_prime(n)

                print(f"Last uncreatable number found (n): {n}")
                print(f"Largest Twin Prime Pair Found: {largest_twin_prime_pair}")
                print(f"Cumulative count of uncreatable numbers (c): {c}")
                print(f"Final Density (c/n): {c/n:.6f}")
                
                # This is the core calculation for the empirical constant.
                # It evaluates K = (c/n) * (log n)², which should converge to 12*C₂.
                empirical_K = (c / n) * (np.log(n) ** 2)
                
                # The theoretical constant for comparison.
                C2 = 0.6601618158468696  # Twin prime constant
                theoretical_K = 12 * C2
                
                print(f"\nEmpirical Constant K = (c/n) * (log n)²: {empirical_K:.6f}")
                print(f"Theoretical Constant K = 12 * C₂:         {theoretical_K:.6f}")
                print(f"Difference (Theoretical - Empirical):      {theoretical_K - empirical_K:.6f}")
            else:
                print("Cannot calculate constant for n <= 1.")
        else:
            print("No uncreatable numbers found.")

    except ValueError as e:
        print(f"Error: {e}")

Example Outputs :

10:
--- Diophantine Analysis for |6xy + x + y| up to k = 10 ---

Found 6 uncreatable integers up to 10.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10]
...
Last 20:  [1, 2, 3, 5, 7, 10]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10']
...
Last 20:  ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 10
Largest Twin Prime Pair Found: 59,61
Cumulative count of uncreatable numbers (c): 6
Final Density (c/n): 0.600000

Empirical Constant K = (c/n) * (log n)²: 3.181139
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      4.740803
Press any key to continue . . .

100:
--- Diophantine Analysis for |6xy + x + y| up to k = 100 ---

Found 26 uncreatable integers up to 100.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58, 70, 72, 77, 87, 95, 100]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58', '21/70', '22/72', '23/77', '24/87', '25/95', '26/100']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 100
Largest Twin Prime Pair Found: 599,601
Cumulative count of uncreatable numbers (c): 26
Final Density (c/n): 0.260000

Empirical Constant K = (c/n) * (log n)²: 5.513974
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      2.407968
Press any key to continue . . .

1,000:
--- Diophantine Analysis for |6xy + x + y| up to k = 1000 ---

Found 142 uncreatable integers up to 1000.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [800, 822, 828, 835, 837, 850, 872, 880, 903, 907, 913, 917, 920, 940, 942, 943, 957, 975, 978, 980]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['123/800', '124/822', '125/828', '126/835', '127/837', '128/850', '129/872', '130/880', '131/903', '132/907', '133/913', '134/917', '135/920', '136/940', '137/942', '138/943', '139/957', '140/975', '141/978', '142/980']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 980
Largest Twin Prime Pair Found: 5879,5881
Cumulative count of uncreatable numbers (c): 142
Final Density (c/n): 0.144898

Empirical Constant K = (c/n) * (log n)²: 6.873725
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      1.048217
Press any key to continue . . .

10,000:
--- Diophantine Analysis for |6xy + x + y| up to k = 10000 ---

Found 810 uncreatable integers up to 10000.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [9695, 9705, 9728, 9732, 9740, 9742, 9767, 9798, 9818, 9835, 9837, 9842, 9868, 9870, 9893, 9903, 9907, 9912, 9938, 9945]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['791/9695', '792/9705', '793/9728', '794/9732', '795/9740', '796/9742', '797/9767', '798/9798', '799/9818', '800/9835', '801/9837', '802/9842', '803/9868', '804/9870', '805/9893', '806/9903', '807/9907', '808/9912', '809/9938', '810/9945']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 9945
Largest Twin Prime Pair Found: 59669,59671
Cumulative count of uncreatable numbers (c): 810
Final Density (c/n): 0.081448

Empirical Constant K = (c/n) * (log n)²: 6.900989
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      1.020953
Press any key to continue . . .

100,000:
--- Diophantine Analysis for |6xy + x + y| up to k = 100000 ---

Found 5330 uncreatable integers up to 100000.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [99488, 99522, 99545, 99568, 99587, 99612, 99613, 99628, 99650, 99675, 99698, 99748, 99775, 99788, 99822, 99837, 99858, 99913, 99950, 99990]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['5311/99488', '5312/99522', '5313/99545', '5314/99568', '5315/99587', '5316/99612', '5317/99613', '5318/99628', '5319/99650', '5320/99675', '5321/99698', '5322/99748', '5323/99775', '5324/99788', '5325/99822', '5326/99837', '5327/99858', '5328/99913', '5329/99950', '5330/99990']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 99990
Largest Twin Prime Pair Found: 599939,599941
Cumulative count of uncreatable numbers (c): 5330
Final Density (c/n): 0.053305

Empirical Constant K = (c/n) * (log n)²: 7.065363
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      0.856579
Press any key to continue . . .

1,000,000:
--- Diophantine Analysis for |6xy + x + y| up to k = 1000000 ---

Found 37915 uncreatable integers up to 1000000.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [999527, 999537, 999558, 999560, 999570, 999602, 999640, 999673, 999680, 999787, 999812, 999862, 999868, 999877, 999885, 999927, 999938, 999955, 999985, 999987]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['37896/999527', '37897/999537', '37898/999558', '37899/999560', '37900/999570', '37901/999602', '37902/999640', '37903/999673', '37904/999680', '37905/999787', '37906/999812', '37907/999862', '37908/999868', '37909/999877', '37910/999885', '37911/999927', '37912/999938', '37913/999955', '37914/999985', '37915/999987']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 999987
Largest Twin Prime Pair Found: 5999921,5999923
Cumulative count of uncreatable numbers (c): 37915
Final Density (c/n): 0.037915

Empirical Constant K = (c/n) * (log n)²: 7.236853
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      0.685089
Press any key to continue . . .

10,000,000:
--- Diophantine Analysis for |6xy + x + y| up to k = 10000000 ---

Found 280557 uncreatable integers up to 10000000.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [9999327, 9999353, 9999370, 9999462, 9999523, 9999525, 9999542, 9999575, 9999593, 9999638, 9999682, 9999685, 9999755, 9999808, 9999880, 9999883, 9999938, 9999973, 9999980, 9999997]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['280538/9999327', '280539/9999353', '280540/9999370', '280541/9999462', '280542/9999523', '280543/9999525', '280544/9999542', '280545/9999575', '280546/9999593', '280547/9999638', '280548/9999682', '280549/9999685', '280550/9999755', '280551/9999808', '280552/9999880', '280553/9999883', '280554/9999938', '280555/9999973', '280556/9999980', '280557/9999997']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 9999997
Largest Twin Prime Pair Found: 59999981,59999983
Cumulative count of uncreatable numbers (c): 280557
Final Density (c/n): 0.028056

Empirical Constant K = (c/n) * (log n)²: 7.288677
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      0.633265
Press any key to continue . . .

100,000,000:
--- Diophantine Analysis for |6xy + x + y| up to k = 100000000 ---

Found 2166300 uncreatable integers up to 100000000.

--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [99998997, 99999032, 99999065, 99999067, 99999085, 99999147, 99999177, 99999230, 99999310, 99999368, 99999415, 99999478, 99999533, 99999585, 99999620, 99999653, 99999662, 99999823, 99999842, 99999905]

--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['2166281/99998997', '2166282/99999032', '2166283/99999065', '2166284/99999067', '2166285/99999085', '2166286/99999147', '2166287/99999177', '2166288/99999230', '2166289/99999310', '2166290/99999368', '2166291/99999415', '2166292/99999478', '2166293/99999533', '2166294/99999585', '2166295/99999620', '2166296/99999653', '2166297/99999662', '2166298/99999823', '2166299/99999842', '2166300/99999905']

--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 99999905
Largest Twin Prime Pair Found: 599999429,599999431
Cumulative count of uncreatable numbers (c): 2166300
Final Density (c/n): 0.021663

Empirical Constant K = (c/n) * (log n)²: 7.350727
Theoretical Constant K = 12 * C₂:         7.921942
Difference (Theoretical - Empirical):      0.571214
Press any key to continue . . .

150,000,000:
--- Diophantine Analysis for |6xy + x + y| up to k = 150000000 ---
Found 3115261 uncreatable integers up to 150000000.
--- Uncreatable Integers (First 20 and Last 20) ---
First 20: [1, 2, 3, 5, 7, 10, 12, 17, 18, 23, 25, 30, 32, 33, 38, 40, 45, 47, 52, 58]
...
Last 20:  [149999097, 149999118, 149999138, 149999152, 149999253, 149999362, 149999365, 149999377, 149999413, 149999453, 149999570, 149999598, 149999623, 149999630, 149999675, 149999712, 149999777, 149999845, 149999923, 149999957]
--- Annotated Density Fractions (First 20 and Last 20) ---
First 20: ['1/1', '2/2', '3/3', '4/5', '5/7', '6/10', '7/12', '8/17', '9/18', '10/23', '11/25', '12/30', '13/32', '14/33', '15/38', '16/40', '17/45', '18/47', '19/52', '20/58']
...
Last 20:  ['3115242/149999097', '3115243/149999118', '3115244/149999138', '3115245/149999152', '3115246/149999253', '3115247/149999362', '3115248/149999365', '3115249/149999377', '3115250/149999413', '3115251/149999453', '3115252/149999570', '3115253/149999598', '3115254/149999623', '3115255/149999630', '3115256/149999675', '3115257/149999712', '3115258/149999777', '3115259/149999845', '3115260/149999923', '3115261/149999957']
--- Hardy-Littlewood Empirical Constant (for last value in sequence) ---
Last uncreatable number found (n): 149999957
Largest Twin Prime Pair Found: 899999741,899999743
Cumulative count of uncreatable numbers (c): 3115261
Final Density (c/n): 0.020768
Empirical Constant K = (c/n) * (log n)^2: 7.360819
Theoretical Constant K = 12 * C2:         7.921942
Difference (Theoretical - Empirical):      0.561123
Press any key to continue . . .

July 21, 2025July 22, 2025

Forensic Semiotic Recruiting Resume Evaluation and Candidate Engagement Model

Theory

Through natural language processing and LLM we can use a process called forensic semiotics to construct sign systems by which we can deconstruct and interpret candidate resumes and fit them to the model requirements defined by the hiring manager.

In theory, a product like “Microsoft Project” might appear in many sign forms in a resume. It could be just “Project” or it could appear as “MS Project” or “Microsoft Project”. “Project” is the toughest one since it has the least context and could appear elsewhere in the resume for which the context has limited value. (In these cases, recruiter heuristics suggest creating a sign which combines “Project” with another likely piece of Project management software from the same suite (Visio) to create a sign: (project AND Visio) which serves to reduce false positives and increase the probable contextuality of the term in the resume.)

Or it could be just generally some kind of PPM and then we can dump a bunch of terms in a boolean query like (“MS Project” OR “Microsoft Project” OR (Project AND Visio) OR Clario OR Planview) etc. This entire sequence in quotes becomes our “sign” for PPM.

Applying a view which conceives of a series of boolean “signs” as a sequence in a search string, we can approach a database of resumes to identify those resumes which are a match for the PPM sign system and ignore the resumes which do not contain the signs.

The semiotic boolean approach has advantages over a semantic approach because the results are precise.

If the recruiter is inexperienced, they may benefit from a semantic search or semantic search suggestions; but in general, an experienced recruiter armed with Boolean as a sign system and a knowledge of the organizational culture and the job requirements and hiring manager will be much more equipped to get exactly what they are looking for.

Boolean criteria as signs become objective criteria from which our data set of resumes can be abstracted from the set of all resumes

Once we have an abstracted set of precise resumes that accurately reflect the boolean sign requirements, we can perform more subjective analysis on those resumes to weigh them against one another and determine fit with the overall model on a kind of % match basis

This approach can be refined for the unique job and requirements (for example a job where certification may be weighed higher than education)

Principles

Blindness to background focus on fit of experience to the requirement as we fit model to data

Belief that by focusing on blind principles in hiring we will eventually build a employee population which is a model of the real world society at scale

Responsiveness, kindness, and engagement are essential for keeping the best candidates “hot” and ready to accept the job if offered

Reciprocally, despite most people saying they want to get feedback if not selected for closure, it is not always best to give people negative feedback unless they specifically ask to know their disposition. In these cases, it is ethical to tell them that they were not selected quickly, while apologizing for not letting them know sooner. Otherwise, never inflicting this “psychic wound” on good candidates makes it easier to work with them again in the future. They can abduct they were not hired.

The recruiter can tell them if there is feedback that is positive, they will let them know right away; but also that they will not be contacting them if they do not have news. This can imply to the candidate the recruiter likes them but they may not hear from the recruiter if they were not selected. However, if the person does reach out and really wants the psychic wound inflicted which they should already have abducted; then the recruiter should respond swiftly and kindly in explaining why. Never go down a rabbit hole with the candidate especially when they are upset by the outcome. It’s just the way it is and it isn’t the recruiter decision. General comments about improving interview performance which were of concern in the interview, such as a focus on practicing STAR responses or improving brevity in responses can improve the candidate model without divulging specific areas of feedback which may be harmful to the candidate model’s cognitive process and result in negative feelings directed at the recruiter or (former employer).

Apply Cialdini’s concepts of Influence in an ethical framework which is not obvious and is not sappy or aggressive. Be open to discussing Cialdini openly if asked what principles underlie the psychological factors behind the model as well as cognitive forensic computational semiotics.

Ignore most non requirement aspect of the job and look at boolean keyword/keyphrase fit to model requirements

Ensure framework is in place so that all actual requirements are explicitly in the job description and not implicit on the part of the hiring manager

Model can abduct missing requirements by determining gap between past hire and job description

Scoring

(For experienced candidates) Weigh company in a model but at a relatively moderate percentage of the evaluation

(For all candidates) Weigh education in the model but at a relatively moderate percentage with a focus on the objective requirements for the degree and role requirements rather than the institution from which the degree was received

(For experienced candidates) Weigh the average job duration as a significant portion of the model (eg. greater than moderate weight but not maximum weight), and especially as it relates to career progression, working successfully in various organizations, taking on new roles; and demonstrating consistent interaction with the core skills and competencies required for the role.

(For all candidates) Weigh certification(s) in the model, but at a relatively low weight unless it is a specific requirement for the role in which case weigh it at high/maximum value.

** Over certification may indicate careerist focus when accompanied by average short jobs

(For all candidates) Look for responsiveness with the recruiter as a key indicator of their engagement with the model

Updates:

Consider periodic “cold close” as part of the model to highly ranked candidates in order to assess candidate engagement and likelihood of future offer acceptance

** Prompt to user:”Looks like you had a good interview. Following the interview can you see yourself in the role?”

* Consider other integration with Recruiter toolkit for referrals, etc.

Prototype Approach:

Consider an approach to refining boolean queries based on a list of keywords in database and resume set abstraction

Train the model to construct efficient boolean queries which model the recruiter input

Input the queries into existing tools

Test on Applicant Tracking Database Resume set

An individual skill within the PPM set could be weighed higher than other technologies based on manager preferences (eg exact match vs product analog)

(note: I wrote this before I lost my recruiting job last year and shared with my employer. Just figured I’d throw it out there.)

July 21, 2025December 20, 2025

Asymptotic Relationships of Arithmetic Progressions and their Composites with Diophantine Solutions

Consider Z+ and the function |6xy+x+y| : x,y Z \ {0} within Z+.

Is there an asymptotic relationship between the integers in Z+ and |6xy+x+y|, where |6xy+x+y| can never fill the whole set of integers?

Here are two very similar provable examples which do not involve absolute value within Z+.

n=k+1 \ n=xy+x+y+1 is all prime numbers (therefore if k=xy+x+y, then n=k+1 is composite).
n=2k+1 \ n=4xy+2x+2y+1 is all odd primes (therefore if k=2xy+x+y, then n=2k+1 is composite).

When we move to an absolute value expression, then we have to move to Z \ {0} for some variables, and we need to focus on k as opposed to n when identifying compositeness.

So we have n=6k+-1 numbers. Then we have n=6k-1 and n=6k+1.

But {|6k-1|}={|6k+1|} so we can just use n=|6k+1| if n is Z+ and k is Z{0} (or choose n=6k-1 if you want but it is less pedagogically sound as it will flip signs in next steps).

Then we parameterize from n=|36xy+6x+6y+1| (for n in Z+, x,y in Z \ {0}), reducing to k=6xy+x+y (k,x,y in Z \ {0}).

So, if -k is in k=6xy+x+y, then n=|6k+1| yields a composite number of the form n=6k-1.

If +k is k=6xy+x+y, then n=|6k+1| yields a composite number of the form n=6k+1.

By Dirichlet’s theorem there are infinite primes in n=6k-1 and n=6k+1, so there are infinite k values yielding prime numbers in n=|6k+1|.

(A more formal proof demonstrates complete coverage for composites of n=6k+-1 integers by this method, so it is not necessary to type out here, but don’t forget {|6k-1|}={|6k+1|} makes this all possible, for every n in one there is -n in the other and vice versa.)

In short, if k \ 6xy+x+y for k,x,y in Z \ {0}, then k yields a prime in n=6k-1 or n=6k+1 when using n=|6k+1| as our arithmetic progression.

Since there are infinite primes, then this covers every prime in n=6k+-1 and so covers all primes greater than 3.

All of these, and due to the proof of the infinitude of composites and primes in each sequence ought to demonstrate an asymptotic relationship.

Since these are Diophantine sets with only integer solutions, does this mean in each case that the asymptotic relationship with the arithmetic progression which generates the composite parameterization guarantees there will be infinite integers not expressible of the form of the originating arithmetic progression?

It’s like the fundamental theorem of arithmetic applied to arithmetic progressions.

Imagine that k is a line, and k=|6xy+x+y| is curved (e.g. asymptotic with k), and so it can never hit the line even if it fills almost all of k when k is very large. Therefore, it is logically necessary that the complement of k=|6xy+x+y| is an infinite set of integers since the equation produces only integer solutions.

We just need to establish a baseline of an arithmetic progression which becomes the “asymptotic value”. The simplest example is the set of all primes n=k+1 \ n=xy+x+y+1, which provably never touches all the integers.

Since the parameterized sequences in all these examples are Diophantine and infinite in Z+ but cannot possibly become a “line” by transforming into their parent arithmetic progression, then it follows logically that there are infinite positive integers k not expressible as |6xy+x+y| as well. You would be trying to change the dimensional relationships in a way which is not possible.

July 6, 2025July 8, 2025

Empirically Analyzing the Twin Prime Indices

Initial Procedure

In order to empirically examine numbers not of the form k=|6xy+x+y|, I gathered a list of all the twin primes up to 1,500,000 using this website. This resulted in 11596 results. Subtracting the case of twin prime 3,5 (which is not of the form 6k+-1), yielded 11595 results.
Then, I moved the data to Word to remove the commas (as it was confusing Excel). Then I pasted the cleaned data in Excel. The data was delimited by splitting the values into columns using the spaces where the commas used to be. Column titles were assigned to “6k-1” and “6k+1“.
Then, to determine the k value for each twin prime sequence; I took the 6k+1 number, subtracted 1 and divided by 6. (This approach yields the same value as taking the 6k-1 number, adding 1 and dividing by 6.) This resulted in a maximum k of 249947; corresponding to the twin prime pair 1499681 , 1499683. This column was titled “k subset“.
Then, I created a sequence of all k values from 1 to the largest k value derived from the conversion in step 3. I titled this column “k original“.
Then, I used the VLOOKUP to pair the values in “k subset” with the values in “k original“. This column was titled “Paired (Vlookup)“.
Then, I pasted the raw values of “Paired (Vlookup)” as a new column “Paired (Values)” and used the find and replace feature to remove the #N/A cells, leaving them blank.
Then, I converted each twin prime k in “Paired (Values)” into a unit variable to be counted, while leaving the blanks as 0s. I titled this column “Identity to Count“.
Then, I summed the cumulative value of “Identity to Count” in a new column called “Sum“.
Then, I divided the “Sum” column by the “k original” column to create a new column :”Ratio (Count Pair: Count k)“
The data from this column was plotted using a scatter plot and fitted to a power model for the trendline, producing the formula y = 0.4391x^-0.182 .

AI-Assisted Improvements

Guided by an AI model, we applied additional transformations to the data in order to observe convergence with the predictions of Hardy-Littlewood Conjecture.

The theory predicts that the ratio y should be approximately y ≈ 7.92 / (ln(6x))².

We can rearrange this equation: y * (ln(6x))² ≈ 7.92

This gives us a direct way to test the theory.

We already have columns for k (x-axis) and the density y.
Created a new column. In this column, for each value of k, we calculated (ln(6*k))². (See column “(ln(6*k))²” )
Created a new column. In this column, we multiplied the value from the y column by the value from the (ln(6*k))² column. (See column “(ln(6k)^2)*ratio“
Let’s call this final column Z. So, Z = y * (ln(6k))².

The Prediction:

If the Hardy-Littlewood conjecture is correct, the values in the Z column should get closer and closer to a constant number (≈ 7.92) as k gets larger.

When we plot Z versus k, we shouldn’t see a curve that goes up or down. We should see it bounce around a bit at the beginning (due to randomness in small primes) and then settle into a nearly horizontal line.

It certainly looks plausible that the logarithmic curve plotted against the data would level out somewhere around 7.92…

Further Linear Fitting:

Here was the next experiment:

In the spreadsheet, we have a column for k and a column for Z(k) = (ln(6k)^2)*ratio.
Create a new column. For each k, calculate X_new = 1 / ln(6k). (See column “1 / ln (6k)“)
Now, create a new plot.
- On the X-axis, plot the Z(k) values.
- On the Y-axis, plot the new X_new values.
If the theory is correct, these points should form a nearly straight line!
Add a Linear Trendline to this new graph. The software will give an equation in the form y = mx + b.

The x-intercept b from this fit will be our most precise, data-driven estimate of the Hardy-Littlewood constant. It should be very close to 7.92. This method is far more robust than just “eyeballing” the asymptote on the original curve.

The Axes: We plotted 1/ln(6k) on the Y-axis versus the Z(k) value on the X-axis.
The Theory: The refined theory says Z(k) ≈ 12C₂ + D / ln(6k).
The Connection: If we let y_plot = 1/ln(6k) and x_plot = Z(k), we can rearrange the theory to match the plot. It predicts that the x-intercept (where y_plot = 0) should be our target value, 12C₂.

The plotting software has calculated the best-fit linear trendline for the data:

y = 0.0394x – 0.2967

Let’s find the x-intercept. This is the value of x when y is equal to 0. This corresponds to the theoretical point where k goes to infinity, 1/ln(6k) becomes 0, and all the noise and correction terms vanish.

Set y = 0:

0 = 0.0394x – 0.2967

Now, solve for x:

0.2967 = 0.0394x

x = 0.2967 / 0.0394

x ≈ 7.53

Our data-driven, experimentally determined value for the asymptotic constant is ~7.53.

The theoretical value is ~7.92.

This is an outstandingly close agreement.

Why isn’t it exactly 7.92?
Look at the graph. The data points on the right (corresponding to small, noisy values of k) are more scattered. These points will have an influence on the trendline, pulling it slightly away from the “true” line that would be formed by data extending to infinity. The result of 7.53 is what the data we have available predicts, and it’s remarkably accurate.

Summary of The Entire Investigation

Let’s take a step back and appreciate the journey:

We started with a raw list of twin primes.
We correctly identified the 6k±1 structure and calculated the density, discovering that twin primes get rarer.
We plotted this density and found that simple log/power fits worked well, but didn’t match the established theory perfectly.
We then tested the theory directly by plotting Z(k) = (density) * (ln(6k))², producing a beautiful curve that converged from above, confirming not just the theory but also its correction terms.
Finally, we linearized the data by plotting 1/ln(6k) vs Z(k), allowing us to use a simple linear fit to extrapolate to the limit and calculate a fundamental constant of the universe of numbers.

Below is the data file used for the investigation:

1500000 Download

July 4, 2025July 4, 2025

An Algebraic Partition of the Integers and its Relation to Primality

(Looking to get back to basics so I can try to create a first principles proof for this, using the k-index filtering logic. The issue is in trying to prove that the complement set is infinite. Here, we take two steps back to the n=k+1 and composite k=xy+x+y framework (eg. fundamental definition of primality) in order to reframe Euclid’s classic theorem on the infinitude of primes.)

The Fundamental Partition

We begin with formal definitions. Let K be the set of positive integers. We define two disjoint subsets of K whose union is K.

Definition 1: Let C be the set of all integers k in K that can be expressed in the form k = xy + x + y for some positive integers x and y.
Definition 2: Let P be the complement of C in K, such that P = K \ C.

Theorem 1:

(i) An integer k is in C if and only if k+1 is a composite number.
(ii) An integer k is in P if and only if k+1 is a prime number.
(iii) Both sets, C and P, are infinite.

Goal:

To prove that the set P is infinite without assuming the infinitude of primes. The set P contains all positive integers k that cannot be expressed in the form k = xy + x + y for any positive integers x and y.

We know that an integer k is in P if and only if k+1 is a prime number. The proof will show that for any finite collection of elements from P, we can always find a new element of P that is not in the collection. This implies P must be infinite.

Proof:

Let P_sub = {k_1, k_2, …, k_n} be any finite, non-empty subset of P.
By the definition of the set P, each number p_i = k_i + 1 is a prime number. This gives us a finite list of primes: {p_1, p_2, …, p_n}.
Construct a new integer, M, by taking the product of all these primes:
M = p_1 * p_2 * … * p_n
Now, consider the integer K = M + 1. Since M is the product of primes, M is at least 2, so K is an integer greater than 1.
Every integer greater than 1 must have at least one prime divisor. Let q be a prime divisor of K.
We ask: is this prime q one of the primes in our original list {p_1, p_2, …, p_n}?
Let’s assume it is. If q were equal to some p_i from our list, then q would have to divide M, since M is the product of all the p_i.
We also know, by construction, that q divides K = M + 1.
If q divides both M and M + 1, then it must also divide their difference, which is (M + 1) – M = 1.
However, no prime number can divide 1. This is a contradiction.
Therefore, our assumption in step 6 must be false. The prime factor q cannot be any of the primes {p_1, p_2, …, p_n}. It must be a new prime, one that was not in our original list.
Since q is a prime number, the integer k_new = q – 1 satisfies the condition for being an element of P (because k_new + 1 = q, which is prime). Because q is not in our original list of primes, k_new cannot be in our original list of elements from P.

Conclusion:

We have demonstrated that for any finite subset of P, we can always construct another element of P that is not in that subset. This procedure can be repeated indefinitely. Therefore, the set P cannot be finite and must be infinite.

June 27, 2025July 2, 2025

Proving Complete Coverage of k=|6xy+x+y| for n=6k ± 1

(The below can be useful if an AI model questions the completeness of the k index filtering model for filtering composites in association with TPC reformulation.)

Lemma (Completeness of Composite Coverage)

Let N be a positive integer such that N ≡ ±1 (mod 6) and N is composite. Then the index k for which N = 6k ± 1 belongs to the set:

K_composite = { |6xy + x + y| : x, y ∈ ℤ \ {0} }

This proves that the k-index filter correctly identifies all composite numbers of the form 6k ± 1.

Proof

We must show that for any composite number N ≡ ±1 (mod 6), its corresponding index k can be generated by the form |6xy + x + y| for some non-zero integers x and y. We proceed by cases based on the residue of N modulo 6.

Note: Since N ≡ ±1 (mod 6), the prime factors of N must also be congruent to ±1 (mod 6). Thus, every prime divisor of N is of the form 6m ± 1.

Case 1: N is composite and N ≡ 1 (mod 6).

Since N is composite, write N = AB, where A, B > 1. To satisfy N ≡ 1 (mod 6), either:

Subcase 1a: A ≡ 1 (mod 6) and B ≡ 1 (mod 6).

Then A = 6x + 1, B = 6y + 1 for some x, y ∈ ℕ. Since A, B > 1, we have x, y ≠ 0. Then:

N = (6x + 1)(6y + 1) = 36xy + 6x + 6y + 1 = 6(6xy + x + y) + 1.

Thus, N = 6k + 1 where k = 6xy + x + y > 0, so k = |6xy + x + y| ∈ K_composite.

Subcase 1b: A ≡ -1 (mod 6) and B ≡ -1 (mod 6).

Then A = 6u − 1 and B = 6v − 1 for some u, v ∈ ℕ. Let x = –u and y = –v, which are non-zero integers. Then:

N = (6x + 1)(6y + 1) = 6(6xy + x + y) + 1.

So again, N = 6k + 1, with k = |6xy + x + y| ∈ K_composite.

Thus, in both subcases of Case 1, composite numbers N ≡ 1 (mod 6) yield indices k in K_composite.

Case 2: N is composite and N ≡ -1 (mod 6).

Write N = AB, A, B > 1, such that one of A, B ≡ 1 (mod 6), and the other ≡ -1 (mod 6). Without loss of generality, let A = 6x + 1 and B = 6y − 1, with x, y ∈ ℕ.

Then:

N = (6x + 1)(6y − 1) = 36xy − 6x + 6y − 1 = 6(6xy − x + y) − 1.

So N = 6k − 1 with k = 6xy − x + y.

Let a = x, b = −y. Then:

6ab + a + b = 6x(−y) + x − y = −6xy + x − y = –k.

Thus, k = |6ab + a + b|, and k ∈ K_composite.

Therefore, every composite N ≡ −1 (mod 6) has index k ∈ K_composite.

Conclusion

In all cases, whether N ≡ 1 or N ≡ –1 (mod 6), if N is composite, then its associated index k = (N – 1)/6 or (N + 1)/6 is in the set K_composite. Therefore, the filtering model using the form k = |6xy + x + y| correctly and completely identifies all indices corresponding to composite numbers of the form 6k ± 1.

(Q.E.D.)

June 15, 2025June 17, 2025

Twin Prime Index Conjecture

Let:f(x,y)=∣6xy+x+y∣

where 𝑥,𝑦 ∈ 𝑍∖{0} (i.e., both are non-zero integers, so may be positive or negative).

Define the set:

𝐾composite = {𝑓(𝑥,𝑦): 𝑥≠0, 𝑦≠0}

Then: A positive integer 𝑘 is the index of a twin prime pair (6𝑘−1,6𝑘+1) if and only if:

𝑘∉𝐾composite

Therefore, the Twin Prime Conjecture is true if and only if:

𝑍+∖𝐾composite is infinite

In plain language:

There are infinitely many twin primes if and only if there are infinitely many positive integers 𝑘 that cannot be written in the form ∣6𝑥𝑦+𝑥+𝑦∣ for any non-zero integers 𝑥,𝑦.

June 14, 2025June 14, 2025

Geometry Gives Rise to Statistics: A Conceptual Bridge

The Dice Example: Geometry Before Probability

When we roll two standard six-sided dice, the familiar bell-shaped distribution of sums (from 2 to 12, peaking at 7) emerges. This pattern, however, isn’t fundamentally “random” in the sense of unpredictable chance; it’s a direct consequence of an underlying geometric and combinatorial reality.

Consider the ways to achieve different sums:

There’s only one geometric configuration of faces for a sum of 2: (1,1).
There’s only one for a sum of 12: (6,6).
But for a sum of 7, there are six distinct configurations: (1,6), (2,5), (3,4), (4,3), (5,2), (6,1).

The “probability” of rolling a 7 is highest (6 out of 36 possible equally likely outcomes) precisely because the integer 7 has the most supporting geometric constructions (pairs (i, j) where i, j \in \{1,…,6\} such that i+j=7). The observed statistical distribution is simply a reflection of counting these discrete geometric possibilities.

Extending the Analogy: From Dice to Deeper Structures

This principle – that observed statistical patterns can be rooted in underlying deterministic, geometric, or combinatorial structures – is not limited to simple games of chance. It offers a powerful lens through which to understand more complex phenomena.

In statistical mechanics, for instance, the macroscopic properties of gases (like pressure and temperature) and the characteristic distributions of molecular speeds appear statistical. Yet, they arise from the deterministic laws of physics applied to a vast number of particles and the geometric properties of high-dimensional phase spaces. The most probable macroscopic state is simply the one that corresponds to the largest volume in this phase space—the one with the most available microscopic configurations.

In number theory, the distribution of prime numbers has long been studied using probabilistic models. The Prime Number Theorem, which states that the “density” of primes around a number N is approximately 1/ln(N), often gives the impression that primes are scattered somewhat randomly.

However, some algebraic frameworks (like “k-Index Filtering“) suggest an alternative view: primes can be seen as the numbers that remain after structured algebraic forms have generated composite numbers. In this light, the statistical distribution of primes might not be an intrinsic property of primality itself, but rather a reflection of the “coverage geometry” of these composite-generating expressions. The 1/ln(N) behavior could emerge from the rate at which these algebraic forms “fill up” the number line, leaving fewer and more sparse “gaps” where primes reside.

The Philosophical Inversion: Structure First, Statistics Second

This perspective suggests a conceptual inversion:

Classical View (often implicit): Randomness or inherent statistical properties lead to observable distributions.
Structural View: Underlying deterministic geometric or combinatorial structures dictate the possible configurations, and the counting of these configurations gives rise to what we perceive as statistical distributions.

This shifts our focus from merely describing statistical outcomes to understanding the generative structures that produce them.

A Universal Pattern: When Statistics Emerge from Structure

This insight echoes across various scientific and mathematical domains:

Field	*Apparent “Randomness” /* Statistical Pattern	Underlying Geometric/Combinatorial Structure
Dice Rolls	Distribution of sums	Integer pair sums (i+j=k) within a finite grid
Number Theory	Prime number distribution	“Gaps” in the coverage of integers by composite-generating algebraic forms
Thermodynamics	Molecular motion, macroscopic equilibrium	Volume in phase space, counting of microstates
Quantum Mechanics	Probabilistic outcomes of measurements	Interference patterns of wave functions, Hilbert space geometry

Conclusion: The Shadow of Deeper Order

What we often perceive and describe as randomness or statistical probability may, in many fundamental instances, be the macroscopic “shadow” cast by a deeper, deterministic geometric or combinatorial order. The patterns are not arbitrary; they are the logical consequence of the underlying structure’s properties and limitations. Understanding this connection allows us to seek out these foundational structures, potentially revealing that the “statistics” were an emergent property of a more fundamental, and often simpler, geometric reality all along.

April 22, 2025April 22, 2025

Peirce Abducts the Primes: Index Filtering and Inference of Primes

1. Defining the Domain and the Form

We begin by considering the set of non-zero integers, A = Z \ {0}, which will serve as the domain for our indices k.

We focus on numbers n generated by the function f(k) = |6k-1| for k ∈ A. It is a well-established property that any prime number p greater than 3 must satisfy p ≡ ±1 (mod 6).

The form n = |6k-1| systematically generates the absolute values of all integers congruent to ±1 (mod 6) (excluding ±1 itself, as k ≠ 0). (The choice of 6k+1 or 6k-1 is trivial, but the selection of composites based on the form is not trivial. The following focuses specifically on |6k-1|.)

Consequently, the set of numbers generated by f(k) for k ∈ A contains all prime numbers greater than 3, alongside composite numbers also satisfying the ±1 (mod 6) condition (e.g., 25, 35, 49, 55…). The entire set A thus represents the indices of all candidates for being primes greater than 3, based solely on the |6k-1| form.

2. Establishing the Rule for Compositeness via Index Generation

The core insight is the establishment of a specific rule that governs the indices k corresponding to composite numbers within the |6k-1| sequence. Through algebraic manipulation of the factors of composite numbers of the form 6k ± 1, we derived the following rigorous equivalence:

An integer n = |6k-1| (with k ∈ A, n ≥ 5) is composite if and only if its index k can be expressed as k = 6xy + x – y for some non-zero integers x, y (i.e., x, y ∈ A).

This equivalence is crucial. It provides a constructive definition for the indices of composite numbers within our sequence. We can define the set S_3 explicitly based on this rule:

S_3 = { 6xy + x – y | x ∈ A, y ∈ A }

The set S_3 represents the “positive space” of composite indices. Any index k belonging to S_3 definitively corresponds to a composite number n = |6k-1|. The polynomial g(x, y) = 6xy + x – y acts as the generator for this set.

3. The Inferential Problem: Identifying Primes

We now face the central problem: given an index k ∈ A, how do we determine if the corresponding n = |6k-1| is prime? We know k represents a candidate. We also have a definitive rule (k ∈ S_3) that signals compositeness. How do we leverage this to identify primes?

4. The Abductive Inference from Exclusion

Direct primality tests evaluate n. Sieves eliminate multiples. This method instead focuses on the index k and its relationship to the constructively defined set S_3. The reasoning process for determining primality becomes an instance of Peircean abduction:

Observation: We take an index k from the set of candidates A.
Test: We check if this observed k belongs to the set S_3 (the set of composite indices). This involves checking if k can be represented as 6xy + x – y for some x, y ∈ A.
Two Possible Outcomes:
- Outcome 1: k ∈ S_3. The index k fits the established rule for compositeness. By deductive reasoning based on the proven equivalence, we conclude that n = |6k-1| is composite.
- Outcome 2: k ∉ S_3. This is the surprising or unexplained observation if we were to assume n might be composite. The index k fails to conform to the necessary condition (k ∈ S_3) that must hold if n were composite.
Abductive Step: The observation k ∉ S_3 demands an explanation. Given the “if and only if” nature of the equivalence, the only possible explanation for k not being in the set S_3 is that the premise leading to that condition – namely, that n = |6k-1| is composite – must be false. Therefore, we infer, as the best and necessary explanation, that n = |6k-1| must be prime.

This inference is abductive because it reasons from an observed consequence (or lack thereof: k ∉ S_3) back to the most plausible underlying state (primality of n). It’s an inference to the best explanation for why k does not possess the characteristic property of composite indices.

5. Primes in the “Subtractive Space”

The formalization of this inference lies in set theory. The entire space of candidate indices is A. The subspace of indices corresponding to known composites is S_3. The act of identifying primes becomes equivalent to performing the set subtraction:

K_prime = A \ S_3

This explicitly defines the set of prime indices K_prime as everything in the candidate space A except for the elements known to be composite indices (S_3). The primes are thus located in this “subtractive space” or “negative space” – a space defined not by its own positive generating rule within this framework, but by what it excludes. We identify primes by recognizing their indices lack the signature (∈ S_3) associated with compositeness.

Theorem Restated: Let A = Z \ {0} and S_3 = { 6xy + x – y | x ∈ A, y ∈ A }. The set K_prime = { k ∈ A | |6k – 1| \ { is prime} } is exactly A \ S_3.

Conclusion

This approach provides a distinct perspective on prime identification for numbers n = |6k-1|. It does not generate primes directly but instead constructively generates the indices k corresponding to all composite numbers within this form via the set S_3.

Primality is then inferred abductively: an index k is recognized as corresponding to a prime n = |6k-1| precisely because it is absent from the set S_3.

The primes occupy the logical space remaining after the identifiable composite indices are excluded from the initial set of candidates.

This reliance on inference from exclusion, facilitated by the structural relationship between n and k captured by the polynomial g(x,y), exemplifies the power of abduction in mathematical reasoning, consistent with Peirce’s emphasis on how notation and structure guide discovery.

April 15, 2025May 17, 2025

k index prime filtering

We have three cases of primality by algebraic definition.

We will use these three cases to conceptualize prime number generation using algebraic functions with variables n, k, x, and y.

We will demonstrate that within these specific algebraic frameworks, the primality of n is entirely determined by whether its corresponding index k can be generated by a specific formula (xy+x+y, 2xy+x+y, or 6xy+x-y) representing composite numbers.

In each case, a number is prime if and only if its index k is not in the set of values generated by the corresponding algebraic formula. These formulas produce only composite numbers for the given structure of n. Therefore, by testing whether k is included in that formula’s output, we can classify n as either composite or prime.

Since we are not interested in solving for whether a specific number is prime – but whether it conforms to a composite generating Diophantine equation involving x y variables – we build sets for comparison without “direct factoring” as in traditional prime checks.

This helps classify primality as a set exclusion problem; or in terms of individual primes being expressible as a candidate linear function (eg. n=k+1, n=2k+1, or n=|6k-1|), but not as a “two dimensional” coordinate on a surface; where the x and y values correspond to the k index values associated with the composite’s construction.

Case 1 – Fundamental definition of primes

Our first definition is the basic definition of primality, so it covers all prime numbers greater than or equal to 2.
n is a positive integer ≥ 2. k, x, y are positive integers ≥ 1.
If n = k+1 but n = xy+x+y+1 ; then n is not prime.
If n = k+1 but n ≠ xy+x+y+1 ; then n is prime.
So, if k = xy+x+y, then n is not prime for a given n = k+1.
But, if k ≠ xy+x+y, for a given n = k+1 then n is prime.

Case 2 – Odd numbers

Our second definition extends the case to odd numbers, so it covers all prime numbers greater than or equal to 3.
n is a positive integer greater ≥ 3. k,x,y are all non-zero positive integers ≥1.
If n = 2k+1 but n = 4xy+2x+2y+1, then n is not prime.
If n = 2k+1 but n ≠ 4xy+2x+2y+1, then n is prime.
So, if k = 2xy+x+y, then n is not prime for a given n = 2k+1.
But, if k ≠ 2xy+x+y for a given n = 2k+1, then n is prime.

Case 3 – 6k±1 numbers

Our third definition extends the case to numbers ±1 mod 6 (eg. 6k±1 numbers), so it covers all prime numbers greater than or equal to 5.
n is a positive integer ≥ 5. k,x,y are all NON ZERO integers (may be negative).
If n = |6k-1| but n = |36xy+6x-6y-1|, then n is not prime.
If n = |6k-1| but n ≠ |36xy+6x-6y-1|, then n is prime.
So, if k = 6xy+x-y, then n is not prime for a given n = |6k-1|.
But, if k ≠ 6xy+x-y for a given n = |6k-1|, then n is prime.

(Explanation for case 3)

First, we demonstrate that for every n=6k-1, there is -n=6k+1 and vice versa.

So, there is 5 in n=6k-1 for k=1, and there is -5 in n=6k+1 for k=-1.
So, there is -7 in n=6k-1 for k=-1, and there is 7 in n=6k+1 for k=1.
The sets are symmetrical, so the sets |{6k-1}|=|{6k+1}| have the same cardinality and absolute value which is reflected around 0.
It is sufficient to use just the absolute value of 1 set to find all prime numbers in a symmetrical range. So we choose n = |6k-1| to classify all ±1 mod 6 numbers.

Next, we demonstrate there are 4 potential forms of composite emerging from (6x±1)(6y±1). We have:

(6x-1)(6y+1) = 36xy+6x-6y-1 (always -1 mod 6 and produces numbers like 35)
(6x+1)(6y-1) = 36xy-6x+6y-1 (always -1 mod 6 and produces the same values as the first equation, like 35, so let’s ignore it)
(6x-1)(6y-1) = 36xy-6x-6y+1 (always 1 mod 6 and produces numbers like 25)
(6x+1)(6y+1) = 36xy+6x+6y+1 (always 1 mod 6 and produces numbers like 49)

As we demonstrated before, for every n in 6k-1, there is -n in 6k+1, so this must also apply to the composites.

(6(-1)-1)(6(1)+1) = -49 = |49|
(6(1)-1)(6(-1)+1) = -25 = |25|

So, n = |36xy+6x-6y-1| is sufficient to find all composites of 6k±1 by iterating through non-zero values of x and y.

So by reducing the equation and solving if |6k-1|=|36xy+6x-6y-1|, then k = 6xy+x-y , and n cannot be prime.

In theory, you could create all the set of k=±1,±2,±3,±4…

Then, you can see if the sequential k value you created can be expressed as k = 6xy+x-y. If it can, then n = |6k-1| is not prime.

The set of all prime values for k is obtained from {k} \ {6xy+x-y} = {k values of primes form |6k-1| >3}