1*. A trit is the ternary equivalent of a bit. Count the number of possible stri

Question

1*. A trit is the ternary equivalent of a bit. Count the number of possible string of 10 trits with exactly 4 trits having value 2. 2*. You have some money to spend, it's weekend and you want to drink it. You are in a bar and decide to drink 6 beers tonight. In how many ways can you pick these 6 beers if there are 8 different beer types? [Note: the order you drink them does not matter] 3*. Prove that gcd(ka, kb) = kgcd(a, b) for any a, b, k positive integers. 4*. Fibonacci numbers are defined as F(1) = F(2) = 1, and F(n) = F(n-2)+F(n-1) for n > 2. Prove by induction: Any two consecutive Fibonacci numbers are relatively prime. 5*. Prove that if p is an odd prime then either p 1 (mod 4) or p 3 (mod 4). Prove that if n 3 (mod 4) then n has a prime factor p such that p 3 (mod 4).

Explanation / Answer

Ans-

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.