Skip to main content

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.

85 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
1 vote
0 answers
167 views

On "Euclidean" odd perfect numbers

In what follows, we let $N = r^s u^2$ be an odd perfect number given in Eulerian form, i.e. $r$ is the special prime satisfying $r \equiv s \equiv 1 \pmod 4$ and $\gcd(r,u)=1$. In this preprint, ...
Jose Arnaldo Bebita's user avatar
1 vote
0 answers
69 views

Shapiro inequality for divisor sets

The Shapiro inequality is the statement that if $x_1, x_2, \dots, x_n$ are positive, with $x_{n+1}=x_1, x_{n+2}=x_2$, then $$\sum_{i=1}^{n} \frac{x_i}{x_{i+1}+x_{i+2}} \geq \frac{n}{2}.$$ This can be ...
JoshuaZ's user avatar
  • 6,969
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$ ...
user142929's user avatar
1 vote
0 answers
305 views

About inequalities that involve the sum of divisors, the Euler's totient and the aliquot part $\sigma(n)-n$

In this post, for integers $n\geq 1$, I denote the sum of divisors $\sum_{1\leq d\mid n}d$ as $\sigma(n)$ and the Euler's totient function as $\varphi(n)$. It's easy to check* that if we assume that $...
user142929's user avatar
1 vote
0 answers
106 views

Lower bound on a Truncated Divisor Sum

Let $d(n)$ be the number of divisors function, i.e., $d(n)=\sum_{k\mid n} 1$ of the positive integer $n$. I am interested in estimating, the following sum $$ A(a,x)=\sum_{n\leq x} \min[ d(n), M]^a $$ ...
kodlu's user avatar
  • 10.4k
1 vote
0 answers
202 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 ...
Ahmad Jamil Ahmad Masad's user avatar
1 vote
0 answers
63 views

On the equation involving Stirling numbers of the second kind ${n\brace a}{m\brace b}={k\brace c}$, and its solutions satisfying certain requirements

In this post we denote the Stirling numbers of the second kind as ${r\brace s}$ and we consider the proposal to ask if the equation of the title has infinitely many solutions $${n\brace a}{m\brace b}={...
user142929's user avatar
1 vote
0 answers
65 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 ...
user142929's user avatar
1 vote
0 answers
56 views

Equations involving quasiperfect numbers: a first search of odd solutions for this type of equations or well succinct reasonings about these

In this post we study the following equations that involve quasiperfect numbers, denoted as $x$, that are integers such that the sum of all its positive divisors is equals to $2x+1$, and certain ...
user142929's user avatar
1 vote
0 answers
28 views

Asymptotic size for the number of terms not exceeding $n$ in the class $r$ for a classification of the type Erdös-Selfridge for square-free integers

It is possible to define a classification similar than the Erdös-Selfridge classification of primes for different sequences. Please ee [1], section A18 and the references cited in this book. Because ...
user142929's user avatar
1 vote
0 answers
207 views

On the number of solutions of $\gcd\left({2n\brace n},105\right)=1$, over integers $n\geq 1$

In this post we denote the Stirling numbers of the second kind as ${n\brace k}$. I present a variant of the problem showed in the penultimate paragraph of section B33 of [1] (see also the cited ...
user142929's user avatar
1 vote
0 answers
222 views

Attempt of exploit the equation $1/\operatorname{rad}(n)=1/2-2\varphi(n)/\sigma(n)$ in the context of even perfect numbers, and a related conjecture

It is well known that the problem concerning even perfect numbers is to prove or refute if there are infinitely many of them. Few weeks ago I wrote the following conjecture, where $\varphi(n)$ denotes ...
user142929's user avatar
1 vote
0 answers
101 views

Size of a set defined by divisor function

After some computations, I guessed the following conjecture. How can I prove or disprove it? thanks! Let $$ A(k)=\#\left\{\left(t,\frac{k+t+a}{4t-1}\right):1\leq t\leq k,\ 1\leq a\leq k+t,\ a\mid(k+...
asad's user avatar
  • 841
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 ...
Kurisuto Asutora's user avatar
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 ...
Gerhard Paseman's user avatar
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?...
user avatar
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 $$\...
Jingzhe Tang's user avatar
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,...
Turbo's user avatar
  • 13.9k
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 ...
Jose Arnaldo Bebita's user avatar
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)_{\...
მამუკა ჯიბლაძე's user avatar
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 ...
Jose Arnaldo Bebita's user avatar
1 vote
0 answers
118 views

Consecutive integers divisible by consecutive small numbers

Given $n$, what is the largest set of consecutive integers in $[n,2n]$ can we have so that each integer is divisible by a distinct element from $[\log n,2\log n]$ (no partiular order)? So apriori I am ...
Turbo's user avatar
  • 13.9k
0 votes
0 answers
55 views

If $p^k m^2$ is an odd perfect number with special prime $p$, is it possible to have $p = k$?

Denote the classical sum of divisors of the positive integer $x$ by $\sigma(x)=\sigma_1(x)$. My question is as is in the title: If $p^k m^2$ is an odd perfect number with special prime $p$, is it ...
Jose Arnaldo Bebita's user avatar
0 votes
0 answers
107 views

On improving the upper bound $I(m^2) \leq \frac{2p}{p+1}$, if $p^k m^2$ is an odd perfect number with special prime $p$

(Preamble: This question is an offshoot of this answer to an MSE question with the same title.) Denote the classical sum of the divisors of the positive integer $x$ by $\sigma(x)=\sigma_1(x)$ and the ...
Jose Arnaldo Bebita's user avatar
0 votes
0 answers
138 views

A diophantine equation involving partial sums of exponentials similar than the equation in Fermat's Last Theorem

I'm curious about the following diophantine equation from my invention: I don't know if this is in the literature, I wrote it using creativity in an attempt to write a variant of the equation in ...
user142929's user avatar
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
0 votes
0 answers
264 views

On variants of the abc conjecture in terms of Lehmer means

In this post we denote the Lehmer mean of a tuple $\text{x}$ of positive real numbers as $$L_p(\text{x})={\sum_{k=1}^nx_k^p\over\sum_{k=1}^nx_k^{p-1}},$$ see the reference Wikipedia Lehmer mean. The ...
user142929's user avatar
0 votes
0 answers
89 views

Partial sums involving Gregory coefficients that cannot be an integer

For integers $n\geq 1$ let $G_n$ be the Gregory coefficients or reciprocal logarithmic numbers, see the Wikipedia [Gregory coefficients.] (https://en.wikipedia.org/wiki/Gregory_coefficients) $${z\...
user142929's user avatar
0 votes
0 answers
64 views

On the number of solutions of the equation involving Pochhammer symbols $(n)_a\cdot(n)_b=(n)_c$, for integers greater than or equal to $2$

As paticular case of the equation involving Pochhammer symbols $$(n)_a\cdot(m)_b=(k)_c,$$ where the variables are positive integers, I've consider the case $n=m=k$ of previous equation, that is $$(n)...
user142929's user avatar
0 votes
0 answers
47 views

Approximation of $\sum_{\substack{n\geq 1\\n\text{ is abundant}}}\frac{\sigma(n)}{n^3}$, where $\sigma(n)$ denotes the sum of divisors function

Let $\sigma(n)=\sum_{1\leq d\mid n}d$ the sum of divisors function then, from the theory of Dirichlet series, it is well-known the value of $$\sum_{n=1}^\infty\frac{\sigma(n)}{n^3},$$ in terms of ...
user142929's user avatar
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 ...
Gerhard Paseman's user avatar
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\...
kodlu's user avatar
  • 10.4k
0 votes
0 answers
172 views

Sum of reciprocals of primitive sequences with distinct prime factors

In a previous mathoverflow question here a construction of a primitive sequence $1<a_1<\cdots<a_k\leq n$ formed by including all the integers in $[1,n]$ with exactly $k$ prime divisors (...
kodlu's user avatar
  • 10.4k
-4 votes
0 answers
144 views

Divisors of n and n + 1

Suppose $a$ is a proper divisor of $n$ (where $n$ is a positive integer), and $b$ a proper divisor of $n + 1$. Is there a general criterion (or general property of $n$) which enables one to conclude ...
THC's user avatar
  • 4,605
-10 votes
1 answer
556 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 ...
user142929's user avatar

1
2