CS 207: Discrete Structures
Abstract algebra and Number theory
Lagranges theorem and its proof
Lecture 39
Oct 29 2015
1
Relating the size of a group and its subgroups
Theorem (Lagrange)
If H is a subgroup of a nite group G, then |H| divides |G|.
2
Relati

Question 1 (1 point)
What is the tightest bound possible (from the possible choices) for f(n)?
f(n) = n*log(n^2) + n
Question 1 options:
O(2^n)
O( (n^2) * log n )
O(n)
O(n log n)
O(n^2)
COMMENTSTightest bound means a function g(n) such that f(n)<c.g(n) fo

Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner