Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
4 answers
2k views

How do these primes jump?

Update 2017.08.28: I am still looking for references. I have posted a request to https://cs.stackexchange.com/q/79971 which includes some literature references I found which are of interest but still ...
Gerhard Paseman's user avatar
2 votes
1 answer
515 views

On comparing two almost injective divisor maps

Edit 2018.08.08 This answer https://mathoverflow.net/a/307881 will be updated to give recent information about S, especially a forthcoming preprint. End Edit 2018.08.08 In an introductory post on ...
Gerhard Paseman's user avatar
31 votes
4 answers
2k views

A Collatz-like function that bifurcates on primes

This is likely piling one mystery on another, but ... I was exploring a function $f(n): \mathbb{N} \mapsto \mathbb{N}$ defined as follows: $$ f(n) = \begin{cases} n^2 & \text{if} \;n \;\text{is ...
Joseph O'Rourke's user avatar
32 votes
2 answers
2k views

A Collatz-like problem on prime numbers

Consider the function $f$ on the prime numbers defined by $$ f(p):= \text{ the greatest prime factor of } 2p+1.$$ The iteration of $f$ from any prime $p<10^8$ converges to the cycle $$(3,7,5,11,23,...
Sebastien Palcoux's user avatar
21 votes
4 answers
2k views

Prime factorization "demoted" leads to function whose fixed points are primes

Let $n$ be a natural number whose prime factorization is $$n=\prod_{i=1}^{k}p_i^{\alpha_i} \; .$$ Define a function $g(n)$ as follows $$g(n)=\sum_{i=1}^{k}p_i {\alpha_i} \;,$$ i.e., exponentiation is "...
Joseph O'Rourke's user avatar
6 votes
0 answers
448 views

Are there always at least *five* divisions?

@JosephO'Rourke asked a question about a Collatz like function related to primes: $f(n) = \begin{cases} n^2 & \text{if} \;n \;\text{is prime} \\ \lfloor n/2 \rfloor & \text{if} \;n \;\text{...
Mirko's user avatar
  • 1,375