For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 5.1절문제 은행 · 기초 수학 · 공통수학2 · 집합과 명제
이 단원의 모든 연습문제입니다. 소단원으로 좁혀 보려면 아래 꼬리표를 누르세요.
유형·난이도는 우리말 풀이가 붙은 문제는 선생님이 정했고, 나머지는 자동 분류라 다를 수 있어요. 난이도가 정해지지 않은 문제는 난이도로 거를 때 빠집니다.
459문제 · 10 / 23쪽
For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 5.1절For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 5.1절 · 3g번For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 2.3절 · 5c번For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 5.1절 · 3k번For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 5.2절 · 12a번For each of the following sets, use English to describe the set and when appropriate, use the roster method to specify all of the elements of the set.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 5.2절For each of the following statements
- (1) Write the statement in the form of an English sentence that does not use the symbols for quantifiers. - (2) Write the negation of the statement in a symbolic form that does not use the negation symbol. - (3) Write the negation of the statement in the form of an English sentence that does not use the symbols for quantifiers.
.
For each of the following statements
- (1) Write the statement in the form of an English sentence that does not use the symbols for quantifiers. - (2) Write the negation of the statement in a symbolic form that does not use the negation symbol. - (3) Write the negation of the statement in the form of an English sentence that does not use the symbols for quantifiers.
.
For each of the following statements
- (1) Write the statement in the form of an English sentence that does not use the symbols for quantifiers. - (2) Write the negation of the statement in a symbolic form that does not use the negation symbol. - (3) Write the negation of the statement in the form of an English sentence that does not use the symbols for quantifiers.
.
For each of the following statements
- (1) Write the statement in the form of an English sentence that does not use the symbols for quantifiers. - (2) Write the negation of the statement in a symbolic form that does not use the negation symbol. - (3) Write the negation of the statement in the form of an English sentence that does not use the symbols for quantifiers.
.
For each of the following statements
- (1) Write the statement in the form of an English sentence that does not use the symbols for quantifiers. - (2) Write the negation of the statement in a symbolic form that does not use the negation symbol. - (3) Write the negation of the statement in the form of an English sentence that does not use the symbols for quantifiers.
.
Use counterexamples to explain why each of the following statements is false.
For each integer , is a prime number.
A counterexample is since , and 21 is not prime.
Use counterexamples to explain why each of the following statements is false.
For each real number , if is positive, then .
A counterexample is since is positive and and .
An integer is a multiple of 3 provided that there exists an integer such that .
Write this definition in symbolic form using quantifiers by completing the following:
An integer
n
is a multiple of 3 provided that
.
An integer is a multiple of 3 provided that .
An integer is a multiple of 3 provided that there exists an integer such that .
Give several examples of integers (including negative integers) that are multiples of 3.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 2.4절 · 4e번An integer is a multiple of 3 provided that there exists an integer such that .
Give several examples of integers (including negative integers) that are not multiples of 3.
원본 교재에 이 문제의 정답은 실려 있지 않습니다.
한 번 더 — 비슷한 문제 풀기Sundstrom, Mathematical Reasoning · 1.1절An integer is a multiple of 3 provided that there exists an integer such that .
Use the symbolic form of the definition of a multiple of 3 to complete the following sentence: “An integer is not a multiple of 3 provided that ….”
An integer is not a multiple of 3 provided that .
An integer is a multiple of 3 provided that there exists an integer such that .
Without using the symbols for quantifiers, complete the following sentence: “An integer is not a multiple of 3 provided that ….”
An integer is not a multiple of 3 provided that for every integer , .
Write the negation of the statement
in symbolic form and as a sentence written in English.
.
There exist integers and such that .
For each of the following, write the statement as an English sentence and then explain why the statement is false.
.
There exists a rational number such that . This statement is false since the solutions of the equation are , which are irrational numbers.