Chapter 3: Problem 2
Evaluate each, where \(n\) is an integer. $$\lfloor n / 2\rfloor$$
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 3: Problem 2
Evaluate each, where \(n\) is an integer. $$\lfloor n / 2\rfloor$$
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Prove. The cartesian product of two countable sets is countable.
Prove each, where \(x \in \mathbb{R}\) and \(n \in \mathbf{Z}.\) \(\left\lfloor\frac{n}{2}\right\rfloor=\frac{n-1}{2}\) if \(n\) is odd.
Evaluate each sum, where \(\delta_{i j}\) is defined as follows. $$ \delta_{i j}=\left\\{\begin{array}{ll}{1} & {\text { if } i=j} \\ {0} & {\text { otherwise }}\end{array}\right. $$ \(\left[\delta_{j} \text { is called Kronecker's delta, after the German mathematician Leopold }\right.\) Kronecker \((1823-1891) . ]\) $$ \sum_{i=1}^{3} \sum_{j=1}^{i}(j+3) $$
Evaluate each sum. $$\sum_{i=-1}^{4} 3$$
Determine if the functions are bijective. If they are not bijective, explain why. \(g: \Sigma^{*} \rightarrow \Sigma^{*}\) defined by \(g(w)=a w a,\) where \(\Sigma=\\{a, b, c\\}.\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.