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
Vikentia [17]
3 years ago
9

A youth chorus has 30 members. There are 14 boys in the chorus.

Mathematics
2 answers:
saw5 [17]3 years ago
4 0
The ratio of boys to girls in simplest form is
14:16
14/16
Divide through by 2
7/8
So the ratio of boys to girls in simplest form is 7/8
tiny-mole [99]3 years ago
4 0

Answer:

your answer is 7/8


You might be interested in
Solve for .x.<br> -9 + 2x + x-3
Novay_Z [31]

Answer:

I belive the answer is 3x - 12

4 0
3 years ago
Negative one and one-sixth divided by negative six
Sveta_85 [38]

Answer:

Step-by-step explanation:

5 0
3 years ago
Read 2 more answers
The latest online craze is a new game, Khan on Seven. You get 100 points for playing the game. In addition, you get 50 points fo
Blizzard [7]

Answer: 50x+100\geq18,000

Step-by-step explanation:

Let w denotes a seven letter word which Sal will need to make to break the record.

Since  you get 50 points for each seven-letter and 100 points for playing the game.

Then the total points earned by you by making w seven letters words will be:

50x+100

Since, Sal wants to break that record, and needs 18,000 points or more to do so.

Then , the required inequality will be :

50x+100\geq18,000

3 0
3 years ago
Read 2 more answers
0.64 as a fraction in lowest terms
Nezavi [6.7K]

16/25 is 0.64 as a fraction in lowest terms

5 0
3 years ago
Read 2 more answers
Without using a division or multiplication operator and without using iteration , define a recursive method named product that a
Fantom [35]

I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression 
 f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k 
 If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is. 
 If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.   
 So here's the function   
 int product(int m, int k) 
 { 
  if (m == 0) return 0; 
  return product(m-1,k) + k;  
}
8 0
2 years ago
Other questions:
  • Which answer is equal to the quotient in the expression below?<br><br> 6x^3 + 7x^2 - 1/2x + 1
    10·2 answers
  • How to do this question by proving the identity?
    11·1 answer
  • If ben saves $15 a week for the next 10 weeks, will he be able to buy the stereo and why?
    5·1 answer
  • Need help on this problem asap
    13·1 answer
  • A certain road shows two s. A is long but is long on the . What is the unit rate for per on this ​? If B is ​long, how long is B
    5·1 answer
  • James decides to invest money in Wal-Mart. As a shareholder, he has the advantage of
    7·1 answer
  • What is 2225 rounded to the nearest thousand? Hurry please
    14·1 answer
  • Given the quadratic function f(x) = 2x²- 6x + 7<br>i Find the vertex of f(x).​
    8·1 answer
  • A kite is flying at a height of 60 m and is attached to a string inclined at 30° to the horizontal. What is the length of the st
    9·1 answer
  • Solve: 2 + 2x=19 + 2x<br> 2=19<br> Answer: No Solutions
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!