Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Notes on this paper
National Examination, 04-BS-16 Discrete Mathematics, undated sitting (May 2019). Closed book; approved Casio or Sharp calculator only. The exam instructs "answer 10 of the 12 questions"; every question is answered below as a complete study resource.
Source note: This paper is the May 2019 sitting (every page footer reads "04-BS-16/May 2019"). Two printed statements are defective as set and are flagged where they occur: Question 7(a) prints the last term of $\{1,5,9,\dots\}$ as $4n-1$ (the pattern and the stated sum require $4n-3$), and Question 8(b) prints "$n>2$" although $4^n>n^4$ fails at $n=3,4$. Question 12(c)'s parameters also make a connected graph impossible; this is noted at that part.
Reference texts: Rosen, Discrete Mathematics and Its Applications, 7th ed. (Pearson) — used throughout for logic, set theory, functions, combinatorics, probability, induction, asymptotic (Big-O) notation, and graph theory.
Given. (a) 1100 people, 365 possible birthdays. (b) real numbers $x,y$.
Find. (a) a pigeonhole proof that some day has $\ge4$ people. (b) a proof of the inequality.
Approach. (a) generalized pigeonhole principle, $\lceil N/k\rceil$. (b) write $x+y$ as the sum $(x-3)+(y+3)$ and apply the triangle inequality $|u+v|\le|u|+|v|$.
a) At least 4 of 1100 people share a birthday. $k=365$ possible birthdays (pigeonholes), $N=1100$ people (pigeons). Some pigeonhole holds at least $$\left\lceil\frac{1100}{365}\right\rceil=\lceil3.0137\rceil=4.$$ Directly: if every day had at most 3 people, there could be at most $3\times365=1095<1100$ people, a contradiction. $\boxed{\text{At least 4 people share a birthday}}$. (Including 29 February, $3\times366=1098<1100$, so the conclusion survives leap years too.)
b) Prove $|x-3|+|y+3|\ge|x+y|$. Let $u=x-3$ and $v=y+3$; then $u+v=x+y$ (the $\mp3$ cancel). By the triangle inequality $|u+v|\le|u|+|v|$: $$|x+y|=|(x-3)+(y+3)|\le|x-3|+|y+3|.$$ $\boxed{|x-3|+|y+3|\ge|x+y|\ \text{for all real } x,y}$, with equality exactly when $x-3$ and $y+3$ have the same sign (or one is zero).
Proved: triangle inequality on $u=x-3$, $v=y+3$, $u+v=x+y$
Part (b) works because the two shifts are chosen to cancel: $-3$ inside the first absolute value and $+3$ inside the second add to zero, so the sum of the two inner quantities is exactly $x+y$. Had the shifts not cancelled (for example $|x-3|+|y-3|$), the same argument would bound $|x+y-6|$ instead, and the stated inequality would need a separate argument.