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
Alexxx [7]
3 years ago
11

I am an ambitious and have 765/500 points and 5/5 brainliest answers but I cant level up. wHY?

Mathematics
2 answers:
maks197457 [2]3 years ago
6 0
You need to contact the app about that, try maybe their customer service or their email?
kondaur [170]3 years ago
6 0

ME TOO

i don't understand :(

You might be interested in
Use (<, >, =) to compare 2⁄3 and 3⁄4.
Yakvenalex [24]

2/3<3/4

2/3 translates to 0.6666666666666

3/4 translates to 0.75

0.666666 is before 0.75 on a number line

8 0
3 years ago
PLEASE HELP<br> I WILL GIVE YOU STARS!!!!!!!!!!!!!!!!!!!!!!!!111
Inessa05 [86]
1500 volume x  1 per minute
_________________________

      24 hours or 1440 minutes

1500/1440 = 1.04

Flow Rate is 1.04


5 0
3 years ago
How do yall figure out how many people there are in a pie chart if it dont say and all it has is percents
fredd [130]
Change the percent to a decimal and then multiply
8 0
3 years ago
one angle has a measure that is less than 15 than two times a number. a second angle is three times the number. the angles are c
adell [148]

Answer:

27 degrees and 63 degrees

Step-by-step explanation:

Let n be the number.

Angle 1: 2n-15

Angle 2: 3n

If the angles are complementary they add up to 90.

Therefore we can write an equation.

2n-15+3n=90

Combine like terms

5n-15=90

Add 15 to both sides

5n=105

n=21

Now we plug 21 in for n and solve for the angles

Angle 1 = 2(21)-15

Angle 1 = 42-15

Angle 1 = 27

Angle 2 = 3(21)

Angle 2 = 63

4 0
2 years ago
Is it possible for a simple, connected graph that has n vertices all of different degrees? Explain why or why not.
ryzh [129]

Answer:

It isn't possible.

Step-by-step explanation:

Let G be a graph with n vertices. There are n possible degrees: 0,1,...,n-1.

Observe that a graph can not contain a vertice with degree n-1 and a vertice with degree 0 because if one of the vertices has degree n-1 means that this vertice is adjacent to all others vertices, then the other vertices has at least degree 1.

Then there are n vertices and n-1 possible degrees. By the pigeon principle there are two vertices that have the same degree.

8 0
3 years ago
Other questions:
  • Which graph matches the inequality?
    9·1 answer
  • Which expression is the result of the perimeter of rectangle b minus the perimeter of rectangle a
    9·1 answer
  • Identify the fallacies of weak induction committed by the following arguments, giving a brief explanation for your answer. If no
    8·1 answer
  • What are the solutions of x ^ 2 + 6x - 6 = 10 ? x = - 11 x = 1 x = - 11 x = - 1 x = - 8x = - 2 x = - 8x = 2
    15·1 answer
  • Which polynomial will definitely have nonreal zeros?
    6·2 answers
  • What is the surface area of 8 ft and 16 ft
    13·1 answer
  • 15 points if you complete it &lt;3
    9·1 answer
  • What is the measure of &lt;QPU​
    5·1 answer
  • What is the slope of the line?
    15·1 answer
  • Figure
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!