Skip to search formSkip to main contentSkip to account menu

Lagrange's theorem (number theory)

Known as: Lagrange (disambiguation), Lagrange theorem (number theory), Lagrange's theorem 
In number theory, Lagrange's theorem is a statement named after Joseph-Louis Lagrange about how frequently a polynomial over the integers may… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Lagrange's theorem for Hom-Groups
Hom-groups are nonassociative generalizations of groups where the unitality and associativity are twisted by a map. We show that… 
2018
2018
Creativity of Pre-service Teachers in Problem Posing
Problem posing and technology are attracting the attention of mathematics educators because of their potential to affect… 
2017
2017
Lagrange's Theorem for Binary Squares
We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things… 
Review
2011
Review
2011
Self-control inhibits aggression.
Aggression brings tremendous costs to individuals, relationships, and society. Yet, people behave aggressively toward strangers… 
Highly Cited
2001
Highly Cited
2001
Constrained Principal Component Analysis: A Comprehensive Theory
Abstract. Constrained principal component analysis (CPCA) incorporates external information into principal component analysis… 
2001
2001
A History of Lagrange's Theorem on Groups
(2001). A History of Lagrange's Theorem on Groups. Mathematics Magazine: Vol. 74, No. 2, pp. 99-108. 
1993
1993
Subgroups and the partitioning property
Lagrange's theorem states that the order of a subgroup H of a finite group G divides the order of G. The key step in the standard… 
Highly Cited
1984
Highly Cited
1984
Fuzzy normal subgroups and fuzzy cosets
1980
1980
Lagrange’s theorem with ^{1/3} squares
For every N > 1 we construct a set A of squares such that |A| x and so A(x) > x1/4. In 1770, Lagrange proved that every integer… 
Highly Cited
1974
Highly Cited
1974
Moufang loops of small order. I
The main result of this paper is the determination of all nonassociative Moufang loops of orders *31. Combinatorial type methods… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)