1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
PSYCHO15rus [73]
3 years ago
7

URGENT PLEASE ANSWER

Mathematics
1 answer:
Jet001 [13]3 years ago
4 0
46 77$&!adhnm bhujjkkkm.
You might be interested in
Five times the sum of a number and 27 is greater than or equal to six times the sum of that
AleksAgata [21]

The complete version of question:

<em>Five times the sum of a number and 27 is greater than or equal to six times the sum of that number and 26. What is the solution of this problem.</em>

Answer:

5\left(x+27\right)\ge \:6\left(x+26\right)\quad :\quad \begin{bmatrix}\mathrm{Solution:}\:&\:x\le \:-21\:\\ \:\mathrm{Interval\:Notation:}&\:(-\infty \:,\:-21]\end{bmatrix}

Step-by-step explanation:

As the description of the statement is:

'<em>Five times the sum of a number and 27 is greater than or equal to six times the sum of that number and 26'.</em>

<em />

As

  • <em>Five times the sum of a number and 27  </em>is written as: 5(x + 27)
  • <em>greater than or equal </em>is written as:  \geq
  • <em>six times the sum of that number and 26'  </em>is written as: 6(x + 26)

so lets combine the whole statement:

<em />5\left(x\:+\:27\right)\ge \:6\left(x\:+\:26\right)<em />

solving

<em />5\left(x\:+\:27\right)\ge \:6\left(x\:+\:26\right)<em />

<em />5x+135\ge \:6x+156<em />

<em />5x+135-135\ge \:6x+156-135<em />

<em />5x\ge \:6x+21<em />

<em />5x-6x\ge \:6x+21-6x<em />

<em />-x\ge \:21<em />

<em />\mathrm{Multiply\:both\:sides\:by\:-1\:\left(reverse\:the\:inequality\right)}<em />

<em />\left(-x\right)\left(-1\right)\le \:21\left(-1\right)<em />

<em />x\le \:-21<em />

Therefore,

5\left(x+27\right)\ge \:6\left(x+26\right)\quad :\quad \begin{bmatrix}\mathrm{Solution:}\:&\:x\le \:-21\:\\ \:\mathrm{Interval\:Notation:}&\:(-\infty \:,\:-21]\end{bmatrix}

6 0
3 years ago
Which of the given points would be in a table generated by the equation below?
Sergeeva-Olga [200]
B. (0,s/q) ........................................................
3 0
3 years ago
DNA molecules consist of chemically linked sequences of the bases adenine, guanine, cytosine and thymine, denoted A, G, C and T.
Dmitry [639]

Answer:

1. See the attached tree diagram (64 different sequences); 2. 64 codons; 3. 8 codons; 4. 24 codons consist of three different bases.

Step-by-step explanation:

The main thing to solve this kind of problem, it is to know if the pool of elements admits <em>repetition</em> and if the <em>order matters</em> in the sequences or collections of objects that we can form.

In this problem, we have the bases of the DNA molecule, namely, adenine (A), thymine (T), guanine (G) and cytosine (C) and they may appear in a sequence of three bases (codon) more than once. In other words, <em>repetition is allowed</em>.

We can also notice that <em>order matters</em> in this problem since the position of the base in the sequence makes a difference in it, i.e. a codon (ATA) is different from codon (TAA) or (AAT).

Then, we are in front of sequences that admit repetitions and the order they may appear makes a difference on them, and the formula for this is as follows:

\\ Sequences\;with\;repetition = n^{k} (1)

They are sequences of <em>k</em> objects from a pool of <em>n</em> objects where the order they may appear matters and can appeared more than once (repetition allowed).

<h3>1 and 2. Possible base sequences using tree diagram and number of possible codons</h3>

Having all the previous information, we can solve this question as follows:

All possible base sequences are represented in the first graph below (left graph) and are 64 since <em>n</em> = 4 and <em>k</em> = 3.

\\ Sequences\;with\;repetition = 4^{3} = 4*4*4 = 64

Looking at the graph there are 4 bases * 4 bases * 4 bases and they form 64 possible sequences of three bases or codons. So <em>there are 64 different codons</em>. Graphically, AAA is the first case, then AAT, the second case, and so on until complete all possible sequences. The second graph shows another method using a kind of matrices with the same results.

<h3>3. Cases for codons whose first and third bases are purines and whose second base is a pyrimidine</h3>

In this case, we also have sequences with <em>repetitions</em> and the <em>order matters</em>.

So we can use the same formula (1) as before, taking into account that we need to form sequences of one object for each place (we admit only a Purine) from a pool of two objects (we have two Purines: A and G) for the <em>first place</em> of the codon. The <em>third place</em> of the codon follows the same rules to be formed.

For the <em>second place</em> of the codon, we have a similar case: we have two Pyrimidines (C and T) and we need to form sequences of one object for this second place in the codon.

Thus, mathematically:

\\ Sequences\;purine\;pyrimidine\;purine = n^{k}*n^{k}*n^{k} = 2^{1}*2^{1}*2^{1} = 8

All these sequences can be seen in the first graph (left graph) representing dots. They are:

\\ \{ATA, ATG, ACA, ACG, GTA, GTG, GCA, GCG\}

The second graph also shows these sequences (right graph).

<h3>4. Possible codons that consist of three different bases</h3>

In this case, we have different conditions: still, order matters but no repetition is allowed since the codons must consist of three different bases.

This is a case of <em>permutation</em>, and the formula for this is as follows:

\\ nP_{k} = \frac{n!}{n-k}! (2)

Where n! is the symbol for factorial of number <em>n</em>.

In words, we need to form different sequences (order matters with no repetition) of three objects (a codon) (k = 3) from a pool of four objects (n = 4) (four bases: A, T, G, and C).

Then, the possible number of codons that consist of three different bases--using formula (2)--is:

\\ 4P_{3} = \frac{4!}{4-3}! = \frac{4!}{1!} = \frac{4!}{1} = 4! = 4*3*2*1 = 24

Thus, there are <em>24 possible cases for codons that consist of three different bases</em> and are graphically displayed in both graphs (as an asterisk symbol for left graph and closed in circles in right graph).

These sequences are:

{ATG, ATC, AGT, AGC, ACT, ACG, TAG, TAC, TGA, TGC, TCA, TCG, GAT, GAC, GTA, GTC, GCA, GCT, CAT, CAG, CTA, CTG, CGA, CGT}

<h3 />

6 0
3 years ago
Mr. Carter’s car has an 18-gallon gas tank. How much money will he spend to fill up his tank if gas costs $2.35 per gallon?
Elan Coil [88]

Answer:

18 x $2.35= $42.30

Step-by-step explanation:

multiply gallon by price of gas

5 0
2 years ago
Find percent notation.<br> 4/5
Romashka [77]

The Answer to your problem is:

0.8

8 0
3 years ago
Read 2 more answers
Other questions:
  • 28 -4t = 3t is it 4 the answer
    13·2 answers
  • NEED HELP FAST WILL GIVE BRAINIEST
    7·2 answers
  • State whether the data are best described as a population or a sample. The U.S. Department of Transportation announces that of t
    5·1 answer
  • A right rectangular prism has a length of 6 cm, a width of 8 cm, and a height of 4 cm. The dimensions of the prism are halved.
    11·1 answer
  • Alhondro wants to determine the average shoe size of all of male students in his school
    15·1 answer
  • The line y =3x-5 meet x-axis at the point M.
    10·1 answer
  • Please help me ASAP!!!
    12·1 answer
  • Find the area shaded ​
    11·1 answer
  • How can you drop two eggs the fewest amount of times, without them breaking?
    15·1 answer
  • {-13,-2,9,20,31,…} which term in this sequence is 306
    6·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!