All Questions
12
questions
3
votes
0
answers
88
views
Do the sequences defined by $a_n=a_{n-1}+(\text{the least prime factor of }a_{n-1})+1$ starting with $2,6,14,\ldots$ merge?
Let $S_k$ be the sequence defined by $a_k(1)=k,\ a_k(n)=a_k(n-1)+(\text{the least prime factor of }a_k(n-1))+1$.
A diagram of these sequences for around $k<100$ is shown below. As you can see, $S_3$...
2
votes
0
answers
51
views
What is the smallest product, $m$, of $6$ distinct odd primes such that $\frac{d+\frac{m}{d}}{2}$ is prime for all $d$ dividing $m$?
I am currently working on a sequence, $a_n$, that is defined as follows:
$$a_n\text{ is the smallest product of }n\text{ distinct odd primes, }m=p_1p_2\dots p_n\text{, such that }\frac{d+\frac{m}{d}}{...
2
votes
1
answer
110
views
If $p$ and $q$ are coprime positive integers s.t. $\frac{p}{q}=\sum_{k=0}^{100}\frac1{3^{2^k}+1}$, what is the smallest prime factor of $p$?
If the sum $$S=\frac14+\frac1{10}+\frac1{82}+\frac1{6562}+\cdots+\frac1{3^{2^{100}}+1}$$
is expressed in the form $\frac pq,$ where $p,q\in\mathbb N$ and $\gcd(p, q) =1.$ Then what is smallest prime ...
0
votes
1
answer
67
views
Is the sequence infinite? Finite? Is there a general formula to determine n th term?
Sequence of numbers whose factorial on prime factorisation contains prime powers of prime numbers, whose power is greater than $1$ or contains multiplicity of one for all prime numbers less than equal ...
1
vote
2
answers
86
views
To determine multiplicity of $2$ in $n!$ [duplicate]
Is there a general formula for determining multiplicity of $2$ in $n!\;?$
I was working on a Sequence containing subsequences of 0,1. 0 is meant for even quotient, 1 for odd quotient.
Start with k=3,...
4
votes
2
answers
199
views
Lower bound related to the number of distinct prime numbers
Let $\omega(n)$ be the number of distinct prime factors of $n$ (without multiplicity, of course). I know some results about average of $\omega(n)$. But I didn't find any result about the following: ...
1
vote
1
answer
243
views
Square-free integers in the sequence $n^{\operatorname{rad}(n)}+\operatorname{rad}(n)+1$
For integers $n\geq 1$ in this post we denote the square-free kernel as $$\operatorname{rad}(n)=\prod_{\substack{p\mid n\\p\text{ prime}}}p,$$ that is the product of distinct primes dividing an ...
0
votes
1
answer
163
views
On prime-perfect numbers and the equation $\frac{\varphi(n)}{n}=\frac{\varphi(\operatorname{rad}(n))}{\operatorname{rad}(\sigma(n))}$
While I was exploring equations involving multiple compositions of number theoretic functions that satisfy the sequence of even perfect numbers, I wondered next question (below in the Appendix I add a ...
3
votes
1
answer
106
views
A problem similar than that of the amicable pairs using the function $\operatorname{rad}(k)$: a first statement or conjecture
In this post we denote the product of distinct primes dividing an integer $k> 1$ as $\operatorname{rad}(k)$, with the definition $\operatorname{rad}(1)=1$, that is the so-called radical of an ...
2
votes
1
answer
68
views
On miscellaneous questions about perfect numbers II
Let $\varphi(m)$ the Euler's totient function and $\sigma(m)$ the sum of divisors function. We also denote the product of primes dividing an integer $m>1$ as $\operatorname{rad}(m)$, that is the ...
2
votes
1
answer
162
views
On even integers $n\geq 2$ satisfying $\varphi(n+1)\leq\frac{\varphi(n)+\varphi(n+2)}{2}$, where $\varphi(m)$ is the Euler's totient
This afternoon I am trying to get variations of sequences inspired from the inequality that defines the so-called strong primes, see the definition of this inequality in number theory from this ...
2
votes
1
answer
105
views
Square-free integers in the sequence $\lambda+\prod_{k=1}^n(\varphi(k)+1)$, where $\lambda\neq 0$ is integer
While I was exploring the squares in the sequence defined for integers $n\geq 1$
$$\prod_{k=1}^n(\varphi(k)+1),\tag{1}$$
where $\varphi(m)$ denotes the Euler's totient function I wondered a different ...