All Questions
14 questions with no upvoted or accepted answers
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 ...
3
votes
0
answers
299
views
An attempt to get a variant of Agoh–Giuga conjecture
The idea of this post is an attempt to explore a variant of the so-called Agoh–Giuga conjecture. In past days, and today, I tried to think about variants of this conjecture exploring congruences about ...
3
votes
0
answers
280
views
Magnitude and distribution of largest prime factor?
Erdos-Kac law state a typical number of magnitude $n$ has $\log\log n$ prime factors.
What is magnitude and distribution of largest prime factor of typical magnitude $n$ natural number?
What is ...
3
votes
0
answers
265
views
Prove A Skipping Prime Conjecture For Rio?
I am writing a paper to accompany a Short Communication I plan to give in Rio this August. The paper regards work on jumping primes, a project on which Jose Brox has been working with me. I was going ...
2
votes
0
answers
108
views
How to compute/estimate the least $k$ such that there exist $n$ consecutive integers each having a prime factor $\le k$?
Let $a_n$ be the least integer $k$ such that there exist $n$ consecutive integers each with a prime factor $\le k$. For example, $a_{13} \le 11$ because the 13 consecutive integers $114,115,\ldots,126$...
2
votes
0
answers
112
views
Queries on distribution of prime divisors by magnitude?
Erdos-Kac law state a typical number of magnitude $n$ has $\log\log n$ prime factors and we know probability of square free integers is $\frac{6}{\pi^2}$.
What is the probability distribution of ...
2
votes
0
answers
311
views
A question concerning the strange arithmetic derivation
This question is related to Strange (or stupid) arithmetic derivation. The original question whether an unbounded sequence of iterates exists is still unanswered.
$$n=\prod_{i=1}^{k}p_i^{\alpha_i} \...
2
votes
0
answers
221
views
Determine whether if $n$ is a primitive pseudoperfect (semiperfect) number, then $\sigma(n)<2^{\sigma_0(n)}$
Determine whether if $n$ is a primitive pseudoperfect (semiperfect) number, then $\sigma(n)<2^{\sigma_0(n)}$.
$\sigma_k(n)$ is the division function and $\sigma(n)=\sigma_1(n)$. A number is ...
1
vote
0
answers
153
views
A definition related to pseudoprimes and the Dedekind psi function
In this post we consider that $\psi(k)$ denotes the Dedekind psi function. Wikipedia has an artcle dedicated to this arithmetic function Dedekind psi function defined for a positive integers $m>1$ ...
1
vote
0
answers
201
views
Generalized Thomas Ordowski conjecture at OEIS sequence A002326
OEIS is the online encyclopedia of integer sequences, Here is the link to the sequence $A002326$: https://oeis.org/A002326
For $n\geq 0$, the $n$th term in the sequence is defined as: $a(n)$ equals ...
1
vote
0
answers
64
views
On characterizations for Mersenne primes involving the sum of divisor function
In this post we denote the sum of positive divisors function of an integer $n\geq 1$ as $$\sigma(n)=\sum_{1\leq d\mid n}d.$$
Then a prime of the form $2^p-1$ is called a Mersenne prime. These are ...
1
vote
0
answers
141
views
On certain number theoretic sextuples?
Given small parameters $0<\epsilon<\epsilon'$ is there an $n_\epsilon>0$ such that at every $n>n_\epsilon$ if we are given a prime $n^2<p<2n^2$ then can we always find integers $a,b,...
0
votes
0
answers
759
views
On sets of coprime integers in intervals
Briefly,
Question: Is it "good enough" to use least prime factor in choosing a maximal set of coprime integers in an interval?
The post title comes from a 1993 paper of Erdos and Sarkozy. They ...
-10
votes
1
answer
555
views
Arithmetic billiards, prime numbers and the Goldbach conjecture
I've edited the following post on Mathematics Stack Exchange, (now closed, at that date I'm suspended) with identifier 4510963, please let me to know if you've some doubt or I can improve the post.
On ...