Results 31 to 40 of about 4,959 (254)
An adaptive cryptosystem on a Finite Field [PDF]
Owing to mathematical theory and computational power evolution, modern cryptosystems demand ingenious trapdoor functions as their foundation to extend the gap between an enthusiastic interceptor and sensitive information.
Awnon Bhowmik, Unnikrishnan Menon
doaj +2 more sources
Local analytic solutions to some nonhomogeneous problems with $p$-Laplacian
Applying the Briot-Bouquet theorem we show that there exists an unique analytic solution to the equation $\left( t^{n-1}\Phi _{p}\left( y^{\prime}\right) \right) ^{\prime }+(-1)^{i}t^{n-1}\Phi _{q}(y)=0$, on $(0,~a)$, where $\Phi _{r}(y):=\left\vert y ...
Gabriella Bognár
doaj +1 more source
Combinatorial Models of the Distribution of Prime Numbers
This work is divided into two parts. In the first one, the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial ...
Vito Barbarani
doaj +1 more source
Weighted Prime Number Theorem on Arithmetic Progressions with Refinements
We present an extension of the Dirichlet-type prime number theorem to weighted counting functions, the importance of which has recently been recognized for formulating Chebyshev’s bias.
Koji Shimada, Shin-ya Koyama
doaj +1 more source
Formalization of the prime number theorem and Dirichlet's theorem [PDF]
We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $π(x)$ of primes less than $x$ is asymptotic to $x/\log x$, within the proof system Metamath.
openaire +2 more sources
A Joint Elliott Type Theorem for Twists of L-Functions of Elliptic Curves
We consider a collection of L-functions of elliptic curves twisted by a Dirichlet character modulo q (q is a prime number), and prove for this collection a joint limit theorem for weakly convergent probability measures in the space of analytic functions ...
Virginija Garbaliauskienė +1 more
doaj +1 more source
Determining the exact number of primes at large magnitudes is computationally intensive, making approximation methods (e.g., the logarithmic integral, prime number theorem, Riemann zeta function, Chebyshev’s estimates, etc.) particularly valuable.
Timothy Ganesan
doaj +1 more source
A flexure‐based variable stiffness structure is developed by integrating phase‐change modulation and adhesive interfacial locking of gallium. The design enables a wide stiffness variability, transitioning from soft, flexible behavior to rigid, load‐supporting performance.
Sungjin Kim +2 more
wiley +1 more source
Multimodal Data‐Driven Microstructure Characterization
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
The Pjateckiĭ-S̆apiro prime number theorem
It is proved that the sequence [nc] contains the expected number of primes whenever 1 < c < 1.1404…, thus improving Kolesnik's range 1 < c < 1.1111…. An identity of Vaughan's type in five variables is needed.
openaire +2 more sources

