Questions tagged [divisors-multiples]
For questions on divisors and multiples, mainly but not exclusively of integers, and related and derived notions such as sums of divisors, perfect numbers and so on.
236 questions
2
votes
0
answers
57
views
On $\sum_{\substack{1\leq d\mid n\\d<f(n)}}d$ and odd perfect numbers, for $f(n)$ the greatest prime factor or $\operatorname{rad}(n)$, respectively
First, in this paragraph we remember the definitions/notations for two number theoretic functions, for an integer $m>1$, we denote its greatest prime factor as $\operatorname{gpf}(m)$, and the ...
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
1
answer
330
views
Greatest common divisor of $(a^n+1,b^n+1)$
Let $(a,b)$ be a pair of coprime positive integers with $a$ being even. Are these conditions sufficient to prove that there exist infinitely many positive integers $n,$ such that $(a^n+1,b^n+1)=1$ ?
- 12.9k
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 ...
- 13.9k
3
votes
0
answers
281
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 ...
CommunityBot
- 1
4
votes
1
answer
375
views
$\sum_{i=1}^x\sum_{j=1}^xf(i\cdot j)$ Double Summing a (Not Completely) Multiplicative Function
Let $f(n)$ be a multiplicative function that is not completely multiplicative, i.e $f(m)\cdot f(n)= f(m\cdot n)$ only if $gcd(m,n)=1$. Let $S(x)$ be the double sum over $f$, that is:
$$S(x)=\sum_{i=1}...
- 12.8k
1
vote
0
answers
134
views
Structure of set with large pairwise gcd's
Let $\mathcal{M}$ be a set of $M$ distinct positive integers, all of size roughly $N$. Assume that the pairwise gcd of elements of $\mathcal{M}$ is large for all pairs. For illustration, let's take $M ...
- 2,227
10
votes
4
answers
4k
views
Sum of the sum-of-divisors function
I was looking at the abstract of a paper 1 which claims that [2] and [3] prove
$$
\sum_{n\le x}\sigma(n)-\frac{\pi^2}{12}x^2=\Omega(x\log\log x).
$$
But I cannot find the above—or indeed, ...
- 4,713
1
vote
1
answer
213
views
Runs of consecutive numbers that are not relatively prime to their digital sum
It is well known that there can be at most 20 consecutive integers (in base 10) that are divisible by their digital sum, so called Harshad or Niven numbers.
How long can a run of consecutive ...
- 30.1k
1
vote
0
answers
57
views
On divisibility conditions implying local coprimality conditions
This question is inspired by Bernardo Recaman's question Strings of consecutive integers divisible by 1, 2, 3, ..., N on intervals of $n$ integers being divisible by the integers $1$ through $n$. The ...
- 13k
5
votes
1
answer
318
views
"Oddity" of Fibonacci-Catalan numbers
As a follow up to my previous two MO questions, here and here, let's consider the below inquiry.
Define the Fibonacci-Catalan numbers by $FC_n=\frac1{F_{n+1}}\binom{2n}n_F$ where $F_0=0, F_1=1, F_0!=...
- 43.2k
36
votes
2
answers
7k
views
Why do primes dislike dividing the sum of all the preceding primes?
I was investigating primes with the property that the sum of the first $n$ primes is divisible by $p_n$. It turns out that these primes are extremely extremely rare. For primes less than $10^9$, I ...
CommunityBot
- 1
6
votes
1
answer
258
views
How to obtain an upper bound for $\prod_{p\mid N} (1 + 1/\sqrt{p})$ where $N$ is square free?
I am interested in obtaining an upper bound for $\prod_{p|N} (1 + 1/\sqrt{p})$ when $N$ is squarefree. It's not too hard to show that
$$
\prod_{p\mid N} (1 + 1/\sqrt{p}) \ll C^{\omega(N)} \ll N^{\...
- 2,821
1
vote
1
answer
111
views
Question about arithmetic binomial coefficient
i have a question about the following assertion:
let $n,j,u $ positive integer satisfying
$ n \geq 5,$ $ 1\leq j \leq n-1$,$ \; n+1 \leq u \leq n+j$
let $ d[n]:=\operatorname{lcm}[1,2,..,n]$ ...
- 3,486
4
votes
1
answer
646
views
Piltz Divisor Problem
Let $\tau_k(n)$ count the number of ways of representing $n$ as the product of $k$ natural numbers. It is known that:
$$D_k(x) = \sum_{n \leq x} \tau_k(n) = xP_k(\log x) + O(x ^{1 - \frac{1}{k-1}}(\...
- 4,713
2
votes
1
answer
284
views
A truncated divisor sum
I am interested in an upper bound for
$$\sum_{\substack{d\mid N\\ d>A}}\frac{1}{d^3},$$
in particular, I can show that above is
$$\ll\frac{\text{exp}\left(C\frac{\log(N)}{\log\log(N)}\right)}{A^...
- 4,713
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 ...
- 13k
2
votes
1
answer
516
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 ...
CommunityBot
- 1
10
votes
2
answers
760
views
Find all $m$ such $2^m+1\mid5^m-1$
The problem comes from a problem I encountered when I wrote the article
Find all positive integer $m$ such
$$2^{m}+1\mid5^m-1$$
it seem there no solution. I think it might be necessary to use ...
- 105k
7
votes
1
answer
675
views
Short divisor sum
Let $d(n)$ denote the number of positive divisors of the positive integer $n$.
Pick some positive $X,h \in \mathbb{R}$ and consider the sum
$$ S(X,h) := \sum_{X \leq n \leq X+ h} d(n).$$
In view of ...
CommunityBot
- 1
2
votes
1
answer
326
views
Does there exist an integer that is both solitary and almost perfect?
This question is an offshoot from the following MSE post. I hope that it is appropriate for this site.
Let $\sigma(x)$ be the sum of the divisors of $x$.
An integer $a$ is said to be solitary if ...
CommunityBot
- 1
1
vote
0
answers
290
views
gcd of polynomial values
Suppose that $f$ and $g$ are two coprime polynomials in $\mathbb Z[x]$. I'm interested in any sort of upper bound on $gcd(f(a),g(a))$, in terms of the integer $a$. Are there any results of this type?...
- 105k
2
votes
1
answer
234
views
The number of numbers no greater than n that are divisible by all their suffixes
My question: what a formula for finding the number of numbers no greater than n that are divisible by all their suffixes.
e.g: 5, 25, 125, 0125, 70125 are divisors of 70125.
refinement: $\overline{0....
- 4,713
3
votes
0
answers
132
views
Is there a way to reduce this problem to two variables through functions coming from arithmetic?
Consider following diophantine equation in $\mathbb Z[x,y,z]$ in three integer variables $x,y,z$
$$x^2+L(y,z)x+L_1(y)L_2(z)=0$$ where $L(y,z)$ is a non-homogeneous linear polynomial in $y,z$ and $L_1(...
- 13.9k
0
votes
1
answer
242
views
$2$-adic valuations and sum of divisor function
Consider the sum of $k^{th}$-power of divisors of $n$, denoted
$$\sigma_k(n)=\sum_{d\vert n}d^k.$$
Let $\nu_p(x)$ stand for the $p$-adic valuation of the integer $x$.
The following appears to be ...
- 7,079
5
votes
0
answers
772
views
The Grimm Machine(s): A Collatz Conjecture Rival?
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
Just as the Collatz ...
- 13k
1
vote
1
answer
466
views
Some divisibility constraints in Frobenius coin problem
Let's say that the linear form $ax+by$ represents $n$ if $ax+by=n$ for some positive integer $x$ and $y$.
Call a pair $(a,b)\in\Bbb N\times\Bbb N$ with $\mathsf{gcd}(a,b)=1$ excellent if linear form ...
CommunityBot
- 1
9
votes
1
answer
1k
views
Sum of divisors below threshold
Let $\sigma(n)$ denote the sum of divisors of $n$, that is,
$$
\sigma(n) = \sum_{d | n} d.
$$
It is known that $\sigma$ can have values as large as order $n \log \log n$. However, obviously the sum is ...
- 105k
5
votes
0
answers
179
views
The total number of divisors of those integers with the most divisors
I'm interested in summing $\tau(m)$, the number of positive divisors of $m$, not over all integers in an interval but rather over only the integers with the most divisors. More specifically:
Given a ...
- 4,713
3
votes
0
answers
266
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 ...
- 13k
1
vote
0
answers
93
views
Existence of equation about the product of the divisor sum function
Let $\sigma_k(n)$ be the sum of the $k$-th powers of the positive divisors of $n$ and $\mu(n)$ be the Möbius function.
As Arithmetic function - Wikipedia mentioned, there is an equation that $$\...
- 123
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,...
- 13.9k
3
votes
2
answers
288
views
Sum of small divisors with powers
I am looking for the tightest known bound for the sum
$$\sum_{\substack{1\leq k\leq j^\alpha \\ k\mid j}}k^\lambda$$
where $j$ is a large positive integer, $\alpha\in(0,1)$ and $\lambda\geq 1$.
I ...
- 12.8k
-3
votes
1
answer
117
views
How much information is required to determine integers x,y,z [closed]
what is x+y+z is x,y and z are integers and xy-1 is divisible by z, yz-1 is divisible by x and xz-1 is divisible by y.
- 54.2k
2
votes
1
answer
213
views
Minimal $n$ such that $(a-1)^m | a^n - 1$ for a given $a,m > 1$
This open-ended question was originally posted on Twitter here. Specifically,
Problem
Given $a,m \in \mathbb{N}$ with $a, m \gt 1$, find the minimal value $n \in \mathbb{N}$ such that $(a-1)^m \mid ...
- 34.4k
11
votes
2
answers
1k
views
Does the Prime Number Theorem have anything to do with Erdos-Kac law or vice versa?
The prime number theorem says on average we can find $\frac n{\log n}$ primes of magnitude $n$.
Erdos-Kac law state a typical number of magnitude $n$ has $\log\log n$ primes.
Somehow the fact $e^{\...
- 4,713
0
votes
0
answers
98
views
Eigenvalues of a sequence of matrices involving the divisor function
Let $A_{n,k},k=1,\ldots,n$ be a sequence of $n\times n$ upper triangular matrices where $A_{n,1}=I_n$ and $A_{n,k},\quad 2\leq k\leq n$ be a regularly shifted and scaled matrix, with $P_{n,k}$ an $n\...
- 10.4k
6
votes
1
answer
360
views
Friable Numbers In Short Intervals: Density Estimates?
I am hoping for explicit numerical estimates like the following sample (with made up numbers, though it might be true): for every $n \gt 10^6$ and every $b$ with $b^2 \lt n \lt b^3$, the number of ...
CommunityBot
- 1
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 ...
- 377
1
vote
0
answers
141
views
Is there an integer $r \neq q$ (with $r>1$) such that $N = q^k n^2 = \frac{r(r+1)}{2}\cdot{d}$ is an odd perfect number with $d>1$?
Slowak showed in 1999 that every odd perfect number $N = q^k n^2$ can be written in the form
$$N = \dfrac{{q^k}\sigma(q^k)}{2}\cdot{D}$$
where $D>1$.
From this result, it follows that every odd ...
2
votes
1
answer
259
views
On attempting a proof for $r > 1$, if $M = {2^r}{b^2}$ is an even almost perfect number which is not a power of two
(Preamble: I first thought that this question might be more appropriate for MSE. However, I posted it here nonetheless in the hope that someone with that brilliant idea can help with answering my ...
CommunityBot
- 1
1
vote
0
answers
90
views
An arithmetic function involving arbitrary (but fixed) number of divisors
I need at least basic information about generating functions of the following class of arithmetic functions, grouped by levels $k$.
Fix some $k$ and some family $\varepsilon_*=(\varepsilon_\sigma)_{\...
- 18.4k
6
votes
0
answers
535
views
When is $ \sigma(n!-1) $ a perfect square?
I am looking for pairs of positive integers $(m,n)$ such that $ \sigma(n!-1) =m^2$, where $\sigma$ is the sum of divisors function. Examples occur with $(m,n)=(12,5),(1,2)$.
Question: Are there ...
CommunityBot
- 1
2
votes
0
answers
261
views
Any counter example for this: ${\phi(2^n-1)} \bmod \tau(2^n-1)=0$ for every integer $n \geq 1$? [closed]
I asked this question here In S.E but i don't received any resposnes for it, I would like to know if it is appropriate for M.O.
I'm always interesting for properties of the following series : $ \...
CommunityBot
- 1
0
votes
1
answer
101
views
Any results on $\gcd(N^2, D(N^2))$ where $N^2$ is deficient and $D(N^2)$ is the deficiency of $N^2$?
Any results on $\gcd(N^2, D(N^2))$ where $N^2$ is deficient and
$$D(N^2)=2N^2 - \sigma(N^2)$$ is the deficiency of $N^2$?
I checked OEIS sequence A033879 and have so far been able to get hold of ...
- 9,114
-1
votes
1
answer
291
views
On odd perfect numbers $N$ given in the Eulerian form $N = {q^k}{n^2}$, Part II
I posted this question on MSE two days ago, but did not receive any responses. I have cross-posted it on MO, hoping it gets more attention here and that it is appropriate for this site.
A positive ...
CommunityBot
- 1
3
votes
1
answer
356
views
Primitive sequence $a_i$ attaining Pillai's bound on $\sum_{i} 1/a_i$
A primitive sequence $1<a_1<\ldots<a_k\leq n$ is a sequence of integers no one of which divides any other, investigated by Erdos, Behrend and others, over the last 80 years. In fact, $\max k=\...
- 10.4k
1
vote
1
answer
349
views
Is it possible to have an even superperfect number and an odd superperfect number whose product is an almost perfect number?
A number $n \in \mathbb{N}$ is said to be superperfect if
$$\sigma(\sigma(n)) = 2n.$$
A number $m \in \mathbb{N}$ is said to be almost perfect if $$\sigma(m) = 2m - 1.$$
Here is my question:
Is ...
CommunityBot
- 1
1
vote
0
answers
256
views
On even almost perfect numbers other than powers of two
(Note: This question is an improved version of and has been cross-posted from this MSE post.)
Let $\sigma(x)$ denote the sum of the divisors of $x$. If $\sigma(x) = 2x - 1$, then we call $x$ an ...
CommunityBot
- 1
0
votes
1
answer
121
views
What is the relative size of the radical of an ABC-triple relative to the number of primes up to its largest element?
Write $\bf N$ for the set of natural numbers, and $P$ for the set of primes. For $x$ in $\bf N$ let $p(x)$ be the product of the primes dividing $x$ (that is, the "radical" of $x$). Also write $\#(x)$ ...
CommunityBot
- 1