Problems(4)
Machine and Cards
Source: Iran pre-preparation course examination 2011- P1
2/25/2011
We have some cards that have the same look, but at the back of some of them is written and for the others .(We can't see the back of a card so we can't know what's the number on it's back). we have a machine. we give it two cards and it gives us the product of the numbers on the back of the cards. if we have cards with on their back and cards with on their back, at least how many times we must use the machine to be sure that we get the number ? (15 points)
combinatorics proposedcombinatorics
analytic function
Source:
2/26/2011
a) prove that the function that is defined on the area , is an analytic function.b) prove that the function can be spanned to an analytic function over .c) using the span of part b show that that is the th bernoli number that is defined by generating function .
functiongeometryadvanced fieldsadvanced fields unsolved
invarient size on permutations of N
Source:
3/4/2011
suppose that is the set of all permutations of natural numbers. finite permutations are a subset of that behave like the identity permutation from somewhere. in other words bijective functions like that only for finite natural numbers , . prove that we cannot put probability measure that is countably additive on (family of all the subsets of ) that is invarient under finite permutations.
functionprobabilityprobability and stats
compressed set
Source:
2/27/2011
a) prove that for every compressed set in the space , the function that is continuous.
b) prove that we cannot cover the sphere with it's three closed sets, such that none of them contain two antipodal points.
functiongeometry3D geometryspheretopology