中文
相关论文

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

200 篇论文

In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…

数论 · 数学 2023-03-08 Nabiha Saba , Ali Boussayoud

We study the connection between the Mersenne numbers $M(n) = 2^n-1$ and the dynamics of the angle-doubling map. Within this framework, we develop an algorithm to compute divisors of Mersenne numbers without explicitly evaluating $M(n)$.…

数论 · 数学 2026-05-29 Lluís Alsedà , Antonio Garijo , Xavier Jarque

Years ago, Zeev Rudnick defined the Poisson generic real numbers by counting the number of occurrences of long blocks of digits in the initial segments of the expansions of the real numbers in a fixed integer base. Peres and Weiss proved…

数论 · 数学 2022-08-16 Nicolás Álvarez , Verónica Becher , Martín Mereb

Generalised Morrey (function) spaces enjoyed some interest recently and found applications to PDE. Here we turn our attention to their discrete counterparts. We define generalised Morrey sequence spaces…

泛函分析 · 数学 2025-02-20 Dorothee D. Haroske , Leszek Skrzypczak

We get some results about the factorization of $\phi_p(M) \in {\mathbb{F}}_2[x]$, where $p$ is a prime number, $\phi_p$ is the corresponding cyclotomic polynomial and $M$ is a Mersenne prime (polynomial). By the way, we better understand…

数论 · 数学 2021-06-21 Luis H. Gallardo , Olivier Rahavandrainy

The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…

数值分析 · 数学 2012-02-07 Durmuş Bozkurt

We introduce a new class of pseudoprimes-so called "overpseudoprimes to base $b$", which is a subclass of strong pseudoprimes to base $b$. Denoting via $|b|_n$ the multiplicative order of $b$ modulo $n$, we show that a composite $n$ is…

Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.

数论 · 数学 2019-10-08 Gérald Tenenbaum

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$

群论 · 数学 2018-09-05 Paul Bradley

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

数论 · 数学 2017-07-20 Ivan Blanco-Chacon , Gary McGuire , Oisin Robinson

In this article, we consider weighted sums of generalized polygonal numbers with coefficients $1$ or $2$. We show that for any $m\ge10$, those weighted sums of generalized $m$-gonal numbers represent every non-negative integers if they only…

数论 · 数学 2022-01-11 Daejun Kim

We give a formula for the density of $0$ in the sequence of generalized Motzkin numbers, $M^{a, b}_n$, modulo a prime, $p$, in terms of the first $p$ generalized central trinomial coefficients $T^{a, b}_n\bmod p$ (with $n<p$). We apply our…

组合数学 · 数学 2025-01-20 Nadav Kohen

We study whether sufficiently large integers can be written in the form cp+T_x, where p is either zero or a prime congruent to r mod d, and T_x=x(x+1)/2 is a triangular number. We also investigate whether there are infinitely many positive…

数论 · 数学 2009-02-08 Zhi-Wei Sun

We give several characterizations of Mersenne primes (Theorem 1.1) and of primes for which 2 is a primitive root (Theorem 1.2). These characterizations involve group algebras, circulant matrices, binomial coefficients, and bipartite graphs.

数论 · 数学 2015-06-15 Sunil K. Chebolu , Keir Lockridge , Gaywalee Yamskulna

Define $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$ for $n=0,1,2,...$. Those numbers $g_n=g_n(1)$ are closely related to Ap\'ery numbers and Franel numbers. In this paper we establish some fundamental congruences involving $g_n(x)$. For…

数论 · 数学 2016-07-20 Zhi-Wei Sun

In this paper we study Gaussian ring $\Z[i]$ with a focus on representing Gaussian Mersenne primes $G_p$ in the form $x^2+7y^2$. Interestingly when such a form exists, one can observe that, $x\equiv \pm 1\pmod{8}$ and $y\equiv 0\pmod{8}$.…

数论 · 数学 2014-09-23 Sushma Palimar , Ambedkar Dukkipati

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

数论 · 数学 2023-05-25 Ben Kane , Zichen Yang

For any $m\ge3$, every integer of the form $p_m(x)=\frac{(m-2)x^2-(m-4)x}2$ with $x \in \z$ is said to be a generalized $m$-gonal number. Let $a\le b\le c$ be positive integers. For every non negative integer $n$, if there are integers…

数论 · 数学 2009-11-09 Byeong-Kweon Oh

The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenne primes in the form $x^{2}+7y^{2}$. It…

数论 · 数学 2012-05-03 Sushma Palimar , Shankar B. R

For $m=3,4,\ldots$ those $p_m(x)=(m-2)x(x-1)/2+x$ with $x\in\mathbb Z$ are called generalized $m$-gonal numbers. Sun [13] studied for what values of positive integers $a,b,c$ the sum $ap_5+bp_5+cp_5$ is universal over $\mathbb Z$ (i.e., any…

数论 · 数学 2016-06-24 Fan Ge , Zhi-Wei Sun