Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
1 answer
208 views

Representation of a number as a product of $\sqrt{n^2 + 1} + n$

Question. Do there exist two multisets $A, B$ consisting of positive integer numbers such that $|A|$ and $|B|$ have different parity and $$ \prod_{n\in A}(n + \sqrt{n^2 + 1}) = \prod_{m\in B}(m + \...
Pavel Gubkin'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
3 votes
0 answers
171 views

The kronecker symbol and factorization of $n=\frac{B^N-1}{B-1}$

Let $n=\frac{B^N-1}{B-1}$. Assume $n$ is congruent to 3 modulo 4. We have the following: If $N$ is 1 modulo 4, then $N$ is quadratic residue modulo $n$ and $-N$ is quadratic non-residue. The square ...
joro's user avatar
  • 25.4k
1 vote
1 answer
186 views

Around a characterization for even perfect numbers, similar than Euclides-Euler theorem, in terms of totatives

In this post we denote the sum of divisors function as $$\sigma(n)=\sum_{1\leq d\mid n}d,$$ then an even perfect number is a positive integer $n\equiv 0\text{ mod }2$ for which $\sigma(n)=2n.$ As ...
user142929's user avatar
2 votes
1 answer
231 views

Equations involving arithmetic functions of primorials

Let $\sigma(n)=\sum_{1\leq d\mid n}d$ the sum of divisors, $\varphi(n)$ the Euler's totient function and we denote the primorial $\prod_{k=1}^n p_k$ as $N_n$, where $p_k$ denotes the $k$-th prime ...
user142929's user avatar
4 votes
0 answers
185 views

Near Pochhammer symbols: the equation $(n)_m-(k)_l=2$ for integers greater than or equal to two

In this post I consider the following equation involving Pochhammer symbols, $$(n)_m-(k)_l=2\tag{1}$$ for positive integers $n\geq 2$ and $k\geq 2$, and positive integers $m\geq 2$ and $l\geq 2$. ...
user142929's user avatar
-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 ...
Jose Arnaldo Bebita's user avatar
9 votes
2 answers
1k views

runs of consecutive non squarefree integers

This question gained no attention at Math SE. Call a sequence of $k$ consecutive naturals squary if each one of them is divided by a square > 1. The Chinese Remainder theorem trivially guarantees us ...
Wolfgang's user avatar
  • 13.4k
17 votes
0 answers
420 views

Do the coefficients of these irreducible polynomials always become periodic?

Fix $n\in\mathbb N$ and a starting polynomial (or seed) $p_n=a_0+a_1x+\dots+a_nx^n$ with $a_k\in\mathbb Z\ \forall k$ and $a_0a_n\ne0$. Define $p_{n+1},p_{n+2},\dots$ recursively by $p_r = p_{r-1}+...
Wolfgang's user avatar
  • 13.4k
7 votes
1 answer
303 views

Large gaps between consecutive irreducible polynomials with small heights

For a prime gap of length at least $n$, a trivial upper bound for its first occurrence is $N=n!$ or $N=lcm(2,\dots,n)$. A bit better is $N=p_1\cdots p_n$ where $p_k$ is the $k$th prime, as then $N+2,\...
Wolfgang's user avatar
  • 13.4k