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
sp2606 [1]
2 years ago
9

What is 48901x120412/12321 with a fraction of 6/9 + 29181041/21841x2912311203? It was one of my math questions couldn't find it

online soooo??
Mathematics
1 answer:
zimovet [89]2 years ago
7 0

4468886443222234578889953

You might be interested in
At the market, 777 apples cost \$4.55$4.55dollar sign, 4, point, 55. how much do 999 apples cost? \$
vredina [299]
I divided $.55 by 777 and got 0.00585 cents per apple.  Then I mulitplied 0.00585 by 999 and got $5.85.
6 0
3 years ago
in a farm 20% of animals are cows . 0.4 are goat and the rest are sheep.How many cows are there if there are 40 sheeps​
Zolol [24]

Step-by-step explanation:

20%=cows 0.4(40%)=goat 40%=sheep

if 40%sheep=40 sheeps

20% cow=x

20%×40=40%×x

8=40%x

x=8/40%

x=20

..so there are 20 cows

sorry...not sure

3 0
3 years ago
Read 2 more answers
1. Let L be a list of numbers in non-decreasing order, and x be a given number. Describe an algorithm that counts the number of
e-lub [12.9K]

Answer:

Algorithm

Start

Int n // To represent the number of array

Input n

Int countsearch = 0

float search

Float [] numbers // To represent an array of non decreasing number

// Input array elements but first Initialise a counter element

Int count = 0, digit

Do

// Check if element to be inserted is the first element

If(count == 0) Then

Input numbers[count]

Else

lbl: Input digit

If(digit > numbers[count-1]) then

numbers[count] = digit

Else

Output "Number must be greater than the previous number"

Goto lbl

Endif

Endif

count = count + 1

While(count<n)

count = 0

// Input element to count

input search

// Begin searching and counting

Do

if(numbers [count] == search)

countsearch = countsearch+1;

End if

While (count < n)

Output count

Program to illustrate the above

// Written in C++

// Comments are used for explanatory purpose

#include<iostream>

using namespace std;

int main()

{

// Variable declaration

float [] numbers;

int n, count;

float num, searchdigit;

cout<<"Number of array elements: ";

cin>> n;

// Enter array element

for(int I = 0; I<n;I++)

{

if(I == 0)

{

cin>>numbers [0]

}

else

{

lbl: cin>>num;

if(num >= numbers [I])

{

numbers [I] = num;

}

else

{

goto lbl;

}

}

// Search for a particular number

int search;

cin>>searchdigit;

for(int I = 0; I<n; I++)

{

if(numbers[I] == searchdigit

search++

}

}

// Print result

cout<<search;

return 0;

}

8 0
3 years ago
Mr.William orders 2 feet of trim to decorate pillows. If he needs 1inch of trim for each pillow, how many pillows can he decorat
navik [9.2K]

2 feet = 24 inches

24 inches divided by 1 inch = 24

Answer is 24 pillows.

3 0
3 years ago
Which value of the x is in the solution set of the following inequality -x+8&gt;6
vfiekz [6]
The answer would be 1
7 0
3 years ago
Other questions:
  • When constructing inscribed polygons and perpendicular lines how are the steps similar
    12·1 answer
  • What’s the correct answer for this question?
    5·1 answer
  • Can you guys plz help me quick What is 4y - 8
    6·1 answer
  • 2. Perform the calculations 11540+5972 in BCD arithmetic.
    13·1 answer
  • How to solve the sum of two numbers is 13. twice the larger increased by three times the smaller is 31. find the numbers?
    12·1 answer
  • Y=2x-1 and y=x-8 using substitution​
    7·1 answer
  • I really need help on this one!!
    14·2 answers
  • Question 6 (2 points)
    6·1 answer
  • Drag the tiles to the correct boxes to complete the pairs.
    6·1 answer
  • The radioactive element​ carbon-14 has a​ half-life of 5750 years. A scientist determined that the bones from a mastodon had los
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!