subset 测验

[ˈsʌbˌsɛt]

名子集合维子集

问题 1 :

The number of distinct subsets of size k from a set of size n is or "n choose k".

subsets
subset

问题 2 :

We give a structural description of the finite subsets of an arbitrary group which obey the polynomial growth condition for some bounded and sufficiently large , showing that such sets are controlled by (a bounded number of translates of) a coset nilprogression in a certain precise sense.

subsets
subset

这个测验是动态生成的。欲了解更多测验，请刷新此页面。