Hello, so i was reading the book "Book of Proof Third Edition" by Richard Hammack.
And in chapter 5, question 26. I'm stuck. The question is as follows:
If n = 2ᵏ - 1 for k ∈ ℕ, then every entry in Row n of Pascal's Triangle is odd.
We gotta prove this statement, using direct of contrapositive proof.
Now, what i did was just to put the values.
Proof
Suppose n = 2ᵏ - 1.
Every entry in row = C(n, k) where k ∈ ℕ and 0 <= k <= n.
C(n, k) = (2ᵏ - 1)!/(k!(2ᵏ - 1 - k)!)
= (2ᵏ - 1)(2ᵏ - 2)(2ᵏ - 3)...(2ᵏ - k)/(k!)
now i don't know what to do from here. Like it's the thing i did'nt even knew before i got to prove it.
Btw, it's not any homework or so. I'm a 10th grader and was just reading the book for better understanding of fun and joy of math. Would love if i understood how i can prove it (because it doesn't seem to be able to be proved).
Btw if you want to see the question in the original book then:
https://richardhammack.github.io/BookOfProof/Main.pdf#page=148
The above is the link to it.