Search arXiv⌕ Search

arXiv subjects

Snehal Shekatkar

Publications and source records attributed to Snehal Shekatkar.

3 recordsLinked to original sources

Attractors and basins generated by repeated sums of prime factors of natural numbers

Integer maps are discrete dynamical systems defined on the natural numbers. In this paper, we investigate the dynamics of the shifted Alladi-Erd{\H o}s map, a one-parameter family of integer maps in which each composite number is mapped to the sum of its prime factors, while each prime is mapped to $n+A$, where $A \in \mathbb{N}$ is a fixed shift parameter. By systematically exploring the parameter space for $2 \leq A \leq 10^5$, we uncover a rich bifurcation structure characterized by the emergence, disappearance, and reorganization of attractor cycles as the shift parameter varies. We find that although several attractors may coexist for a given value of $A$, for most values of $A$, almost all natural numbers belong to the basins of only two dominant attractors. Using elementary number theoretic arguments, we explain the observed bifurcation diagram. We further characterize the attractor cycles and quantify the distribution of their basin sizes across the parameter space. Our results reveal an unexpectedly rich landscape of arithmetic dynamics arising from a remarkably simple integer map. %and provide a systematic characterization of how attractors and their basins evolve as shift parameter is varied.

nlin.CD↗

Shifts of the prime divisor function of Alladi and Erdős

We introduce a variation on the prime divisor function $B(n)$ of Alladi and Erdős, a close relative of the sum of proper divisors function $s(n)$. After proving some basic properties regarding these functions, we study the dynamics of its iterates and discover behaviour that is reminiscent of aliquot sequences. We prove that no unbounded sequences occur, analogous to the Catalan-Dickson conjecture, and give evidence towards the analogue of the Erdős-Granville-Pomerance-Spiro conjecture on the pre-image of $s(n)$.

math.NT↗

The sum of the r'th roots of first n natural numbers and new formula for factorial

Using the simple properties of Riemman integrable functions, Ramanujan's formula for sum of the square roots of first n natural numbers has been generalized to include r'th roots where r is any real number greater than 1.As an application we derive formula that gives factorial of positive integer $n$ similar to Stirling's formula.

math.NT↗