大师作文网关于北美数学竞赛题..因为实在做不出来,甚至题目的意思也没搞懂,
来源：学生作业帮 编辑：大师作文网作业帮 分类：英语作业 时间：2024/11/14 12:07:33
关于北美数学竞赛题..因为实在做不出来,甚至题目的意思也没搞懂,
1.A betting company ofers the possibility to bet on any of the n contestants in a race,with odds a 1,...,a n,respectively.
This means that if you bet X dollars on contestant j (where X is any positive real number),then:
• If contestant j loses,you lose your X dollars.
• If contestant j wins,you get your X dollars back,together with a profit of a jX dollars.
If the company does not choose the odds wisely,it may be possible to bet on all of the contestants in a manner that
guarantees a profit no matter what.For instance,if there are 3 contestants with odds 2,2,and 10,you could bet $1 on
each of the first two and $0.50 on the the third one,guaranteeing a profit no matter who wins the race.
(a) What relation must the real numbers a 1,...,a n satisfy so that it is impossible to guarantee a profit in this way?
(b) What is the largest profit that you can guarantee on a total bet of $1 if the relation is NOT satisfied?
2.The function f is defined on the positive integers by the formulas
f (1) = 1,
f (2n) = 2 f (n) + 2n,
nf (2n + 1) = (2n + 1) f (n)
for all n 1.
(a) Prove that f (n) is always an integer.
(b) For what values of n does the equality f (n) = n hold?(Be sure to prove that no other value works.)
3.(Proposed by Michael Wu,a student at Mathcamp 2009 & 2010.) There are n children equally spaced around a merry-
go-round with n seats,waiting to get on.The children climb onto the merry-go-round one by one (but not necessarily
going in order around the circle),always using the seat in front of them and only taking a seat if it is empty.After one
child climbs on and takes a seat,the merry-go-round rotates 360/n degrees counterclockwise so that each remaining
child is again lined up with a seat.For what values of n is it possible for the children to climb on,in some order,so that
everyone gets a seat?(Do remember to prove both that it's possible for the values you claim and that it's impossible for
all other values.)
1.A betting company ofers the possibility to bet on any of the n contestants in a race,with odds a 1,...,a n,respectively.
This means that if you bet X dollars on contestant j (where X is any positive real number),then:
• If contestant j loses,you lose your X dollars.
• If contestant j wins,you get your X dollars back,together with a profit of a jX dollars.
If the company does not choose the odds wisely,it may be possible to bet on all of the contestants in a manner that
guarantees a profit no matter what.For instance,if there are 3 contestants with odds 2,2,and 10,you could bet $1 on
each of the first two and $0.50 on the the third one,guaranteeing a profit no matter who wins the race.
(a) What relation must the real numbers a 1,...,a n satisfy so that it is impossible to guarantee a profit in this way?
(b) What is the largest profit that you can guarantee on a total bet of $1 if the relation is NOT satisfied?
2.The function f is defined on the positive integers by the formulas
f (1) = 1,
f (2n) = 2 f (n) + 2n,
nf (2n + 1) = (2n + 1) f (n)
for all n 1.
(a) Prove that f (n) is always an integer.
(b) For what values of n does the equality f (n) = n hold?(Be sure to prove that no other value works.)
3.(Proposed by Michael Wu,a student at Mathcamp 2009 & 2010.) There are n children equally spaced around a merry-
go-round with n seats,waiting to get on.The children climb onto the merry-go-round one by one (but not necessarily
going in order around the circle),always using the seat in front of them and only taking a seat if it is empty.After one
child climbs on and takes a seat,the merry-go-round rotates 360/n degrees counterclockwise so that each remaining
child is again lined up with a seat.For what values of n is it possible for the children to climb on,in some order,so that
everyone gets a seat?(Do remember to prove both that it's possible for the values you claim and that it's impossible for
all other values.)
第一题：
有关博彩收益问题：对n个选手,每个人的赔率为a1、a2.an,如果你给m选手下注x美元,若m选手输了,你损失x元,若赢了,你将获得返回的下注本钱x,外加am*x的奖金.例如三个选手,赔率分别为2、2、10,你可以分别下注1、1、0.5,那么不管谁赢,你都能只赚不赔（收益分别为1+2*1=3、1+2*1=3和0.5+10*0.5=5.5,均大于你的支出2.5元）.
问题来了：
1.如何确定a1、a2.an应满足的大小关系,从而保证只赚不赔的情况不出现?（要不博彩公司早关门大吉了）
2.当第一问的关系不满足时,如何用1美元获得最大的收益?
1.首先分析只赚不赔的关系
假设分别对第m个队员投注bm元,总投注S元,则应满足如下关系：
bm+am*bm>b1+b2+...+bn m=1,2...n
即am>(S-bm)/bm m=1,2...n
累加得 ∑am*bm>(n-1)S,
不失一般性,令S=1,0
有关博彩收益问题：对n个选手,每个人的赔率为a1、a2.an,如果你给m选手下注x美元,若m选手输了,你损失x元,若赢了,你将获得返回的下注本钱x,外加am*x的奖金.例如三个选手,赔率分别为2、2、10,你可以分别下注1、1、0.5,那么不管谁赢,你都能只赚不赔（收益分别为1+2*1=3、1+2*1=3和0.5+10*0.5=5.5,均大于你的支出2.5元）.
问题来了：
1.如何确定a1、a2.an应满足的大小关系,从而保证只赚不赔的情况不出现?（要不博彩公司早关门大吉了）
2.当第一问的关系不满足时,如何用1美元获得最大的收益?
1.首先分析只赚不赔的关系
假设分别对第m个队员投注bm元,总投注S元,则应满足如下关系：
bm+am*bm>b1+b2+...+bn m=1,2...n
即am>(S-bm)/bm m=1,2...n
累加得 ∑am*bm>(n-1)S,
不失一般性,令S=1,0