This note presents two original and creative divisibility tests for the integers 2 and 5. Both rules use the factorial of the last digit of a number, combined with a small correction when the factorial value would disrupt the required modular congruence. The resulting tests are mathematically equivalent to the classical last-digit rules but reach the same conclusion through an unconventional factorial-based approach. Each theorem includes a short proof sketch, an explanation of the mechanism, and four worked examples. The methods are valid precisely because 2 and 5 divide the base 10, allowing the last digit to fully determine the remainder modulo of these divisors. The work is intended as an accessible piece of recreational number theory for educational purposes.

We introduce a prime density triangle, a multiplicative array constructed by a modified rule of indices. Two display formats are given: a right-angle triangle with converted and unconverted entries, and an equilateral triangle obtained by mirroring the right-angle triangle about the central term xn. We derive the row-sum generating function and provide worked examples using both direct computation and the generating function. Using a four-rule division scheme applied to the unconverted rows we obtain the sequence whose integer parts sum to the magic numbers for two spin orientations. Replacing the repeated end integers by 1,1 yields whose integer parts give the standard harmonic oscillator,HO and in conjunction with the 2 spin orientation nucleon magic numbers gives precisely the standard nuclear magic numbers 2, 8, 20, 28, 50, 82, 126, 184, . . . Subshell filling up to x9, deductions, and evidence from nuclear physics are included. A recurrence M = m ± [(n1n2) + 2] is presented for generating further magic numbers. The sequences appear as OEIS A005897 and OEIS A018226 and OEIS A007290