Chapter 3: Problem 12
Prove that if \(n\) is any even integer, then \(\lfloor n / 2\rfloor=n / 2\).
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 12
Prove that if \(n\) is any even integer, then \(\lfloor n / 2\rfloor=n / 2\).
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
If \(r\) is any rational number and \(s\) is any irrational number, then \(r / s\) is irrational.
Prove those that are true and disprove those that are false.The square root of an irrational number is irrational.
The difference of any two even integers is even.
If \(p\) is a prime number, must \(2^{p}-1\) also be prime? Prove or give a counterexample.
Let \(p_{1}, p_{2}, p_{3}, \ldots\) be a list of all prime numbers in ascending order. Here is a table of the first six:$$ \begin{array}{|c|c|c|c|c|c|} \hline p_{1} & p_{2} & p_{3} & p_{4} & p_{5} & p_{6} \\ \hline 2 & 3 & 5 & 7 & 11 & 13 \\ \hline \end{array} $$a. For each \(i=1,2,3,4,5,6\), let \(N_{i}=p_{1} p_{2} \cdots p_{i}+1\). Calculate \(N_{1}, N_{2}, N_{3}, N_{4}, N_{5}\), and \(N_{6}\). b. For each \(i=1,2,3,4,5,6\), find the smallest prime number \(q_{i}\) such that \(q_{i}\) divides \(N_{i}\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.