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
JulsSmile [24]
2 years ago
11

The most useful index fossils are of organisms that are still alive today.

Computers and Technology
2 answers:
VLD [36.1K]2 years ago
7 0
It is true.

Happy Studying!
mars1129 [50]2 years ago
4 0
Im going to say that the answer is true but this is a earth science question next time please post in science category!
You might be interested in
Bill Schultz works at a high power investment firm in Los Angeles. Bill is responsible for promoting the firm's vision and creat
Anna35 [415]

Answer:a

Explanation:

4 0
3 years ago
Assume you have written a method with the header num mymethod(string name, string code). the method's type is
azamat
I need answer choices
5 0
3 years ago
Is this statement true or false? You can apply only one of these at a time: underline, bold, or italics. true false
Lelechka [254]
I think false not sure but let other people help u answer and u can decide
8 0
3 years ago
Employees often attend trainings and read policies. They endure these, but do not internalize them. What should be your first st
Vlada [557]

Answer:

I would say b but if I'm wrong take the point back

7 0
2 years ago
The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is
gavmur [86]

Answer:

False

Explanation:

The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.

The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:

  • If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
  • If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
  • Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
  • Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
  • Repeat the above steps again till R = 0.

4 0
3 years ago
Other questions:
  • The internet is an example of
    12·2 answers
  • Text that has equal left and right margins is said to be
    14·2 answers
  • 350 square feet requires 1 gallon of paint. Assign gallons_paint with the amount of paint required for wall_area. Sample output
    12·1 answer
  • A computer supply company is located in a building with three wireless networks.
    10·1 answer
  • Create an application named Percentages whose main() method holds two double variables. Assign values to the variables. Pass bot
    14·1 answer
  • Nate wants to copy the style of his contact address to the normal template. Complete the paragraph to describe how he can access
    12·2 answers
  • A high school in a low-income area offers special programs to help students acquire the technical skills needed to find jobs as
    12·1 answer
  • Suppose an IP packet is fragmented into 10 fragments, each with a 1% (independent) probability of loss. To a reasonable approxim
    15·1 answer
  • 4.2 lesson practice last one plzs help
    5·2 answers
  • mary needs to rename her report.txt file to final_report.txt. which command will allow her to do this?
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!