All Questions
7 questions
4
votes
1
answer
263
views
Divisibility relation with a specific sum of divisors
Let $\sigma(n)$ be the sum of the divisors of $n$. Is it always true that if $n$ is odd, that $$n\mid\sum_{k=1}^{\frac{n-1}{2}}k^2\sigma(k)\sigma(n-k)?$$
I have checked this up to $n=100$, and I ...
6
votes
1
answer
360
views
Factors of polynomials of bounded height
Let $f(x)=a_nx^n+\cdots+a_0 \in \mathbb{Z}[x]$ be an integer polynomial in one variable. Recall that the height $H(f):=\textrm{max}\,|a_n|$ is the largest coefficient. Consider the set of polynomials ...
10
votes
7
answers
2k
views
Getting a bound on the coefficients of the factor polynomial
Suppose $f(x):=a_0+a_1x+\cdots+a_nx^n$ is a polynomial in $\mathbb{Z}[x]$ and $|a_i|\leq M$ for each $i=0,\ldots ,n.$ Now suppose $g(x)$ is a factor of $f(x)$ in $\mathbb{Z}[x]$, then is it possible ...
9
votes
0
answers
695
views
Van der Pol's identity for the sum of divisors and a quartic polynomial equation for odd perfect numbers
In Touchard (1953) it is mentioned that the sum of divisors $\sigma(n)$ satisfies the following recurrence relation ($n>1$):
$$n^2(n-1) = \frac{6}{\sigma(n)} \sum_{k=1}^{n-1}(3n^2-10k^2)\sigma(k)\...
0
votes
1
answer
140
views
Diophantine equations that involve cubes and the volume of square frustums
This week I wondered about diophantine problems that involve the volume of certain cubes and frustums, see the Wikipedia Frustum. I wondered if each one of these problems have infinitely many ...
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 ...
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?...