Academic literature on the topic 'Gaussian Primes numbers'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Gaussian Primes numbers.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Gaussian Primes numbers"

1

Croll, Grenville. "BiEntropy, TriEntropy and Primality." Entropy 22, no. 3 (2020): 311. http://dx.doi.org/10.3390/e22030311.

Full text
Abstract:
The order and disorder of binary representations of the natural numbers < 28 is measured using the BiEntropy function. Significant differences are detected between the primes and the non-primes. The BiEntropic prime density is shown to be quadratic with a very small Gaussian distributed error. The work is repeated in binary using a Monte Carlo simulation of a sample of natural numbers < 232 and in trinary for all natural numbers < 39 with similar but cubic results. We found a significant relationship between BiEntropy and TriEntropy such that we can discriminate between the primes and
APA, Harvard, Vancouver, ISO, and other styles
2

Mehta, Jay, and G. K. Viswanadham. "Quasi-uniqueness of the set of "Gaussian prime plus one's"." International Journal of Number Theory 10, no. 07 (2014): 1783–90. http://dx.doi.org/10.1142/s1793042114500559.

Full text
Abstract:
We recall the well-known notion of the set of uniqueness for arithmetical functions, introduced by Kátai and several other mathematicians like Indlekofer, Elliot and Hoffman, independently. We define its analogue for completely additive complex-valued functions over the set of non-zero Gaussian integers with some examples. We show that the set of "Gaussian prime plus one's" along with finitely many Gaussian primes of norm up to some constant K is a set of uniqueness with respect to Gaussian integers. This is analogous to Kátai's result in the case of positive integers [I. Kátai, On sets charac
APA, Harvard, Vancouver, ISO, and other styles
3

KUO, WENTANG, and YU-RU LIU. "GAUSSIAN LAWS ON DRINFELD MODULES." International Journal of Number Theory 05, no. 07 (2009): 1179–203. http://dx.doi.org/10.1142/s1793042109002638.

Full text
Abstract:
Let A = 𝔽q[T] be the polynomial ring over the finite field 𝔽q, k = 𝔽q(T) the rational function field, and K a finite extension of k. Let ϕ be a Drinfeld A-module over K of rank r. For a place 𝔓 of K of good reduction, write [Formula: see text], where [Formula: see text] is the valuation ring of 𝔓 and [Formula: see text] its maximal ideal. Let P𝔓, ϕ(X) be the characteristic polynomial of the Frobenius automorphism of 𝔽𝔓acting on a Tate module of ϕ. Let χϕ(𝔓) = P𝔓, ϕ(1), and let ν(χϕ(𝔓)) be the number of distinct primes dividing χϕ(𝔓). If ϕ is of rank 2 with [Formula: see text], we prove that th
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Bingrong, Jianya Liu, and Zeév Rudnick. "Gaussian primes in almost all narrow sectors." Acta Arithmetica 193, no. 2 (2020): 183–92. http://dx.doi.org/10.4064/aa190331-23-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Berrizbeitia, Pedro, and Boris Iskra. "Gaussian Mersenne and Eisenstein Mersenne primes." Mathematics of Computation 79, no. 271 (2010): 1779–91. http://dx.doi.org/10.1090/s0025-5718-10-02324-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

CHAN, TSZ HO. "A NOTE ON PRIMES IN SHORT INTERVALS." International Journal of Number Theory 02, no. 01 (2006): 105–10. http://dx.doi.org/10.1142/s1793042106000437.

Full text
Abstract:
Montgomery and Soundararajan obtained evidence for the Gaussian distribution of primes in short intervals assuming a quantitative Hardy–Littlewood conjecture. In this article, we show that their methods may be modified and an average form of the Hardy–Littlewood conjecture suffices.
APA, Harvard, Vancouver, ISO, and other styles
7

Dutch, Ken, and Christopher Maier. "Frobenius sets for conjugate split primes in the Gaussian integers." Semigroup Forum 88, no. 1 (2013): 113–28. http://dx.doi.org/10.1007/s00233-013-9505-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

HOUGH, BOB. "Summation of a random multiplicative function on numbers having few prime factors." Mathematical Proceedings of the Cambridge Philosophical Society 150, no. 2 (2010): 193–214. http://dx.doi.org/10.1017/s0305004110000514.

Full text
Abstract:
AbstractGiven a ±1 random completely multiplicative function f, we prove by estimating moments that the limiting distribution of the normalized sum converges to the standard Gaussian distribution as x → ∞ when r restricts summation to n having o(log log log x) prime factors. We also give an upper bound for the large deviations of with the sum restricted to numbers having a fixed number k of prime factors.
APA, Harvard, Vancouver, ISO, and other styles
9

Safieh, Malek, and Jürgen Freudenberger. "Montgomery Reduction for Gaussian Integers." Cryptography 5, no. 1 (2021): 6. http://dx.doi.org/10.3390/cryptography5010006.

Full text
Abstract:
Modular arithmetic over integers is required for many cryptography systems. Montgomery reduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Montgomery reduction is used for rings of ordinary integers. In contrast, we investigate the modular reduction over rings of Gaussian integers. Gaussian integers are complex numbers where the real and imaginary parts are integers. Rings over Gaussian integers are isomorphic to ordinary integer rings. In this work, we show that Montgomery reduction can be applied to Gaussian integer rings. Two algorithms for the pr
APA, Harvard, Vancouver, ISO, and other styles
10

Safieh, Malek, Johann-Philipp Thiers, and Jürgen Freudenberger. "A Compact Coprocessor for the Elliptic Curve Point Multiplication over Gaussian Integers." Electronics 9, no. 12 (2020): 2050. http://dx.doi.org/10.3390/electronics9122050.

Full text
Abstract:
This work presents a new concept to implement the elliptic curve point multiplication (PM). This computation is based on a new modular arithmetic over Gaussian integer fields. Gaussian integers are a subset of the complex numbers such that the real and imaginary parts are integers. Since Gaussian integer fields are isomorphic to prime fields, this arithmetic is suitable for many elliptic curves. Representing the key by a Gaussian integer expansion is beneficial to reduce the computational complexity and the memory requirements of secure hardware implementations, which are robust against attack
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Gaussian Primes numbers"

1

Barbosa, Fabrício de Paula Farias. "Os Inteiros Gaussianos via Matrizes." Universidade Federal da Paraíba, 2015. http://tede.biblioteca.ufpb.br:8080/handle/tede/9321.

Full text
Abstract:
Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-08-28T13:01:20Z No. of bitstreams: 1 arquivototal.pdf: 553092 bytes, checksum: 60c2a1a060ead1662c0a4edc6ec82f9c (MD5)<br>Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2017-08-28T15:55:23Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 553092 bytes, checksum: 60c2a1a060ead1662c0a4edc6ec82f9c (MD5)<br>Made available in DSpace on 2017-08-28T15:55:23Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 553092 bytes, checksum: 60c2a1a060ead1662c0a4edc6ec82f9c (MD5) Previous issue date:
APA, Harvard, Vancouver, ISO, and other styles
2

Schlackow, Waldemar. "A sieve problem over the Gaussian integers." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:b7d4ff88-1f93-41b4-9f81-055f8f1b1c51.

Full text
Abstract:
Our main result is that there are infinitely many primes of the form a² + b² such that a² + 4b² has at most 5 prime factors. We prove this by first developing the theory of $L$-functions for Gaussian primes by using standard methods. We then give an exposition of the Siegel--Walfisz Theorem for Gaussian primes and a corresponding Prime Number Theorem for Gaussian Arithmetic Progressions. Finally, we prove the main result by using the developed theory together with Sieve Theory and specifically a weighted linear sieve result to bound the number of prime factors of a² + 4b². For the application
APA, Harvard, Vancouver, ISO, and other styles
3

Ralaivaosaona, Dimbinaina. "Limit theorems for integer partitions and their generalisations." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20019.

Full text
Abstract:
Thesis (PhD)--Stellenbosch University, 2012.<br>ENGLISH ABSTRACT: Various properties of integer partitions are studied in this work, in particular the number of summands, the number of ascents and the multiplicities of parts. We work on random partitions, where all partitions from a certain family are equally likely, and determine moments and limiting distributions of the different parameters. The thesis focuses on three main problems: the first of these problems is concerned with the length of prime partitions (i.e., partitions whose parts are all prime numbers), in particular restrict
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Gaussian Primes numbers"

1

Osorio, Roberto, and Lisa Borland. "Distributions of High-Frequency Stock-Market Observables." In Nonextensive Entropy. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780195159769.003.0023.

Full text
Abstract:
Power laws and scaling are two features that have been known for some time in the distribution of returns (i.e., price fluctuations), and, more recently, in the distribution of volumes (i.e., numbers of shares traded) of financial assets. As in numerous examples in physics, these power laws can be understood as the asymptotic behavior of distributions that derive from nonextensive thermostatistics. Recent applications of the (Q-Gaussian distribution to returns of exchange rates and stock indices are extended here for individual U.S. stocks over very small time intervals and explained in terms of a feedback mechanism in the dynamics of price formation. In addition, we discuss some new empirical findings for the probability density of low volumes and show how the overall volume distribution is described by a function derived from q-exponentials. In March 1900 at the Sorbonne, a 30-year-old student—who had studied under Poincaré—submitted a doctoral thesis [2] that demonstrated an intimate knowledge of trading operations in the Paris Bourse. He proposed a probabilistic method to value some options on rentes, which were then the standard French government bonds. His work was based on the idea that rente prices evolved according to a random-walk process that resulted in a Gaussian distribution of price differences with a dispersion proportional to the square root of time. Although the importance of Louis Bachelier's accomplishment was not recognized by his contemporaries [24], it preceded by five years Einstein's famous independent, but mathematically equivalent, description of diffusion under Brownian motion. The idea of a Gaussian random-walk process (later preferably applied to logarithmic prices) eventually became one of the basic tenets of most twentieth-century quantitative works in finance, including the Black-Scholes [3] complete solution to the option-valuation problem—of which a special case had been solved by Bachelier in his thesis. In the times of the celebrated Black-Scholes solution, however, a change in perspective was already under way. Starting with the groundbreaking works of Mandelbrot [18] and Fama [11], it gradually became apparent that probability distribution functions of price changes of assets (including commodities, stocks, and bonds), indices, and exchange rates do not follow Bachelier's principle of Gaussian (or "normal") behavior.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Gaussian Primes numbers"

1

Sudarsanam, Nandan, Ramya Chandran, and Daniel D. Frey. "Conducting Non-Adaptive Experiments in a Live Setting: A Bayesian Approach to Determining Optimal Sample Size." In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-98335.

Full text
Abstract:
Abstract This research studies the use of predetermined experimental plans in a live setting with a finite implementation horizon. In this context, we seek to determine the optimal experimental budget in different environments using a Bayesian framework. We derive theoretical results on the optimal allocation of resources to treatments with the objective of minimizing cumulative regret, a metric commonly used in online statistical learning. Our base case studies a setting with two treatments assuming Gaussian priors for the treatment means and noise distributions. We extend our study through a
APA, Harvard, Vancouver, ISO, and other styles
2

Pandita, Piyush, Ilias Bilionis, and Jitesh Panchal. "Extending Expected Improvement for High-Dimensional Stochastic Optimization of Expensive Black-Box Functions." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60527.

Full text
Abstract:
Design optimization under uncertainty is notoriously difficult when the objective function is expensive to evaluate. State-of-the-art techniques, e.g., stochastic optimization or sampling average approximation, fail to learn exploitable patterns from collected data and, as a result, they tend to require an excessive number of objective function evaluations. There is a need for techniques that alleviate the high cost of information acquisition and select sequential simulations in an optimal way. In the field of deterministic single-objective unconstrained global optimization, the Bayesian globa
APA, Harvard, Vancouver, ISO, and other styles
3

Cong, Jiqing, Jianping Jing, Changmin Chen, Zezeng Dai, and Jianhua Cheng. "Joint Wavelet Transform and Time Synchronous Averaging Source Separation Method and its Application on Aero-Engine." In ASME Turbo Expo 2020: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/gt2020-14278.

Full text
Abstract:
Abstract The reliability and safety of aero-engine are often the decisive factors for the safe and reliable flight of commercial aircraft. Hence, the vibration source location and fault diagnosis of aero-engine are of prime importance to detect faults and carry out fast and effective maintenance in time. However, the vibration signals collected by the sensors arranged on the casing of the aero-engine are generally the mixed signals of the main vibration sources inside the engine, and the components are extremely complicated. Therefore, the vibration source identification is a big challenge for
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!