跳到主要内容

2014-2015学年下学期期末

2014-2015学年下学期期末试卷(A)

一、(8 分)

Complete the following questions:

Premises:

If Kristi swims every day or walks every day, then her cholesterol(胆固醇)drops.

If her cholesterol drops, then she feels better.

She does not feel better.

Conclusion: Kristi does not walk every day.

(Let SS = "Kristi swims every day."

Let WW = "Kristi walks every day."

Let CC = "Kristi's cholesterol drops"

Let FF = "Kristi feels better".)

Questions:

a) Translating premises and conclusion into logical expressions.

b) Show that conclusion.


二、(7 分)

Suppose that gg is a function from AA to BB and ff is a function from BB to CC.

1). Show that if both ff and gg are one-to-one, then fgf\circ g is also one-to-one.

2). Show that if both ff and gg are onto, then fgf\circ g is also onto.


三、(10 分)

若一个关系 RR 被称为环,当且仅当 aRbaRbbRcbRc 蕴含 cRacRa。证明:RR 是自反的并且它是环,当且仅当 RR 是等价关系。


四、(7 分)

Given the set {2,3,,2n+1}\{2,3,\ldots,2n+1\}, prove that if you take any n+1n+1 elements from the set, then there must be at least 2 co-prime(互质)elements.(两个连续的自然数一定是互质数。)


五、(7 分)

Let nn be a nonnegative integer. Then

k=0n2k(nk)=3n\sum_{k=0}^{n}2^k\binom{n}{k}=3^n

六、(8 分)

Find a recurrence relation for the number of bit strings that contain the string 01.

  1. What are the initial conditions?

  2. How many bits strings of length five contain the string? (You must give the value of the number of bit strings)


七、(8 分)

How many one-to-one functions are there from a set with mm elements to one with nn elements?


八、(8 分)

Find all solutions of the recurrence relation

an=4an14an2+2na_n=4a_{n-1}-4a_{n-2}+2^n

with initial condition a0=1,a1=2a_0=1,a_1=2


九、(7 分)

Use generating functions to solve the recurrence relation

ak=ak1+2ak2+2ka_k=a_{k-1}+2a_{k-2}+2^k

with initial conditions a0=4a_0=4 and a1=12a_1=12.


十、(5 分)

How many different strings can be made from the letters in ABRACADABRA, using all the letters.


十一、(5 分)

a1,a2,,ana_1,a_2,\ldots,a_n1,,n1,\ldots,n 的一个排列,证明,当 nn 为奇数时,(a11)(a22)(ann)(a_1-1)(a_2-2)\cdots(a_n-n) 是一个偶数。


十二、(20 分)

回答下列问题

1). A sequence d1,d2,,dnd_1,d_2,\ldots,d_n is called graphic if it is the degree sequence of a simple graph. Determine whether this sequence is graphic. If yes, draw such a graph.

3,3,4,5,5,63,3,4,5,5,6

2). Let GG be a graph with vv vertices and ee edges. Let MM be the maximum degree of the vertices of GG, and let mm be the minimum degree of the vertices of GG. Show that:

(a). 2evm\dfrac{2e}{v}\ge m;

(b). 2evM\dfrac{2e}{v}\le M

3). Determine whether the given pair of graphs is isomorphic(同构). Please briefly explain the reason.

第十二题第3小题图

4). Find the chromatic number(着色数)of the following graph. Please color these vertices.

第十二题第4小题图

5). Determine whether the given graph is planar. Please briefly explain the reason.

第十二题第5小题图