Waste less time on Facebook — follow Brilliant.
×

Can some explain the concept of co prime?

Note by Aditya Parson
4 years, 8 months ago

No vote yet
2 votes

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # 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"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

more simply, two positive integers \( m \) and \(n \) are coprime if the largest number that divides both \( m \) and \( n \) is \( 1 \).

Hero P. - 4 years, 8 months ago

Log in to reply

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.

Bob Krueger - 4 years, 8 months ago

Log in to reply

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?

Pgv Vishal - 4 years, 8 months ago

Log in to reply

yes it is.

Lingaiah Vallakatla - 4 years, 8 months ago

Log in to reply

any two no. which have HCF 1

Zahid Shekh Mohammed - 4 years, 7 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...