Please help with Maths Logic

[LadyAnne]

The pigeon-hole problem is to place n + 1 pigeons into n holes such that each
hole contains at most one pigeon. There is no solution, of course!
1. Encode the pigeon-hole problem for 3 holes and 4 pigeons as a formula in clausal
form.
2. Use the DPLL algorithm to show that the formula is unsatisfiable for one assignment.
3. Develop an expression for the number of clauses in the formula for the pigeonhole
problem with n holes.6.3 The pigeon-hole problem is to place n + 1 pigeons into n holes such that each
hole contains at most one pigeon. There is no solution, of course!
1. Encode the pigeon-hole problem for 3 holes and 4 pigeons as a formula in clausal
form.
2. Use the DPLL algorithm to show that the formula is unsatisfiable for one assignment.
3. Develop an expression for the number of clauses in the formula for the pigeonhole
problem with n holes.

 

[HallsofIvy]

You stated the problems twice but show no attempt to solve them yourself! It is impossible to know how to help or what hints to give without knowing what you do understand and what you can do on this problem.