GCD property

Note by Shivamani Patil
4 years, 8 months ago

No vote yet
1 vote

</code>...<code></code> ... <code>.">   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 </span>...<span></span> ... <span> or </span>...<span></span> ... <span> to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

c(a+b)cacbc | (a+b) \rightarrow c|a \wedge c|b is wrong. Easily counterexample as a=4,b=5,c=3)a = 4, b = 5, c = 3).

Samuraiwarm Tsunayoshi - 4 years, 8 months ago

Log in to reply

Hint: use Bezout's identity

Samuraiwarm Tsunayoshi - 4 years, 8 months ago

Log in to reply

Another hint: (a,b)=1(a,b) = 1 if and only if ax+by=1ax+by = 1.

Samuraiwarm Tsunayoshi - 4 years, 8 months ago

Log in to reply

@Samuraiwarm Tsunayoshi Hey,@Samuraiwarm Tsunayoshi check my sol in Kartik Sharma's solution's replay box.

shivamani patil - 4 years, 8 months ago

Log in to reply

Let a=p1e1p2e2p3e3.....pnena = {{p}_{1}}^{{e}_{1}}{{p}_{2}}^{{e}_{2}}{{p}_{3}}^{{e}_{3}}..... {{p}_{n}}^{{e}_{n}}

Now, a=0modpia = 0 mod {p}_{i}

We know that gcd(a,b) = 1, so none of the pi{p}_{i} divide b

cn=a+bcn = a + b

cnmodp1=0+xcn mod {p}_{1} = 0 + x

cn=xmodp1cn = x mod {p}_{1}

And so on, till pn{p}_{n} which tells us that pi{p}_{i} doesn't divide c. Therefore there is no common divisor of c and a, so, gcd(a,c)=1gcd(a,c) = 1

Similarly we can show for b.

@shivamani patil Check out and now I think it is fine.

Kartik Sharma - 4 years, 8 months ago

Log in to reply

If gcd(a,b) then ax+by=1ax+by=1 also cn=a+bcn=a+b for some nn because ca+bc|a+b.Therefore cnb=acn-b=a,substituting cnb=acn-b=a in first equation we get x(cnb)+by=1=cnxbx+by=c(nx)+b(yx)x(cn-b)+by=1=cnx-bx+by=c(nx)+b(y-x) which implies gcd(c,b)=1.Similarly gcd(c,a)=1.@Kartik Sharma how is it??Your's is good.

shivamani patil - 4 years, 8 months ago

Log in to reply

Yep, looks good.

Samuraiwarm Tsunayoshi - 4 years, 8 months ago

Log in to reply

I knew about this method too but that is already discussed by Samuraiwarm Tsunayoshi.

Kartik Sharma - 4 years, 8 months ago

Log in to reply

@Kartik Sharma But I solved it independently @Kartik Sharma

shivamani patil - 4 years, 8 months ago

Log in to reply

Note that ab a|b implies that there exists an integer k k suck that ka=b ka = b , not kb=a kb = a . So your assumption that c=n(a+b) c = n(a+b) is wrong. It should be cn=a+b cn = a+b .

Siddhartha Srivastava - 4 years, 8 months ago

Log in to reply

Oh damn yes ! I knew it but just a silly mistake. Now, I am gonna edit it.

Kartik Sharma - 4 years, 8 months ago

Log in to reply

@Kartik Sharma Looking forward to your solution!

Samuraiwarm Tsunayoshi - 4 years, 8 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...