Results 31 to 40 of about 21,735,665 (352)
IEEE potentials, 1989 Number theory, an abstract branch of mathematics that deals with relationships between whole numbers, has provided highly useful answers to numerous real-world problems.
Don Redmond
semanticscholar +1 more source
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
Graduate Studies in Mathematics, 1992 Notation Introduction 1. Algebraic foundations 2. Dedekind domains 3. Extensions 4. Classgroups and units 5. Fields of low degree 6. Cyclotomic fields 7. Diophantine equations 8. L-functions Appendices Exercises Glossary of theorems Index.
James S. Milne
semanticscholar +1 more source
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
Algorithms in Number Theory [PDF]
, 1990 Publisher Summary This chapter discusses algorithms that solve two basic problems in computational number theory—factoring integers into prime factors and finding discrete logarithms. In the factoring problem, one is given an integer n 1 and is asked to find the decomposition of n into prime factors.
Lenstra, H.W., Lenstra, A.K.
openaire +4 more sources
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
Impulse Propagation in Compositions and Words
International Journal of Mathematics and Mathematical Sciences, 2021 We consider compositions of n represented as bargraphs and subject these to repeated impulses which start from the left at the top level and destroy horizontally connected parts.
Margaret Archibald +4 more
doaj +1 more source