Chapter 3: Problem 41
The difference of any two odd integers is odd.
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 41
The difference of any two odd integers is odd.
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 \(0=\) Sunday, \(1=\) Monday, \(2=\) Tuesday, \(\ldots, 6=\) Saturday, then January 1 of year \(n\) occurs on the day of the week given by the following formula: \(\left(n+\left\lfloor\frac{n-1}{4}\right\rfloor-\left\lfloor\frac{n-1}{100}\right\rfloor+\left\lfloor\frac{n-1}{400}\right\rfloor\right) \bmod 7\). a. Use this formula to find January 1 of \(\begin{array}{lll}\text { i. } 2050 & \text { ii. } 2100 & \text { iii. the year of your birth. }\end{array}\)
Boxes, each capable of holding 36 units, are used to ship a product from the manufacturer to a wholesaler. Express the number of boxes that would be required to ship \(n\) units of the product using either the floor or the ceiling notation. Which notation is more appropriate?
The following "proof" that every integer is rational is incorrect. Find the mistake. "Proof (by contradiction): Suppose not. Suppose every integer is irrational, Then the integer 1 is irrational. But \(1=1 / 1\), which is rational. This is a contradiction. [Hence the supposition is false and the theorem is true.]"
Write an algorithm that accepts the numerator and denominator of a fraction as input and produces as output the numerator and denominator of that fraction written in lowest terms. (The algorithm may call upon the Euclidean algorithm as needed.)
The square of any integer has the form \(4 k\) or \(4 k+1\) for some integer \(k\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.