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
V125BC [204]
2 years ago
8

For the set ​= ​{​2,4,6}, determine ​n(​A)

Mathematics
1 answer:
Katyanochek1 [597]2 years ago
3 0

Answer:

n(A)= 10

Step-by-step explanation:

Hope it is ..mark me as brilliant

You might be interested in
I have a easy math for y’all
xz_007 [3.2K]

Answer: Circle: 4 Square: 18 Triangle: -5

Step-by-step explanation: Hope this helps! :)

6 0
3 years ago
Read 2 more answers
The modified expression, x3(2x + 5) – 4(2x + 5), has two terms with a common factor
fenix001 [56]
Yes, the common factor is (2x+5)  and the equation can be expressed as:

(x^3-4)(2x+5)
8 0
3 years ago
Read 2 more answers
How to get 1/2x 2 1/2??
BabaBlast [244]

Answer:

1 1/4

Step-by-step explanation:

You are multiplying a fraction by a mixed number so you have to turn the mixed number into an improper fraction.

2 1/2 -- to do this you have to multiply the denominator by the whole number, then add the numerator.

2*2= 4   4+1=5

2 1/2 = 5/2

Then, you multiply normally

1/2 x 5/2 = 5/4

5/4= 1 1/4

So, you answer would be 1 1/4

Hope this helps!!

-Ketifa

(Can I get brainliest?)

8 0
2 years ago
uppose that we have a function with a constant amount of work done in initialization, a call to a log-linearsorting algorithm, a
White raven [17]

Answer:

The running time is quadratic (O(n²) )

Step-by-step explanation:

For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n),  is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is

C + T(n) + n*(a*n+b) = an²+bn + T + C

Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).

7 0
2 years ago
Simplify -8(n+5) -3n
pshichka [43]
-8n-25-3n then you would need too add like terms and it'd be -11n-25 
8 0
3 years ago
Read 2 more answers
Other questions:
  • A cheetah ran 275 feet in 3.23 seconds. How fast did the cheetah run in miles per hour? Round your answer to the nearest whole m
    12·1 answer
  • Write the equation of a line that is perpendicular to the given line and that passes through the given point. y-4=5/2(x+3);(-3,4
    11·1 answer
  • Find the amount and present value of 10 quarterly payments of $ 1500, if the interest rate is 25% compounded each month.
    15·1 answer
  • Anne is currently h years old. bill is currently 2h years old and Charles is currently eight years old. find an expression for e
    7·1 answer
  • A square picture frame with each side length represented by 3x -
    15·1 answer
  • I really need help im confuzzled​
    5·1 answer
  • Functions order from least to greatest answers and explanation pleaseee!!
    7·1 answer
  • In how many ways can the letter of word number taken two at a time
    10·2 answers
  • What is the volume of the prism pls help
    8·1 answer
  • Equations in Iwo V Solve the system by the addition method. 3x+8y=6 3x-8y=6 Select the correct choice below and, if necessary, f
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!