Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
152 views

On the $\mathsf{LCM}$ of a set of integers defined by moduli of powers

For integers $a,b,t$ define $$\mathcal R_t(a,b)=\{q\in\mathbb Z\cap[1,\min(a^t,b^t)]: a^t\equiv b^t\bmod q\}$$ and $\mathsf{LCM}(\mathcal R_t(a,b))$ to be $\mathsf{LCM}$ of all entries in $\mathcal ...
VS.'s user avatar
  • 1,836
6 votes
0 answers
201 views

Smooth integers with lower bound on $\omega(n)$

Define $(b,c)$-smooth integers to be integers having all prime factors bigger than $c$ and smaller than $b$. Probability a number is $(b,1)$-smooth is governed by the Dickman function while ...
VS.'s user avatar
  • 1,836
1 vote
1 answer
233 views

Generalized notion of divisor function?

Divisor function $d(n,m)$ counts the number of $q\in\Bbb N$ with $b<q<m$ such that $n\bmod q\equiv0$. Given $b>0$ what is the correct asymptotic, probabilistic and average case behavior of ...
Turbo's user avatar
  • 13.9k
13 votes
2 answers
791 views

Number of distinct factors

Denote $\omega(m)$ to be number of distinct factors of $m$ as defined in http://mathworld.wolfram.com/DistinctPrimeFactors.html. At every $c>0$, given $n\in\Bbb N$ define $$S(n,c)=\big\{m\in\Bbb N:...
user avatar
3 votes
1 answer
463 views

Ratio of consecutive divisors and average

Let $2\leq d_1 < d_2,...,d_l < n$ be all the proper nontrivial divisors of $n$. I like to understand how much these divisors deviates from each other. Here are two questions in this regard: (1) ...
Kamalakshya's user avatar