Results 31 to 40 of about 377,673 (186)
Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission
This paper proposes a code defined on a finite ring ℤpM, where pM = 2m−1 is a Mersenne prime, and m is a binary size of ring elements. The code is based on a splitting sequence (splitting set) S, defined for the given multiplier set E=±20, ±21,…, ±2m−1 ...
Dragana Bajić +2 more
doaj +1 more source
ON THE LARGEST PRIME FACTOR OF THE MERSENNE NUMBERS [PDF]
AbstractLetP(k) be the largest prime factor of the positive integerk. In this paper, we prove that the seriesis convergent for each constantα<1/2, which gives a more precise form of a result of C. L. Stewart [‘On divisors of Fermat, Fibonacci, Lucas and Lehmer numbers’,Proc. London Math. Soc.35(3) (1977), 425–447].
Ford, Kevin +2 more
openaire +2 more sources
Sequences in finite fields yielding divisors of Mersenne, Fermat and Lehmer numbers, I [PDF]
The aim of this work is to present a method using the cyclic sequences {Mₖ},{θₜₖ} and {ψₜₖ} in the finite fields 𝔽_ρ, with ρ a prime, that yield divisors of Mersenne, Fermat and Lehmer numbers.
A. M. S. Ramasamy
doaj +1 more source
General Solution of the Diophantine equation involving Mersenne Prime [PDF]
In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers.
Ghosh, Arkabrata
core +1 more source
Some new results on the largest cycle consisting of quadratic residues [PDF]
The length of the largest cycle consisting of quadratic residues of a positive integer n is denoted by L(n). In this paper, we have obtained a formula for finding L(p), where p is a prime. Also, we attempt to characterize a prime number p in terms of the
Prabin Das, Pinkimani Goswami
doaj +1 more source
Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms
Starting with the fundamental work of D.E.Muller in 1954, the polynomial representations of Boolean functions are widely investigated in connection with the theory of coding and for the synthesis of circuits of digital devices.
A.S. Baliuk
doaj +1 more source
Rocking and Rolling of Rigid Polygons Under Seismic Excitation
ABSTRACT We present an event driven analytical framework for rigid cyclic polygons subjected to horizontal ground excitation in which uplift, impact, and successive pivot switching are treated within a unified non‐smooth dynamical description. Rolling is defined as a sequence of energetically admissible transitions between neighbouring vertices tied to
Atif Rasheed +1 more
wiley +1 more source
Abstract Producers have an interest in mitigating yield and profit penalties associated with stand loss. When damage occurs early in the growing season, producers may opt to replant corn (Zea mays L.) to recoup potential yield losses. Likewise, producers could opt against replanting and accept the loss.
Jennifer Sublett +6 more
wiley +1 more source
Marin Mersenne’s mathematical contributions helped paved the way for advances in mathematics. In this article, his life is not only depicted but his mathematical intellect is highlighted through his achievements.
Fryer, Joseph, Detro, Casey
core +1 more source
Abstract In global forensic literature, methods for estimating age in young individuals are more commonly addressed than those applicable to adults. This trend is also evident in Brazil. This study aimed to evaluate the performance of the DRNNAGE software for age estimation in Brazilian identified human skeletons. The sample consisted of 400 skeletons (
André Marquim Nogueira da Fonte Cornélio +6 more
wiley +1 more source

