This paper presents a recreational mathematical exploration derived from the traditional African board game Owari (Mancala). The study examines a specific variant where a score is achieved only if a player casts marbles totaling exactly two or three into the opponent’s home, with no scoring occurring in one’s own home. Both players sow anticlockwise relative to their own perspective; because they sit opposite one another, their physical trajectories on the board are opposite. It is conjectured that this opposing dynamic may produce al- ternating signs in a telescoping series, though this remains an open question (see Section 5.6). The game’s scoring sequence is illustrated using arithmetic progressions (AP), geomet- ric progressions (GP), and telescoping series as analogies. The paper analyzes two distinct illustrative games: the first is a concrete 10-round example whose residual happens to be 1/12; the second is an illustrative game with final scores of 23 and 25, where the cumu- lative scores sum to 48. By representing score distributions through partial fractions, the study illustrates possible analogies with telescoping series. Additional variants including 1-or-4 scoring and symmetric sowing are introduced as worked examples. The paper does not claim to derive the sequences from the rules; rather, it illustrates possible mathematical analogies.

This paper introduces a new method of finding the sum and product of roots of quadratic equations.The approach adapts the half-life concept from radioactive decay in Physics and Chemistry. During the derivation of the quadratic formula by completing the square, the step where we add half the coefficient of x to both sides is replaced by the half-life relation 1/2 = ln 2/k, leading to k = 2 ln 2. This substitution produces an auxiliary formula that yields two values x1and x2whose sum equals the Vieta sum.A second relation involving ln 2 then recovers the exact Vieta product. The method, called the Logarithmic Root-Sum-Product Extractor (or Half-Life Quadratic Formula), gives results identical to the conventional method while creating a strong link between mathematics and science.

The Prime Density Triangle offers a novel combinatorial framework for exploring properties of prime numbers. From the algebraic relations embedded within this triangle, specifically the coupled expressions X^p1± p1and X^p0± p0, we derive two closed-form sequences.First, the multiplication of these expressions yields the sequence Sn(m) = (mn+ n2)1/(n+2), which converges to m. Second, by a deliberate construction—replacing the additive denominator n + 2 with the multiplicative denominator 2n—we obtain the Exponential-Polynomial Root Mean (EPRM) defined by Rn(m) = (mn+ n2)1/(2n) for m > 0 and n ∈ N. This construction provides a closed-form, non-iterative method for approximating √m for sufficiently large n. In this paper, we present a complete derivation of both sequences from the Prime Den- sity Triangle’s algebraic frameworks, rigorous convergence proofs including asymptotic error analysis, detailed worked examples for m = 2, 3, 5 with explicit computations, numerical summary tables, explicit iterations for classical methods (Babylonian and Newton-Raphson), and a comprehensive comparison. The approach is elementary and highlights the dominance of exponential terms over polynomial corrections.

This paper investigates the sum of all non-Fibonacci integers that lie strictly between consecutive Fibonacci numbers. Starting from the operation a(n) = Mn− Fn, where Mn is that sum and Fn the preceding Fibonacci number, we obtain a sequence whose first three terms are themselves Fibonacci numbers: 1, 8, 34. We extend the exploration to seven other arithmetic operations (subtracting the next Fibonacci, adding either, multiplying either, and dividing either), and we systematically search for Fibonacci numbers that appear in each resulting sequence. We term such Fibonacci entries “lucky Fibonacci numbers”. Among all variants, only the addition and subtraction operations yield any lucky Fibonacci numbers: 1, 8, 34 (subtract previous), 5 (subtract next, ignoring the negative initial term), 21, 55 (add next), and none for add previous, nor for multiplication or division. We then apply the same gap-summing idea to other recurrent sequences: Lucas, Pell, and Tribonacci. For each, we find a small set of lucky Fibonacci numbers. All conjectures are verified computationally up to n = 200 (and up to Fibonacci F400), with no further hits found. The growth rates are exponential, making further coincidences increasingly improbable.

We introduce a triangular array of integers defined by a(n, k) = k(k + 1)n−k for n ≥ 1 and 1 ≤ k ≤ n, which we call the researcher’s triangle. The construction is multiplicative and differs from classical additive triangles such as Pascal’s. We give combinatorial interpretations using a leaders-followers model and a rooted hierarchical structure model. We identify several diagonal sequences as classical figurate numbers, including powers of two (A000079), natural numbers (A000027), and oblong numbers (A002378), and establish connections to triangular and tetrahedral numbers. We derive a bivariate generating function and a recurrence relation, and we discuss the row sums.