   Chapter 9.4, Problem 39ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# What is the largest number of elements that a set of integers from 1 through 100 can have so that no one integers in the integers from 1 through 100 can have so that no one integer in the set is divisible by another? (Hint: Imagine writing all the integers from 1 through 100 in the from 2 k ⋅ m , where k ≥ 0 and m is odd.)

To determine

The largest number of elements so that a set of integers from 1 through 100 will have no one element in the set is divisible by one another.

Explanation

Given information:

The given statement is the largest number of elements so that a set of integers from 1 through 100 can have no one element in the set is divisible by one another.

Calculation:

Consider set A containing all the integers from 1 to 100.

And set from B containing all the odd integers from 1 to 100 which means set B is having fifty integers

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 