#how to do this?
119 messages · Page 1 of 1 (latest)
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
You can find the greatest common factor using Euclid's algorithm, and the least common multiple is just the product divided by the GCD.
...greatest common divisor. Sorry, I called it a "factor", but I meant to say "divisor".
but
u cant do both
the question asks smthign specific
so how do uk when to find which
@cosmic solar
I mean, you can do both.
but that takes more time
and its confusinf
confusing
i didnt understand how u do both
@cosmic solar
so
once u find the lcm
u divide it by
no. of pens and and no. of boxes of pencils
...can you please try to write complete sentences?
Okay, look, think about it like this.
What you want is 40x = 15y, with x and y integers.
Now, there's actually infinitely many solutions.
Because if (x, y) is a solution, so is (x + 15, y + 40).
In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).
It is an exa...
omg
theres no need to complicate stuff
im only in 9th gradeðŸ˜
u are doing math in a completely different way
then me
This is not remotely complicated. This is literally such a basic result of number theory that it dates back to 300 BCE.
Calling this complicated is like calling the Pythagorean theorem complicated.
im gonna cry
u dont have a way to
know which 1
to use?
in these kind of questions?
Complete sentences, please. And what do you mean "which one"? There's only one Euclidean algorithm.
You always find the GCD, because you have to to find the LCM.
And finding the GCD is what Euclid's algorithm does.
No.
Not unless you use full sentences.
cope man
Use full sentences or you can cope with me leaving.
It's annoying, and I'm not in the habit of helping people who annoy me on purpose.
im not annoying u on pupose
it jus take so much extra energy
and
its like 6 in the morining
im a lil tired
Why aren't you asleep?
No, you have to sleep. Studying won't help you if you're too tired to remember anything.
If you slept, why are you tired?
Why?
BECUZ I HAD TO STUDY
No, you need to sleep.
is this wt u do?
its the simplest way rite?
@cosmic solar
How exactly do you plan to find the LCM?
Okay, then do that I guess.
this?
I guess.
will it work for everything?
Maybe.
even this?
Maybe.
I know that the answer is "maybe".
No it's not.
It's not my fault you don't have the attention span to learn.
I DO
You don't even have the attention span to write a whole sentence.
WELL AT LEAST I PUT THE EFFORT TO GET SOME HELP
is help still needed
+close