Can you draw only one isosceles triangle that contains an angle of 65

Mathematics

1 answer:

arsen [322]4 years ago

6 0

No because it doesn't make sense <span />

You might be interested in

How many integers in the set {n ∈ Z | 1 ≤ n ≤ 700} are divisible by 2 or 7?

sukhopar [10]

$\large\begin{array}{l}\\\\ \textsf{This question gives us a set}\\\\ \mathsf{S=\{n \in\mathbb{Z}:~1\le n\le 700\}}\\\\ \mathsf{S=\{1,\,2,\,3,\,\ldots,\,699,\,700\}}\\\\\\ \bullet~~\textsf{Set of integers that are divible by 2 (even integers):}\\\\ \mathsf{A=\{n\in \mathbb{Z}:~n=2k,\,k\in\mathbb{Z}\}}\\\\ \mathsf{A=\{\ldots,\,-4,\,-2,\,0,\,2,\,4,\,\ldots\}}\\\\\\ \bullet~~\textsf{Set of integers that are divible by 7:}\\\\ \mathsf{B=\{n\in \mathbb{Z}:~n=7k,\,k\in\mathbb{Z}\}}\\\\ \mathsf{A=\{\ldots,\,-14,\,-7,\,0,\,7,\,14,\,\ldots\}} \end{array}$

___________

$\large\begin{array}{l}\\\\ \textsf{We want to know how many elements there are in the}\\\textsf{following set:}\\\\ \mathsf{S\cap (A\cup B)=(S\cap A)\cup(S\cap B)\qquad(i)} \end{array}$

____________

$\large\begin{array}{l}\\\\ \bullet~~\mathsf{S\cap A=\{n\in\mathbb{N}:~n=2k~~and~~1\le n\le 700,\,k\in\mathbb{Z}\}}\\\\ \mathsf{S\cap A=\{2,\,4,\,6,\,\ldots,\,698,\,700\}}\\\\ \mathsf{S\cap A=\{1\cdot 2,\,2\cdot 2,\,3\cdot 2,\,\ldots,\,349\cdot 2,\,350\cdot 2\}}\\\\\\ \textsf{So, there are 350 elements in }\mathsf{S\cap A:}\\\\ \mathsf{\#(S\cap A)=350.} \\\\\\ \bullet~~\mathsf{S\cap B=\{n\in\mathbb{N}:~n=7k~~and~~1\le n\le 700,\,k\in\mathbb{Z}\}}\\\\ \mathsf{S\cap B=\{7,\,14,\,21,\,\ldots,\,693,\,700\}}\\\\ \mathsf{S\cap B=\{1\cdot 7,\,2\cdot 7,\,3\cdot 7,\,\ldots,\,99\cdot 7,\,100\cdot 7\}} \\\\\\ \textsf{So, there are 100 elements in }\mathsf{S\cap B:}\\\\ \mathsf{\#(S\cap B)=100.} \end{array}$

____________

$\large\begin{array}{l}\\\\ \textsf{Therefore,}\\\\ \mathsf{\#\big[S\cap (A\cup B)\big]}\\\\ =\mathsf{\#\big[(S\cap A)\cup(S\cap B)\big]}\\\\ =\mathsf{\#(S\cap A)+\#(S\cap B)-\#\big[(S\cap A)\cap(S\cap B)\big]}\\\\ =\mathsf{350+100-50}\\\\ =\mathsf{450-50}\\\\ =\mathsf{400~elements.}\\\\\\ \textsf{There are 400 integers in S that are divisible by 2 or 7.} \end{array}$

If you're having problems understanding the answer, try to see it through your browser: brainly.com/question/2105863

$\large\begin{array}{l}\\\\ \textsf{Any doubts? Please, comment below.}\\\\\\ \textsf{Best wishes! :-)} \end{array}$

Tags: <em>set theory divibilility divisible integers union intersection</em>

3 0

4 years ago

Use P E M D A S to solve this number problem.

eimsori [14]

Yes your answer is correct

5 0

3 years ago

Read 2 more answers

Please help.................

evablogger [386]

It usually works well to do what the instructions tell you. Multiply each diameter by 3.14.

a) 3.14×6 cm = 18.84 cm

b) [can't read the picture]

d) 3.14×9 in = 28.26 in

e) 3.14×11 mm = 34.54 mm

7 0

3 years ago

Graph f(x) = 4[x] + 5

Elena L [17]

{\rtf1\ansi\ansicpg1252\cocoartf2512

\cocoatextscaling1\cocoaplatform1{\fonttbl\f0\fnil\fcharset0 HelveticaNeue;}

{\colortbl;\red255\green255\blue255;\red60\green64\blue67;}

{\*\expandedcolortbl;;\cssrgb\c23529\c25098\c26275;}

\deftab720

\pard\pardeftab720\partightenfactor0

\f0\fs28 \cf2 \expnd0\expndtw0\kerning0

\outl0\strokewidth0 \strokec2 \

}

6 0

3 years ago

Help! I'll give brainliest to the first correct answer!

Mice21 [21]

Answer:A

Step-by-step explanation:

the answer is A

4 0

4 years ago

Read 2 more answers