相关论文: Squares in (2^2-1)...(n^2-1) and p-adic valuation

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…

In the present paper we show that there exist infinitely many consecutive square-free numbers of the form $[\alpha n]$, $[\alpha n]+1$, where $\alpha>1$ is irrational number with bounded partial quotient or irrational algebraic number.

For an integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j+n is a perfect square for all 0<i<j<m+1, is called a D(n)-m-tuple. In this paper, we show that there are infinitely many essentially different…

In this document will be proved a formula to compute the $p$-adic valuation of a hyperfactorial. We call a hyperfactorial the result of multiplying a given number of consecutive integers from 1 to the given number,each raised to its own…

The p-adic valuation of a polynomial can be given by its valuation tree. This work describes the 2-adic valuation tree of the general degree 2 polynomial in 2 variables.

In this paper we show that there exist infinitely many square-free numbers of the form $n^2+n+1$. We achieve this by deriving an asymptotic formula by improving the reminder term from previous results.

This paper investigates the p-adic valuation trees of degree-2 and degree-3 polynomials in two variables over any prime p, building upon prior research outlined in [14].

Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…

In this article, we study short intervals that contain another type of "almost square", an integer $n$ which can be factored in two different ways $n = a_1 b_1 = a_2 b_2$ with $a_1, a_2, b_1, b_2$ close to $\sqrt{n}$.

The 2-adic valuation of the Stirling numbres is examined. We conjecture pattrens about the distributions of these valuations in residue classes modulo powers of 2.

Suppose $k$ is a positive integer. In this work, we establish formulas for for the number of representations of integers by the quadratic forms $$ x_{1}^{2}+\cdots+x_{k}^{2}+l\left(x_{k+1}^{2}+\cdots+x_{2k}^{2}\right) $$ for $l\in\{2,4\}$.

We present an exact formula for the number of distinct crease patterns in a square shaped region of a given size that appear in the 2 dimensional paperfolding structure.

We show that in any subset of the vertices of $n$-dimensional cube that contains at least $2^{n-1}+1$ vertices ($n\geq 4$), there are four vertices that induce a claw, or there are eight vertices that induce the cycle of length eight.

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

We generalize results on the $p$-adic valuations of $S(n,k)$, the Stirling number of the second kind and $s(n,k)$ the Stirling number of the first kind. We have several new estimates for these valuations, along with criteria for when the…

We say that $S\subset\mathbb Z$ is a set of $k$-recurrence if for every measure preserving transformation $T$ of a probability measure space $(X,\mu)$ and every $A\subseteq X$ with $\mu(A)>0$, there is an $n\in S$ such that $\mu(A\cap…

For each even classical pretzel knot $P(2k_1+1,2k_2+1,2k_3)$, we determine the character variety of irreducible ${\rm SL}(2,\mathbb{C})$-representations, and clarify the steps of computing its A-polynomial.

We show that the $p$-adic valuation of the sequence of Fibonacci numbers is a $p$-regular sequence for every prime $p$. For $p \neq 2, 5$, we determine that the rank of this sequence is $\alpha(p) + 1$, where $\alpha(m)$ is the restricted…

Let F(n) be a polynomial of degree at least 2 with integer coefficients. We consider the products N_x=\prod_{1 \le n \le x} F(n) and show that N_x should only rarely be a perfect power. In particular, the number of x \le X for which N_x is…

We prove that the number of vertices of a polytope of a particular kind is exponentially large in the dimension of the polytope. As a corollary, we prove that an n-dimensional centrally symmetric polytope with O(n) facets has 2^{Omega(n)}…