/*! 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} Problem 17 How many numbers between 1 and 2... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

How many numbers between 1 and 21,000,000 , including both 1 and 21,000,000 , are divisible by \(2,3,\) or 5 but not by \(7 ?\)

Short Answer

Expert verified
13,200,000 numbers between 1 and 21,000,000 are divisible by 2, 3, or 5 but not by 7.

Step by step solution

01

Identify the Range

We need to find the numbers between 1 and 21,000,000 that are divisible by 2, 3, or 5, but not by 7. This means we will first count those divisible by 2, 3, or 5 including 1 to 21,000,000.
02

Count by Divisibility (Inclusion-Exclusion Principle)

Using the inclusion-exclusion principle, count the numbers divisible by 2, 3, or 5:- Numbers divisible by 2: \[ \left\lfloor \frac{21,000,000}{2} \right\rfloor = 10,500,000 \]- Numbers divisible by 3: \[ \left\lfloor \frac{21,000,000}{3} \right\rfloor = 7,000,000 \]- Numbers divisible by 5: \[ \left\lfloor \frac{21,000,000}{5} \right\rfloor = 4,200,000 \]
03

Subtract Intersections of Divisions

To adjust for overcounting, subtract numbers counted twice due to being divisible by combinations of these numbers:- Divisible by 6 (2 and 3): \[ \left\lfloor \frac{21,000,000}{6} \right\rfloor = 3,500,000 \]- Divisible by 10 (2 and 5): \[ \left\lfloor \frac{21,000,000}{10} \right\rfloor = 2,100,000 \]- Divisible by 15 (3 and 5): \[ \left\lfloor \frac{21,000,000}{15} \right\rfloor = 1,400,000 \]
04

Add Triple Divisibility

Add back numbers counted three times (as they have been subtracted more than necessary) and which are divisible by 30 (2, 3, and 5):- Divisible by 30: \[ \left\lfloor \frac{21,000,000}{30} \right\rfloor = 700,000 \]
05

Numbers Divisible by 2, 3, or 5

Combine previous inclusions and exclusions:\[ 10,500,000 + 7,000,000 + 4,200,000 - 3,500,000 - 2,100,000 - 1,400,000 + 700,000 = 15,400,000 \]
06

Subtract Numbers Divisible by 2, 3, or 5 and 7

Now, subtract from this the numbers divisible by 2 or 3 or 5 that are also divisible by 7. We apply the same inclusion-exclusion principle here:- Divisible by 14 (2 and 7): \[ \left\lfloor \frac{21,000,000}{14} \right\rfloor = 1,500,000 \]- Divisible by 21 (3 and 7): \[ \left\lfloor \frac{21,000,000}{21} \right\rfloor = 1,000,000 \]- Divisible by 35 (5 and 7): \[ \left\lfloor \frac{21,000,000}{35} \right\rfloor = 600,000 \]- Add those divisible by 42, 70, and 105 (2, 3, 5, and 7): * Divisible by 42: \[ \left\lfloor \frac{21,000,000}{42} \right\rfloor = 500,000 \] * Divisible by 70: \[ \left\lfloor \frac{21,000,000}{70} \right\rfloor = 300,000 \] * Divisible by 105: \[ \left\lfloor \frac{21,000,000}{105} \right\rfloor = 200,000 \]- Divisible by 210 (2, 3, 5, and 7): \[ \left\lfloor \frac{21,000,000}{210} \right\rfloor = 100,000 \]
07

Final Calculation

The count of numbers divisible by 2, 3, or 5 but not 7 is:\[ 15,400,000 - (1,500,000 + 1,000,000 + 600,000 - 500,000 - 300,000 - 200,000 + 100,000) \]Simplifying the expression inside the parentheses:\[ 1,500,000 + 1,000,000 + 600,000 - 500,000 - 300,000 - 200,000 + 100,000 = 2,200,000 \]Thus, the final result is:\[ 15,400,000 - 2,200,000 = 13,200,000 \]

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

Key Concepts

These are the key concepts you need to understand to accurately answer the question.

Divisibility
Divisibility is the ability of one integer to be divided by another integer without having a remainder. For example, a number is divisible by 2 if it ends in 0, 2, 4, 6, or 8. This is crucial in solving problems like identifying how many numbers in a range have specific divisibility traits.
In the given exercise, we focus on numbers that are divisible by 2, 3, or 5. We start by counting all such numbers individually using floor division, as this finds how many times one number completely contains another.
The key to solving this problem is systematically adjusting our count to ensure accuracy without overcounting. Divisibility rules help simplify calculations and improve efficiency in dealing with large numbers inclusively, like our range from 1 to 21,000,000.
Discrete Mathematics
Discrete Mathematics is the branch of mathematics dealing with distinct and separate values. This field includes studying mathematical structures that are fundamentally discrete rather than continuous.
Inclusion-Exclusion Principle is one of the techniques commonly used in Discrete Mathematics. This principle helps calculate the size of the union of sets.
In our problem, we applied this principle to avoid overcounts when counting numbers divisible by multiple factors.
We began by counting numbers divisible by each of 2, 3, and 5. We then subtracted counts of numbers divisible by combinations of two factors and added back those divisible by all three factors, adjusting our count appropriately. This method efficiently identifies numbers across large data sets without overlooking overlaps.
Problem Solving
Problem-solving skills are essential when dealing with complex mathematical challenges, such as determining numbers divisible by certain integers.
Approaching such problems requires:
  • Identifying what needs to be counted—here, numbers divisible by 2, 3, or 5.
  • Using the Inclusion-Exclusion Principle to manage overlaps in counts from multiple divisors.
  • Subtracting counts as needed—like numbers also divisible by 7, which do not fit the desired criteria.

In our solution, we refined our result to ensure accuracy by adjusting for numbers that met the base divisibility but failed an additional criterion, which in this case was divisibility by 7. Recognizing and correcting for these miscounted subsets is a critical part of the problem-solving process, ensuring accurate and efficient solutions.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

At the beginning of the semester, an instructor of a music appreciation class wants to find out how many of the 250 students had heard recordings of the music of Mozart. Becthoven, Haydn, or Bach. The survey showed the following: How many students had listened to none of the composers? $$\begin{array}{||l|c|} \hline \text { Composer Listened to by Students } & \text { No. of Students } \\\ \hline \text { Mozart } & 125 \\ \hline \text { Beethoven } & 78 \\ \hline \text { Haydn } & 95 \\ \hline \text { Bach } & 62 \\ \hline \text { Mozart and Beethoven } & 65 \\ \hline \text { Mozart and Haydn } & 50 \\ \hline \text { Mozart and Bach } & 48 \\ \hline \text { Beethoven and Haydn } & 49 \\ \hline \text { Beethoven and Bach } & 39 \\ \hline \text { Haydn and Bach } & 37 \\ \hline \text { Mozart, Beethoven, and Haydn } & 22 \\ \hline \text { Mozart, Beethoven, and Bach } & 19 \\ \hline \text { Mozart, Haydn, and Bach } & 18 \\ \hline \text { Beethoven, Haydn, and Bach } & 13 \\ \hline \text { Mozart, Beethoven, Haydn, and Bach } & 9 \\ \hline \end{array}$$

Translate the following expressions into propositional logic. Use the following proposition letters: \(p="\) Jones told the truth." \(q={ }^{*}\) The butler did it." \(r=" I^{\prime} \|\) eat my hat." \(s=\) "The moon is made of green cheese." \(t=\) "If water is heated to \(100^{\circ} \mathrm{C}\), it turns to vapor." (a) "If Jones told the truth. then if the butler did it, I'll eat my hat." (b) "If the butler did it, then either Jones told the truth or the moon is made of green cheese, but not both." (c) "It is not the case that both Jones told the truth and the moon is made of green cheese." (d) "Jones did not tell the truth, and the moon is not made of green cheese, and I'll not eat my hat." (e) "If Jones told the truth implies I'll eat my hat, then if the butler did it, the moon is made of green cheese." (f) "Jones told the truth, and if water is heated to \(100^{\circ} \mathrm{C}\), it turns to vapor."

In how many ways can you climb a ladder with \(n\) rungs if at each step you can go up either one or two rungs? The terms of a sequence are given recursively as \(a_{1}=1 .\) \(a_{2}=2,\) and \(a_{n}=a_{n-1}+a_{n-2}\) for \(n \geq 2 .\) Prove by induction that \(b_{n}=F_{n+1}\) gives the terms of this sequence where \(F_{n+1}\) is the \((n+1)\) st Fibonacci number.

Find the number of integers between 1 and 1000 , including both 1 and 1000 , that are not divisible by any of \(5,6,\) or 8.

Find the expression tree for the formula $$((\neg(p \wedge q)) \vee(\neg(q \wedge r))) \wedge((\neg(p \leftrightarrow(\neg(\neg s)))) \vee(((r \wedge s) \vee(\neg q))))$$

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.