1. Summary
This document provides a technical overview of a new computational framework for analyzing the Twin Prime Conjecture extending from our previous computational analyses (see 1,2,3,4,5,6,7,8,9).
As before, the conjecture is reformulated as a problem of Diophantine completeness in an index space, k. Here, we define a “Creatable Universe” as the set of integer indices k that correspond to composite number pairs of the form (6k-1, 6k+1), generated by the Diophantine equation k = |6xy+x+y|.
Formally, the “Twin Prime Index Conjecture” is stated as:
- 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 𝑥,𝑦.
In order to formalize and visualize this perspective of an “Uncreatable Universe” based on fundamental dimensional differences between k and |6xy+x+y|, in line with our Diophantine hypothesis of infinitely many “uncreatable” index integers k leading to infinite complement sets (eg. infinite primes of the form n=k+1 for k\xy+x+y and infinite twin prime indices of the form n=6k-1,n+2=6k+1 for k\|6xy+x+y|), we introduce a new metric, “Creation Complexity,” to quantify the simplest generation method for any creatable k index |6xy+x+y|.
Using a high-performance computational model, we analyze the structure of the Creatable Universe. This analysis yields precise mathematical models for three key boundaries of this set: the floor, the median, and the ceiling.
The distinct power-law exponents derived for these boundaries provide a quantitative measure of the set’s divergent nature. Notable findings include that the exponent for the median complexity does not converge to the simplified theoretical value of 0.5 as expected, but to an apparently stable constant β_med ≈ 0.519, revealing a subtle structural bias in the Diophantine set. This provides strong empirical evidence that the Uncreatable Universe is infinite.
2. The Diophantine Hypothesis: “Curve vs. Line”
It follows from the observation and intuition that the set of all primes is equivalent to the inability of the Diophantine equation n=xy+x+y+1 to cover the arithmetic progression n=k+1 in n space, meaning that any k not expressible as k=xy+x+y produces a prime number in n=k+1.
This is a perfect example of a Diophantine set with density 1 which has an infinite complement of density 0 (the primes).
When we extend this idea to k=|6xy+x+y|, then we also expect to the dimensional mismatch, and k=|6xy+x+y| being fundamentally unable to cover all values of k(+1):
- “The Line”: The set of all positive integers k, ℤ+, is a fundamental, one-dimensional object, analogous to a simple line or ray.
- “The Curve”: The set of creatable indices, K_composite = { |6xy+x+y| : x, y ∈ ℤ \ {0} }, is generated by a two-variable Diophantine equation. This set is fundamentally a two-dimensional object—a surface projected onto the one-dimensional line of integers.
- The Asymptotic Relationship: As k grows, the density of the “curve” approaches that of the “line,” but it can never achieve perfect coverage. The dimensional mismatch ensures that the “curve” and the “line” are asymptotically related but can never merge. Because the solutions must be integers, the gaps between them cannot be infinitesimal.
- The Conclusion: Therefore, it is a structural necessity that the complement set—the Uncreatable Universe—must be infinite.
This new module is the visualization and quantification of this “curve vs. line” argument.
2.1. Validation of the Diophantine Reformulation
Before analyzing the structure of the Creatable Universe, it was necessary to first validate the core premise of the Twin Prime Index Conjecture. This was accomplished by comparing the outputs of two computationally independent high-performance analyzers up to a limit of k = 1,000,000,000:
- A Brute-Force Analyzer: This script directly generates the set K_composite = {|6xy+x+y|} and identifies its complement.
- A Sieve of Eratosthenes Analyzer: This script first finds all twin primes of the form (6k-1, 6k+1) and then extracts their indices k.
| Metric | Brute-Force Method (v3.0) | Sieve of Eratosthenes (SoE) | Result |
| Integers Found | 17,244,408 | 17,244,408 | Identical |
| Last Integer n | 999,999,975 | 999,999,975 | Identical |
| Last Twin Prime Pair | 5999999849, 5999999851 | 5999999849, 5999999851 | Identical |
This perfect correspondence provides the essential empirical foundation for this work. It validates that the set of integers not expressible by k = |6xy + x + y| is, for all practical purposes, the set of indices that generate twin primes. This allows us to use the Diophantine equation as a direct and complete tool for analyzing the structure of twin primes.
(A complete proof of the coverage of the sieve can be found here.)
3. Formal Definitions
The analysis is conducted in k-space, the set of positive integer indices k.
Before proceeding, it important to understand the distinction between the infinite set of positive integers in “n space”, and the infinite set of integers in “k space” as they relate to our exploration of twin primes.
We can consider “n space” as the chaotic realm where primes look like events of chance, and “k space” as the perfectly ordered world where algebraic structure of the k+1 sequence (the densest possible arithmetic progression which contains all primes in n space) reveals quite obvious deterministic laws governing the emergence of twin primes from k space.
| k Range: k>=10 | n Range: (k*6)+1 | No of Primes Less than or Equal to n in Range | No of Twin Prime Pairs (6k-1,6k+1) Less than or Equal to n in Range |
| 10 | 61 | 18 | 6 |
| 100 | 601 | 110 | 26 |
| 1,000 | 6,001 | 783 | 142 |
| 10,000 | 60,001 | 6,057 | 810 |
| 100,000 | 600,001 | 49,098 | 5,330 |
| 1,000,000 | 6,000,001 | 412,849 | 37,915 |
| 10,000,000 | 60,000,001 | 3,562,115 | 280,557 |
| 100,000,000 | 600,000,001 | 31,324,704 | 2,166,300 |
| 1,000,000,000 | 6,000,000,001 | 279,545,369 | 17,244,408 |
| 10,000,000,000 | 60,000,000,001 | 2,524,038,155 | 140,494,396 |
| 100,000,000,000 | 600,000,000,001 | 23,007,501,786 | 1,166,916,932 |
Within this space, we define two mutually exclusive and exhaustive sets:
- The Creatable Universe (K_composite): An index k is defined as “creatable” if it is an element of the set:
K_composite = { |6xy + x + y| : x, y ∈ ℤ \ {0} }
This set corresponds to all indices k for which at least one member of the pair (6k-1, 6k+1) is composite. - The Uncreatable Universe (K_u): An index k is defined as “uncreatable” if it is an element of the complement set, K_u = ℤ+ \ K_composite. This set corresponds to all indices k for which both members of the pair (6k-1, 6k+1) are prime. The Twin Prime Conjecture is equivalent to the statement that K_u is an infinite set.
To analyze the structure of K_composite, we define the following metric:
- Creation Complexity (C): For any k ∈ K_composite, its Creation Complexity C is the minimum possible value of |x| + |y| over all non-zero integer pairs (x, y) that satisfy k = |6xy + x + y|. C is a measure of the smallest integer inputs required to generate k.
4. Computational Methodology
The analysis is performed by a high-performance Python script utilizing a Forward Generation Sieve.
- A NumPy array, complexity_map, of size k_limit + 1 is initialized with a value of infinity. This map stores the minimum C found for each index k.
- The script iterates through a bounded search space of (x, y) pairs.
- For each pair, it calculates k = |6xy+x+y| and C = |x|+|y|.
- If k ≤ k_limit and C < complexity_map[k], the map is updated: complexity_map[k] = C.
- After the sieve is complete, the complexity_map contains the definitive Creation Complexity for every k ∈ K_composite up to the limit. Indices that remain at infinity are members of K_u.
This method is computationally efficient and allows for analysis of large k limits. Further parallelization is possible.
5. Analytical Models of the Boundaries
From the generated complexity_map, we derive quantitative models for the three key boundaries of the Creatable Universe.
- Model: C_floor(k) = 2, for k ≥ 4.
- Significance: This model establishes a permanent, fixed separation between the Uncreatable Universe (which can be conceptualized at C=0) and the Creatable Universe.
- Note that the graphical model allows the user to “zoom in” on any part of the k+1 line at 0 to also reveal the precise location of twin prime indices. (At large scales, these magenta points tend to appear to blur together, but this is a misleading view since they are actually quite sparse in k and have asymptotic density 0. This suggests another interesting philosophical discussion on the tradeoffs of visualizing data at scale, perhaps for another time.) Here, we show small values of k (100) to visualize this concept.
The “Median Boundary” (blue line) is the cumulative median of the Creation Complexity. It models the behavior of the “typical” creatable index.
- Model: C_median(k) ≈ α_med * k^β_med
- Significance—A Refined Understanding: A naive model based solely on the dominant 6xy term of the Diophantine equation predicts that the most efficient creation method would yield an exponent of exactly β=0.5 (a square root relationship). However, our high-precision computational data reveals this is not the case. The exponent β_med rapidly converges to a stable value of ≈ 0.519, a value consistently greater than 0.5. This is a significant finding. It indicates that the lower-order +x+y terms introduce a permanent, structural bias into the integer lattice of solutions. This bias slightly favors non-perfectly-balanced (x, y) pairs, causing the complexity of the typical creatable index to grow at a rate slightly faster than a pure square root. The value β_med ≈ 0.519 appears to be related to a fundamental constant that precisely characterizes the asymptotic geometry of this specific Diophantine system.
The “Ceiling” (red line) is the cumulative maximum of the Creation Complexity, modeling the “hardest-to-create” indices.
- Model: C_ceil(k) ≈ α_ceil * k^β_ceil
- Significance: The exponent β_ceil, termed the “Divergence Exponent,” is consistently found to be ≈ 1.0. This indicates that the maximum complexity grows at a rate that is nearly linear with k, consistent with a simplified model where one variable is held constant (e.g., y=1), leading to k ≈ |7x+1|.
6. Conclusion and Interpretation
The three-boundary analysis provides a complete, quantitative description of the structure of the Creatable Universe. The system is characterized by three key facts:
- It is bounded from below by a fixed constant (C=2).
- Its “center of mass” (the median) grows at a rate slightly faster than a square root, governed by a newly identified constant exponent β_med ≈ 0.519.
- Its upper boundary grows rapidly, at a rate nearly linear with k (β_ceil ≈ 1.0).
The fact that β_ceil > β_med provides a definitive, quantitative proof that the structure is “stretching,” with its ceiling pulling away from its median. This multi-layered divergent behavior, combined with the permanent chasm at the floor, provides strong, data-driven, structural evidence that the Creatable Universe is incapable of achieving completeness. The Uncreatable Universe appears to be a necessary and infinite consequence of this subtle and complex structure.
As a demonstration at linear scales, the curves appear to become increasingly parallel to the green line, but continue to diverge and never actually become flat — providing a visualization of the intuition that twin primes must be infinite based on these dimensional relationships related to the deterministic, structural constraints of k not expressible as |6xy+x+y|.
Code:
"""
“Creatable Universe Modeler”
This script provides a comprehensive quantitative analysis and
visualization of the "Creatable Universe" framework. The script runs in an
interactive loop, allowing for multiple analyses without restarting.
"""
import matplotlib.pyplot as plt
import matplotlib.ticker as mticker
import numpy as np
import pandas as pd
import time
from sklearn.linear_model import LinearRegression
from sklearn.metrics import r2_score
def generate_complexity_map_fast(k_limit: int) -> np.ndarray:
"""
Uses a fast, forward-generation sieve to find the minimum creation
complexity C = |x|+|y| for every creatable integer k.
"""
complexity_map = np.full(k_limit + 1, np.inf, dtype=float)
x_limit = (k_limit // 5) + 2
print("Generating the map of the Creatable Universe...")
last_update_time = time.time()
for x in range(-x_limit, x_limit + 1):
current_time = time.time()
if current_time - last_update_time > 1.0:
print(f"\rProcessing generator x = {x}/{x_limit}...", end="")
last_update_time = current_time
if x == 0: continue
den = 6 * x + 1
if den == 0: continue
y_lower = (-k_limit - x) / den
y_upper = (k_limit - x) / den
for y in range(int(min(y_lower, y_upper)), int(max(y_lower, y_upper)) + 2):
if y == 0: continue
k = abs(6 * x * y + x + y)
if 0 < k <= k_limit:
complexity = abs(x) + abs(y)
if complexity < complexity_map[k]:
complexity_map[k] = complexity
print("\nMap of the Creatable Universe generated.")
return complexity_map
def perform_power_law_regression(series: pd.Series):
""" Performs a power-law regression on a given data series. """
valid_data = series.dropna()
k_values = valid_data.index.to_numpy() + 1
c_values = valid_data.to_numpy()
mask = (k_values > 10) & (c_values > 1)
if np.sum(mask) < 20: return None
log_k = np.log(k_values[mask]).reshape(-1, 1)
log_c = np.log(c_values[mask])
model = LinearRegression().fit(log_k, log_c)
beta = model.coef_[0]
alpha = np.exp(model.intercept_)
r_squared = r2_score(log_c, model.predict(log_k))
return { "alpha": alpha, "beta": beta, "r_squared": r_squared }
def analyze_and_plot(complexity_map: np.ndarray, k_limit: int, scale='linear'):
""" Analyzes all three boundaries and plots the definitive visualization. """
k_values = np.arange(1, k_limit + 1)
# --- Data Preparation ---
is_creatable = complexity_map[1:] != np.inf
creatable_k = k_values[is_creatable]
creatable_c = complexity_map[1:][is_creatable]
uncreatable_k = k_values[~is_creatable]
num_uncreatable = len(uncreatable_k)
num_creatable = len(creatable_k)
creatable_series = pd.Series(complexity_map[1:])
creatable_series.replace(np.inf, np.nan, inplace=True)
# --- Analytical Component ---
floor_of_creation = creatable_series.cummin()
median_of_creation = creatable_series.expanding().median()
ceiling_of_creation = creatable_series.cummax()
median_model_results = perform_power_law_regression(median_of_creation)
ceiling_model_results = perform_power_law_regression(ceiling_of_creation)
# --- Print Analytical Summary ---
print("\n" + "="*70)
print(f" THREE-BOUNDARY ANALYTICAL MODELS (k = {k_limit:,})")
print("="*70)
print(f"\n--- Data Summary ---")
print(f"Found {num_creatable:,} creatable indices.")
print(f"Found {num_uncreatable:,} uncreatable indices.")
if num_uncreatable > 40:
print(f"First 20 Uncreatable: {uncreatable_k[:20]}")
print(f"Last 20 Uncreatable: {uncreatable_k[-20:]}")
floor_model_val = floor_of_creation.iloc[-1] if not floor_of_creation.empty else 0
print(f"\n--- Lower Boundary (Floor) ---")
print(f"Model: C_floor(k) = {floor_model_val:.0f}, for k >= {floor_of_creation.idxmin()+1 if not floor_of_creation.empty else 'N/A'}")
if median_model_results:
alpha_med, beta_med, r2_med = median_model_results['alpha'], median_model_results['beta'], median_model_results['r_squared']
print(f"\n--- Median Boundary (The 'Dense Curve') ---")
print(f"Model Fit: C_median(k) ≈ {alpha_med:.4f} * k^{beta_med:.4f}")
print(f"Exponent (β_med): {beta_med:.6f}")
print(f"Model R-squared: {r2_med:.6f}")
if ceiling_model_results:
alpha_ceil, beta_ceil, r2_ceil = ceiling_model_results['alpha'], ceiling_model_results['beta'], ceiling_model_results['r_squared']
print(f"\n--- Upper Boundary (Ceiling) ---")
print(f"Model Fit: C_ceil(k) ≈ {alpha_ceil:.4f} * k^{beta_ceil:.4f}")
print(f"Divergence Exponent (β_ceil): {beta_ceil:.6f}")
print(f"Model R-squared: {r2_ceil:.6f}")
print("="*70)
# --- Plotting ---
plt.ion()
fig, ax = plt.subplots(figsize=(18, 12))
ax.scatter(creatable_k, creatable_c, s=15, alpha=0.1,
label=f'The Creatable Universe ({num_creatable})', c='gray', zorder=1)
ax.scatter(uncreatable_k, np.ones_like(uncreatable_k),
s=50, marker='x', c='magenta',
label=f'The Uncreatable Universe ({num_uncreatable})', zorder=5)
ax.plot(k_values, np.full_like(k_values, floor_model_val, dtype=float),
label=f'Floor Model (C={floor_model_val:.0f})', color='green', linewidth=3, zorder=3)
if median_model_results:
k_fit_med = np.geomspace(10, k_limit, 500)
c_fit_med = alpha_med * (k_fit_med ** beta_med)
ax.plot(k_fit_med, c_fit_med, label=f'Median Model (β={beta_med:.4f})', color='blue', linestyle='--', linewidth=3, zorder=3)
if ceiling_model_results:
k_fit_ceil = np.geomspace(10, k_limit, 500)
c_fit_ceil = alpha_ceil * (k_fit_ceil ** beta_ceil)
ax.plot(k_fit_ceil, c_fit_ceil, label=f'Ceiling Model (β={beta_ceil:.4f})', color='red', linestyle='--', linewidth=3, zorder=3)
ax.set_title(f'Analytical Models of the Creatable & Uncreatable Universes (X-axis: {scale.capitalize()})', fontsize=18)
ax.set_xlabel('Integer k', fontsize=12)
ax.set_ylabel('Creation Complexity C (Log Scale)', fontsize=12)
ax.legend()
ax.grid(True, which="both", ls="--")
ax.set_xscale(scale)
ax.set_yscale('log')
ax.set_xlim(left=0.8, right=k_limit)
ax.set_ylim(bottom=1)
if scale == 'linear':
ax.xaxis.set_major_locator(mticker.MaxNLocator(integer=True))
print("\nDisplaying plot...")
plt.show(block=True)
return fig
def main():
""" Main function to run the interactive analysis loop. """
while True:
try:
k_input = input(f"Please enter the maximum k to analyze (or 'Q' to quit): ")
if k_input.strip().lower() == 'q':
break
K_LIMIT = int(k_input)
if K_LIMIT <= 0:
print("Error: Please enter a positive integer.")
continue
scale_choice = input("Enter x-axis scale ('linear' or 'log'): ").strip().lower()
if scale_choice not in ['linear', 'log']:
scale_choice = 'linear'
except (ValueError, EOFError):
print("\nError: Invalid input or non-interactive mode detected. Exiting.")
break
print(f"\n--- Definitive Quantitative Analysis up to k = {K_LIMIT:,} ---")
start_time = time.time()
complexity_map = generate_complexity_map_fast(K_LIMIT)
end_time = time.time()
print(f"\nTotal data generation time: {end_time - start_time:.4f} seconds.")
fig = analyze_and_plot(complexity_map, K_LIMIT, scale_choice)
# After the plot is closed by the user, this part will execute
plt.close(fig)
try:
another_run = input("\nRun another analysis? (Y/N): ").strip().lower()
if another_run != 'y':
break
except (EOFError, RuntimeError):
print("\nNon-interactive mode detected. Exiting.")
break
print("\nExiting the analyzer. Goodbye!")
if __name__ == "__main__":
main()Example Outputs:
Please enter the maximum k to analyze (or 'Q' to quit): 10000
Enter x-axis scale ('linear' or 'log'): linear
--- Definitive Quantitative Analysis up to k = 10,000 ---
Generating the map of the Creatable Universe...
Map of the Creatable Universe generated.
Total data generation time: 0.0120 seconds.
======================================================================
THREE-BOUNDARY ANALYTICAL MODELS (k = 10,000)
======================================================================
--- Data Summary ---
Found 9,190 creatable indices.
Found 810 uncreatable indices.
First 20 Uncreatable: [ 1 2 3 5 7 10 12 17 18 23 25 30 32 33 38 40 45 47 52 58]
Last 20 Uncreatable: [9695 9705 9728 9732 9740 9742 9767 9798 9818 9835 9837 9842 9868 9870
9893 9903 9907 9912 9938 9945]
--- Lower Boundary (Floor) ---
Model: C_floor(k) = 2, for k >= 4
--- Median Boundary (The 'Dense Curve') ---
Model Fit: C_median(k) ≈ 0.6521 * k^0.5239
Exponent (β_med): 0.523931
Model R-squared: 0.999567
--- Upper Boundary (Ceiling) ---
Model Fit: C_ceil(k) ≈ 0.2006 * k^0.9993
Divergence Exponent (β_ceil): 0.999296
Model R-squared: 0.999807
======================================================================
Displaying plot...
Run another analysis? (Y/N): y
Please enter the maximum k to analyze (or 'Q' to quit): 10000
Enter x-axis scale ('linear' or 'log'): log
--- Definitive Quantitative Analysis up to k = 10,000 ---
Generating the map of the Creatable Universe...
Map of the Creatable Universe generated.
Total data generation time: 0.0122 seconds.
======================================================================
THREE-BOUNDARY ANALYTICAL MODELS (k = 10,000)
======================================================================
--- Data Summary ---
Found 9,190 creatable indices.
Found 810 uncreatable indices.
First 20 Uncreatable: [ 1 2 3 5 7 10 12 17 18 23 25 30 32 33 38 40 45 47 52 58]
Last 20 Uncreatable: [9695 9705 9728 9732 9740 9742 9767 9798 9818 9835 9837 9842 9868 9870
9893 9903 9907 9912 9938 9945]
--- Lower Boundary (Floor) ---
Model: C_floor(k) = 2, for k >= 4
--- Median Boundary (The 'Dense Curve') ---
Model Fit: C_median(k) ≈ 0.6521 * k^0.5239
Exponent (β_med): 0.523931
Model R-squared: 0.999567
--- Upper Boundary (Ceiling) ---
Model Fit: C_ceil(k) ≈ 0.2006 * k^0.9993
Divergence Exponent (β_ceil): 0.999296
Model R-squared: 0.999807
======================================================================
Displaying plot...
Run another analysis? (Y/N): y
Please enter the maximum k to analyze (or 'Q' to quit): 100000
Enter x-axis scale ('linear' or 'log'): linear
--- Definitive Quantitative Analysis up to k = 100,000 ---
Generating the map of the Creatable Universe...
Map of the Creatable Universe generated.
Total data generation time: 0.1490 seconds.
======================================================================
THREE-BOUNDARY ANALYTICAL MODELS (k = 100,000)
======================================================================
--- Data Summary ---
Found 94,670 creatable indices.
Found 5,330 uncreatable indices.
First 20 Uncreatable: [ 1 2 3 5 7 10 12 17 18 23 25 30 32 33 38 40 45 47 52 58]
Last 20 Uncreatable: [99488 99522 99545 99568 99587 99612 99613 99628 99650 99675 99698 99748
99775 99788 99822 99837 99858 99913 99950 99990]
--- Lower Boundary (Floor) ---
Model: C_floor(k) = 2, for k >= 4
--- Median Boundary (The 'Dense Curve') ---
Model Fit: C_median(k) ≈ 0.6750 * k^0.5196
Exponent (β_med): 0.519554
Model R-squared: 0.999936
--- Upper Boundary (Ceiling) ---
Model Fit: C_ceil(k) ≈ 0.1985 * k^1.0006
Divergence Exponent (β_ceil): 1.000635
Model R-squared: 0.999982
======================================================================
Displaying plot...
Run another analysis? (Y/N): y
Please enter the maximum k to analyze (or 'Q' to quit): 100000
Enter x-axis scale ('linear' or 'log'): log
--- Definitive Quantitative Analysis up to k = 100,000 ---
Generating the map of the Creatable Universe...
Map of the Creatable Universe generated.
Total data generation time: 0.1463 seconds.
======================================================================
THREE-BOUNDARY ANALYTICAL MODELS (k = 100,000)
======================================================================
--- Data Summary ---
Found 94,670 creatable indices.
Found 5,330 uncreatable indices.
First 20 Uncreatable: [ 1 2 3 5 7 10 12 17 18 23 25 30 32 33 38 40 45 47 52 58]
Last 20 Uncreatable: [99488 99522 99545 99568 99587 99612 99613 99628 99650 99675 99698 99748
99775 99788 99822 99837 99858 99913 99950 99990]
--- Lower Boundary (Floor) ---
Model: C_floor(k) = 2, for k >= 4
--- Median Boundary (The 'Dense Curve') ---
Model Fit: C_median(k) ≈ 0.6750 * k^0.5196
Exponent (β_med): 0.519554
Model R-squared: 0.999936
--- Upper Boundary (Ceiling) ---
Model Fit: C_ceil(k) ≈ 0.1985 * k^1.0006
Divergence Exponent (β_ceil): 1.000635
Model R-squared: 0.999982
======================================================================
Displaying plot...
Run another analysis? (Y/N): y
Please enter the maximum k to analyze (or 'Q' to quit): 10000000
Enter x-axis scale ('linear' or 'log'): linear
--- Definitive Quantitative Analysis up to k = 10,000,000 ---
Generating the map of the Creatable Universe...
Processing generator x = 965657/2000002....
Map of the Creatable Universe generated.
Total data generation time: 23.3195 seconds.
======================================================================
THREE-BOUNDARY ANALYTICAL MODELS (k = 10,000,000)
======================================================================
--- Data Summary ---
Found 9,719,443 creatable indices.
Found 280,557 uncreatable indices.
First 20 Uncreatable: [ 1 2 3 5 7 10 12 17 18 23 25 30 32 33 38 40 45 47 52 58]
Last 20 Uncreatable: [9999327 9999353 9999370 9999462 9999523 9999525 9999542 9999575 9999593
9999638 9999682 9999685 9999755 9999808 9999880 9999883 9999938 9999973
9999980 9999997]
--- Lower Boundary (Floor) ---
Model: C_floor(k) = 2, for k >= 4
--- Median Boundary (The 'Dense Curve') ---
Model Fit: C_median(k) ≈ 0.6768 * k^0.5193
Exponent (β_med): 0.519307
Model R-squared: 0.999999
--- Upper Boundary (Ceiling) ---
Model Fit: C_ceil(k) ≈ 0.1998 * k^1.0001
Divergence Exponent (β_ceil): 1.000062
Model R-squared: 1.000000
======================================================================
Displaying plot...
Run another analysis? (Y/N): y
Please enter the maximum k to analyze (or 'Q' to quit): 10000000
Enter x-axis scale ('linear' or 'log'): log
--- Definitive Quantitative Analysis up to k = 10,000,000 ---
Generating the map of the Creatable Universe...
Processing generator x = 872992/2000002....
Map of the Creatable Universe generated.
Total data generation time: 23.6025 seconds.
======================================================================
THREE-BOUNDARY ANALYTICAL MODELS (k = 10,000,000)
======================================================================
--- Data Summary ---
Found 9,719,443 creatable indices.
Found 280,557 uncreatable indices.
First 20 Uncreatable: [ 1 2 3 5 7 10 12 17 18 23 25 30 32 33 38 40 45 47 52 58]
Last 20 Uncreatable: [9999327 9999353 9999370 9999462 9999523 9999525 9999542 9999575 9999593
9999638 9999682 9999685 9999755 9999808 9999880 9999883 9999938 9999973
9999980 9999997]
--- Lower Boundary (Floor) ---
Model: C_floor(k) = 2, for k >= 4
--- Median Boundary (The 'Dense Curve') ---
Model Fit: C_median(k) ≈ 0.6768 * k^0.5193
Exponent (β_med): 0.519307
Model R-squared: 0.999999
--- Upper Boundary (Ceiling) ---
Model Fit: C_ceil(k) ≈ 0.1998 * k^1.0001
Divergence Exponent (β_ceil): 1.000062
Model R-squared: 1.000000
======================================================================
Displaying plot...