相关论文: Generalized Mersenne Numbers of the form $cx^2$

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

According to the Wagstaff heuristic, the probability that a Mersenne number $M_p = 2^p-1$ is prime mainly depends on the size of the exponent $p$. We investigate whether the secondary arithmetic structure in $p-1$ is linked to noticeable…

For each $1 \leq p \leq \infty$, let $W_{p}(\mathbb{R}) = \left\{ f \in L^p(\mathbb{R}): \hat{f} \in L^{p^\prime}(\mathbb{R}) \right\}$ with norm $||f||_{W_{p}(\mathbb{R})} = ||\hat{f}||_{L^{p^\prime}(\mathbb{R})}$. Moreover, let $ \Gamma =…

We refine a recent result of Parsell on the values of the form $\lambda_1p_1 + \lambda_2p_2 + \mu_1 2^{m_1} + ...m + \mu_s 2^{m_s}, $ where $p_1,p_2$ are prime numbers, $m_1,...c, m_s$ are positive integers, $\lambda_1 / \lambda_2$ is…

Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider…

Let $n,r,k,s$ be positive integers with $n,k\ge 2$. The generalized Ramsey number $R(n,r;k,s)$ is the smallest positive integer $p$ such that for every graph $G$ of order $p$, either $G$ contains a subgraph induced by $n$ vertices with at…

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…

In this paper, we define Gaussian generalized Tetranacci numbers and as special cases, we investigate Gaussian Tetranacci and Gaussian Tetranacci-Lucas numbers with their properties.

In this note, we extend to a composite modulo a recent result of Chan (2016) dealing with mean values of the product of an integer and its multiplicative inverse modulo a prime number.

Let $p$ be a primer number, $n \geq 3$ and integer. Let $f(X) = X^n + a_{n-1}X^{n-1} + \cdots +a_1 X + a_0 \in \mathbb{F}_p[X]$ be a primitive polynomial of degree $n$. Let $C_f$ be the companion matrix of $f(X)$, and $G$ the companion…

We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite $m$-generated Moufang loops of exponent $p^n$.

Recently, Marko and Litvinov (ML) conjectured that, for all positive integers $n$ and $p$, the $p$-th power of $n$ admits the representation $n^p = \sum_{\ell =0}^{p-1} (-1)^{l} c_{p,\ell} F_{n}^{p-\ell}$, where $F_{n}^{p-\ell}$ is the…

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

For each integer $x$, the $x$-th generalized pentagonal number is denoted by $P_5(x)=(3x^2-x)/2$. Given odd positive integers $a,b,c$ and non-negative integers $r,s$, we employ the theory of ternary quadratic forms to determine when the sum…

In this paper, we consider sums of three generalized $m$-gonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restrictions on $m$ modulo $30$, we show that a density one set of…

Let $b\geq 2$ be an integer. We call an integer $k$ a $b$-Sierpi\'{n}ski number if $\gcd(k+1,b-1)=1$ and $k\cdot b^n+1$ is composite for all positive integers $n$. We similarly call $k$ a $b$-Riesel number if $\gcd(k-1,b-1)=1$ and $k\cdot…

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

In this paper, we show that certain sums of generalized $m$-gonal numbers represent every positive integer if and only if they represent every positive integer up to an explicit bound $C_m$, verifying a conjecture of Sun for sufficiently…

We prove that a multiplicative subgroup $A_k$ of $\mathbb{Z}_p^*$ is a generalized arithmetic progression if and only if $|A_k| = 2,\ 4,$ or $p-1$. Much of the argument is built upon recent work studying additive decompositions of subgroups…

Consider a mean-reverting equation, generalized in the sense it is driven by a 1-dimensional centered Gaussian process with H\"older continuous paths on $[0,T]$ ($T > 0$). Taking that equation in rough paths sense only gives local existence…