Number Theory

2607 Submissions

[3] viXra:2607.0034 [pdf] submitted on 2026-07-11 23:16:01

TauPhi Numbers

Authors: Walter A. Kehowski
Comments: 8 Pages.

Let tau(n) be the number of divisors of n and let phi(n) denote the number of relatively prime numbers less than n. A number is called refactorable if and only if tau(n) divides n. It is known that phi(n) divides n if and only if n is 3-smooth. Furthermore, n/phi(n)=2 when n is a power of two and n/phi(n)=3 otherwise. Define lambda(n)=lcm(tau(n),phi(n)). Then n/lambda(n) is in {1,2,3} and n is called a tauphi-number. It is the purpose of this note to show when lambda(n)=n, called the unital tauphi-numbers.
Category: Number Theory

[2] viXra:2607.0010 [pdf] submitted on 2026-07-03 10:28:12

Ramanujan Transformations and Robin Defects

Authors: Payam Danesh
Comments: 9 Pages.

We studied the Robin defect associated with the inequality σ(n)<e^γ nlogu2061logu2061n, express its Laplace transform through Ramanujan’s transformation for the divisor Lambert series and isolate the precise difference between smoothed positivity and coefficientwise positivity. The main results give us an exact Ramanujan-transformed identity for the Robin defect, an equivalent coefficientwise formulation of the Riemann Hypothesis showing why transform-level positivity cannot by itself prove the hypothesis and an extremal reduction to colossally abundant and highest abundant numbers. Numerical data for early extremal integers illustrate how the normalized defect behaves past the exceptional value 5040. Ramanujan’s identities provide powerful global control, but the Riemann Hypothesis requires pointwise positivity at the extremal divisor-rich integers.
Category: Number Theory

[1] viXra:2607.0007 [pdf] submitted on 2026-07-04 02:50:07

On a Quadratic Collatz Type Map Governed by Prime Factorization: A Conjectural Universal Cycle, Two Reduction Theorems and an Intrinsic Computational Barrier

Authors: Christoper Mututu
Comments: 36 Pages.

We study a map T on the integers defined by T(n)=n^2+1 when n is prime or even and T(n)=n/P(n) when n is odd composite, where P(n) denotes a designated prime factor n. Two variants arise according to the choice of P(n). In Part I, P(n) is the largest prime factor of n while in Part II, it is the smallest. Informally, the conjecture of this paper asserts that every integer greater than one in absolute value eventually enters the single twelve element cycle5→26→677→458330→210066388901→52357→41→1682→2829125→1625→125→25 and remains there forever. Formally, we verify this for every integer n∈[2,1000] under Part I with no exception and no alternate cycle observed and we conjecture it holds for every integer n in the domain Z^*=Z {-1,0,1} but we do not prove it.Toward this conjecture, we prove two theorems. The first is exact rather than asymptotic. For any odd composite m, repeated application of the largest prime factor reduction reaches a prime in precisely Ω(m)-1 steps where Ω(m) counts the prime factors of m with multiplicity. Each application removes exactly one element from the prime factorization multiset m so the count decreases by exactly one per step and terminates uniquely at a prime. The second theorem follows from the first. Under the extension of primality to negative integers through |n|, which is the only convention under which the conjecture is well posed on Z, every negative integer reaches a positive value within at most Ω(|n|) steps. This reduces the negative integer case of the conjecture entirely to the positive integer case. We also identify an obstruction to further verification that is structural rather than a matter of computing resources. The reduction step of T requires the complete factorization of the input which is a problem for which no general sub exponential algorithm is known. Repeated application of the squaring branch can therefore produce integers whose factorization lies beyond any presently known method regardless of computing time available. Our verification required factoring intermediate values of up to 96 digits and succeeded in every instance though with no guarantee that a harder instance does not arise beyond the tested range. For Part II, this obstruction is severe enough to foreclose even a conjecture. Every trajectory examined exceeded 100 digits within fewer than 25 iterations without any value repeating. We are unable to characterize the long-term behavior of Part II by any method available to us and as a result, Part II is entirely open.
Category: Number Theory