Results 31 to 40 of about 7,405,970 (315)
On the quadratic residues and their distribution properties
Open Mathematics, 2023 The main purpose of this article is to use elementary methods and properties of classical Gauss sums to determine identities for the number of residue systems of aa mod pp such that aa, a+a¯a+\bar{a}, and a−a¯a-\bar{a} are all quadratic residues ...
Liu Xiaoge, Meng Yuanyuan
doaj +1 more source
Supervised Machine Learning Classification for Short Straddles on the S&P500
Risks, 2022 In this paper, we apply machine learning models to execute certain short-option strategies on the S&P500. In particular, we formulate and focus on a supervised classification task which decides if a plain short straddle on the S&P500 should be executed ...
Alexander Brunhuemer +5 more
doaj +1 more source
Mod-Poisson convergence in probability and number theory [PDF]
, 2009 Building on earlier work introducing the notion of "mod-Gaussian" convergence of sequences of random variables, which arises naturally in Random Matrix Theory and number theory, we discuss the analogue notion of "mod-Poisson" convergence.
Arratia +22 more
core +2 more sources
Using Spreadsheets to Enhance Understanding of Number Theory [PDF]
, 2019 Computer spreadsheets can help elementary school students explore concepts in number theory. We describe a spreadsheet program that can generate all the factors of an integer.
Ploger, Don, Toussaint, Mario
core +1 more source
Journal of Formalized Reasoning, 2008 We discuss the formalization, in the Matita Interactive Theorem Prover, of a few elementary results in number theory about the Moebius mu function and the Euler phi function.
ASPERTI, ANDREA, C. Armentano
openaire +4 more sources
Instanton Number of Noncommutative U(n) gauge theory [PDF]
, 2002 We show that the integral of the first Pontrjagin class is given by an integer and it is identified with instanton number of the U(n) gauge theory on noncommutative ${\bf R^4}$.
A. Connes +23 more
core +2 more sources
On the number of decomposable trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A tree is called $k$-decomposable if it has a spanning forest whose components are all of size $k$. Analogously, a tree is called $T$-decomposable for a fixed tree $T$ if it has a spanning forest whose components are all isomorphic to $T$. In this paper,
Stephan G. Wagner
doaj +1 more source
The Complexity of Number Theory
, 2020 The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. This is known as the strong Goldbach's conjecture.
openaire +5 more sources
Crystal constructions in Number Theory
, 2018 Weyl group multiple Dirichlet series and metaplectic Whittaker functions can be described in terms of crystal graphs. We present crystals as parameterized by Littelmann patterns and we give a survey of purely combinatorial constructions of prime power ...
A Berenstein +36 more
core +1 more source
Perturbed Keplerian Hamiltonian Systems
International Journal of Differential Equations, 2023 This paper deals with a class of perturbation planar Keplerian Hamiltonian systems, by exploiting the nondegeneracy properties of the circular solutions of the planar Keplerian Hamiltonian systems, and by applying the implicit function theorem, we show ...
Riadh Chteoui
doaj +1 more source