This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
Two numbers m and n are coprime if GCD(m,n)=1. The GCD is the greatest common divisor of the two. Put more plainly, if you take the prime factorization of m and n, they should have no prime factors in common.
a set of numbers which do not have any common factor except 1 are called co-prime numbers.
eg.:14 n 15 are coprime as they are both divisible by only 1,but 14 and 21 are not co prime as they are divisible by both 1 and 7.that's it.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*or_italics_**bold**or__bold__paragraph 1
paragraph 2
[example link](https://brilliant.org)> This is a quote# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"\(...\)or\[...\]to ensure proper formatting.2 \times 32^{34}a_{i-1}\frac{2}{3}\sqrt{2}\sum_{i=1}^3\sin \theta\boxed{123}Comments
Two numbers m and n are coprime if GCD(m,n)=1. The GCD is the greatest common divisor of the two. Put more plainly, if you take the prime factorization of m and n, they should have no prime factors in common.
more simply, two positive integers m and n are coprime if the largest number that divides both m and n is 1.
a set of numbers which do not have any common factor except 1 are called co-prime numbers. eg.:14 n 15 are coprime as they are both divisible by only 1,but 14 and 21 are not co prime as they are divisible by both 1 and 7.that's it.
easy isn't it?
Log in to reply
yes it is.
any two no. which have HCF 1