Results 71 to 80 of about 524 (199)
Prospects for the Use of Quasi-Mersen Numbers in the Design of Parallel-Serial Processors
It is shown that a serial-parallel processor, comparable in bit capacity to a 16-bit binary processor, can be implemented based on an algorithm built on the residue number system, a distinctive feature of which is the use of the first four quasi-Mersenne
Aruzhan Kadyrzhan +3 more
doaj +1 more source
Evaluation of an implementation intentions intervention for managing university student stress
Abstract University students consistently report high levels of stress, which has been associated with a range of adverse outcomes. Promoting adaptive coping behaviours, such as problem‐focused coping for managing university stress, is therefore a timely area of investigation.
Leah J. Rackemann +2 more
wiley +1 more source
Probable prime tests for generalized mersenne numbers
The classical Lucas-Lehmer test gives necessary and sufficient conditions for the primality of 2 p -1, p an odd prime. Such primes are called Mersenne primes.
Melham, RS
core
On the ratio of the sum of divisors and Euler’s totient function II
We find the form of all solutions to ø(n) | σ(n) with three or fewer prime factors, except when the quotient is 4 and n is ...
Qizhi Zhou +3 more
core
It is demonstrated that neuromorphic materials designed for computational tasks can be effectively implemented by drawing an analogy with trigger-based systems built upon classical binary elements.
Dina Shaltykova +4 more
doaj +1 more source
mid-pSquare: Leveraging the Strong Side-Channel Security of Prime-Field Masking in Software
Efficiently protecting embedded software implementations of standard symmetric cryptographic primitives against side-channel attacks has been shown to be a considerable challenge in practice.
Brieuc Balon +5 more
doaj +1 more source
Congruence Properties of Mersenne Primes
In this research paper, relationship between every Mersenne prime and certain Natural numbers is explored. We begin by proving that every Mersenne prime is of the form {4n + 3,for some integer 'n'} and generalize the result to all powers of 2. We also tabulate and show their relationship with other whole numbers up to 10.
Srinath, M. S. +2 more
openaire +2 more sources
Tower Mersenne Primes Are Infinitely Many
Against to Mersenne prime using Proposition transformation method, based on Euler’s function and n order remainder theorem,the au?thors have proved that the necessary and sufficient condition for that module M has primitive root is that x in the equation
唐子周
core +1 more source
Algebraic divisibility sequences over function fields [PDF]
In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields ...
Mahe, Valery +14 more
core +1 more source
Electronic Fourier–Galois Spectrum Analyzer for the Field GF(31)
A scheme for the Fourier–Galois spectrum analyzer for the field GF(31) is proposed. It is shown that this analyzer allows for solving a wide enough range of problems related to image processing, in particular those arising in the course of experimental ...
Kaisarali Kadyrzhan +5 more
doaj +1 more source

