Fractional-Order Bioconvection in Trihybrid Nanofluids Flowing Over a Rotating Disk: A Hybrid Neural Network With Genetic Algorithm Method for Entropy Generation Minimization

<p>Fractional-Order Bioconvection in Trihybrid Nanofluids Flowing Over a Rotating Disk: A Hybrid Neural Network With Genetic Algorithm Method for Entropy Generation Minimization</p> : Minimizing entropy generation in complex fluid systems is a primary concern for improving thermodynamic efficiency. This paper investigates bioconvection in a Carreau-Yasuda trihybrid nanofluid over a spinning disk, where fluid memory is modeled using fractional-order derivatives. We provide an analytical energy-based stability framework for the proposed model. Given the high computational cost associated with solving fractional partial differential equations, we propose a Hybrid Neural Network surrogate model combined with a Genetic Algorithm. The Hybrid Neural Network, trained on data obtained via the Finite Difference Method, accurately predicts Nusselt numbers and entropy generation, while the Genetic Algorithm navigates the response surface to identify Pareto-optimal solutions. A deep cas...

Cousin Primes & Digital Roots: Interactive Python Tool

Cousin Primes & Digital Roots: Interactive Python Tool

πŸ” Cousin Primes & Their Digital Roots

🎯 What Are Cousin Primes?

Cousin primes are pairs of prime numbers that differ by exactly 4. Examples include (3, 7), (7, 11), and (13, 17). These pairs help us explore prime gaps and distribution patterns in number theory.

πŸ’‘ What Is a Digital Root?

The digital root of a number is the single-digit value obtained by repeatedly summing its digits until only one digit remains. For example:

  • 137 → 1 + 3 + 7 = 11 → 1 + 1 = 2
  • 89 → 8 + 9 = 17 → 1 + 7 = 8

πŸ’» Python Code

def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def digit_root(n):
    while n >= 10:
        n = sum(int(d) for d in str(n))
    return n

def find_cousin_primes_with_roots(lower, upper):
    cousin_pairs = []
    for p in range(lower, upper - 4):
        if is_prime(p) and is_prime(p + 4):
            dr1 = digit_root(p)
            dr2 = digit_root(p + 4)
            cousin_pairs.append(((p, p + 4), (dr1, dr2)))
    return cousin_pairs

def main():
    try:
        lower_limit = int(input("Enter the lower limit: "))
        upper_limit = int(input("Enter the upper limit: "))
        if lower_limit >= upper_limit:
            print("Lower limit must be less than upper limit.")
            return
        pairs_with_roots = find_cousin_primes_with_roots(lower_limit, upper_limit)
        print(f"\nCousin Prime Pairs with Digital Roots from {lower_limit} to {upper_limit}:")
        for (p1, p2), (dr1, dr2) in pairs_with_roots:
            print(f"({p1}, {p2}) → ({dr1}, {dr2})")
    except ValueError:
        print("Please enter valid integers.")

# Run the program
main()

Copy and Try it here!

πŸ“Š Sample Output

Input: Lower = 10, Upper = 50

Output:

(13, 17) → (4, 8)
(19, 23) → (1, 5)
(37, 41) → (1, 5)
(43, 47) → (7, 2)

πŸ” Why It’s Fascinating

Digital roots offer a compact way to analyze numerical behavior. When applied to cousin primes, they reveal patterns, symmetries, and attractors that might otherwise go unnoticed. This blend of number theory and digit analysis is perfect for curious minds.

🌟 Final Thoughts

Try different ranges and observe how digital roots behave across cousin primes. Are certain root pairs more frequent? Do they repeat cyclically? This script is a great way to explore prime behavior and deepen your mathematical intuition.

Comments

Popular posts from this blog

Free Field Operator: Building Quantum Fields

Understanding the Laplacian of 1/r and the Dirac Delta Function Mathematical Foundations & SageMath Insights

Heuristic Computation and the Discovery of Mersenne Primes