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
babunello [35]
3 years ago
15

Three tanks are capable of holding 361,841, and 901 of the greatest vessel winch can be used to fill each one of them on exact n

umber of time
Mathematics
1 answer:
daser333 [38]3 years ago
6 0

Answer:

Tank which is capable of holding 1 can fill each one of the tanks an exact number of time.

Step-by-step explanation:

Three tanks are capable of holding 361,841,901

To find which tank can be used to fill each one of them an exact number of time, find HCF(361,841,901)

361=19^2\\841=29^2\\901=17(53)

Therefore,

HCF(361,841,901)=1

So, tank which is capable of holding 1 can fill each one of the tanks an exact number of time.

You might be interested in
What is 2 dollars to 40 cents as a fraction in lowest terms?
pav-90 [236]
It is 5/1
200/40
20/4
5/1
3 0
3 years ago
Help on thisi please
SVETLANKA909090 [29]

Answer:

False for both

Step-by-step explanation:

Neither of these images are symmetrical vertically nor horizontally.

4 0
3 years ago
Read 2 more answers
Xˆ8 ÷ xˆ2 fully factorised
Ksivusya [100]

Answer:

Step-by-step explanation:

x^8/x^2= x^{8-2}= x^6

when you divide same base and different powers, you subtract the powers

3 0
3 years ago
Read 2 more answers
Bakery rolls are being prepared to go to grocery stores. Divide 72 rolls into 2 groups so the ratio is 3 to 5.
kirza4 [7]
45 rolls are in a group and 27 rolls are in the other group
5 0
3 years ago
The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is
HACTEHA [7]

Answer:

False

Step-by-step explanation:

Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.

Quotient and/or Remainder = \frac{N}{D}

8 0
3 years ago
Other questions:
  • a square garden with a side of 150m has a square swimming pool in the very center with a side length of 25m calculate the area o
    11·1 answer
  • What is 2+(9-5)x7-3/4
    5·1 answer
  • Can someone please tell me the formula for finding the volume of a cone
    14·1 answer
  • There are 416 students who are enrolled in an introductory geology course. if there are seven boys to every six girls, how many
    14·1 answer
  • NEED HELP IM BEGGING YOU PLEASE!!!!!!!!!
    8·2 answers
  • Can someone help meeeeeeeeeeeeeeee
    9·2 answers
  • The answer is not $4.99
    11·1 answer
  • Find the measures of variation for the following set of data:
    6·1 answer
  • A container is in a shape of a right circular cylinder standing on its base. If 100 cubic centimeters of water is poured into th
    11·1 answer
  • Plz help plz only I need the answer
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!