Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
138 views

Diophantine approximation and the Euclidean algorithm

My question is whether something I've noticed is well-known. It seems like it must be, but I've been unable to find any references that describe what is outlined below. Given real $x$ and irrational $...
Randall Fairman's user avatar
25 votes
2 answers
2k views

Do these rational sequences always reach an integer?

This post comes from the suggestion of Joel Moreira in a comment on An alternative to continued fraction and applications (itself inspired by the Numberphile video 2.920050977316 and Fridman, ...
Sebastien Palcoux's user avatar
8 votes
1 answer
328 views

On the density map of the abundancy index

Let $σ$ be the sum-of-divisors function. Let $σ(n)/n$ be the abundancy index of $n$. Consider the density map $$f(x) = \lim_{N \to \infty} f_N(x) \ \ \text{ with } \ \ f_N(x) = \frac{1}{N} \#\{ 1 \...
Sebastien Palcoux's user avatar
26 votes
3 answers
2k views

Unexpected behavior involving √2 and parity

This post makes a focus on a very specific part of that long post. Consider the following map: $$f: n \mapsto \left\{ \begin{array}{ll} \left \lfloor{n/\sqrt{2}} \right \rfloor & \...
Sebastien Palcoux's user avatar
11 votes
0 answers
809 views

Borderline Collatz-like problems

The usual Collatz map is $C:n \mapsto n/2$ if $n$ even, $(3n+1)/2$ if $n$ odd. Let $f^{\circ (r+1)}:=f \circ f^{\circ r}$. We suspect that for every fixed $n>0$, the sequence $C^{\circ r}(n)$ ...
Sebastien Palcoux'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