**prove that any two consecutive natural nimbers are co-prime** .I understand what this sentence means but if someone says me to prove this I become totally blank.
So please help me

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestCoprime means the gcd of the 2 numbers is one. So the question is asking you to prove that if 2 numbers are consecutive, their only common factor is 1. This is how you do a proof: you write what has to be proved (write RTP- this stands for 'required to prove'), write your working (including dialogue so the reader can understand) and when you have finished your proof, you write Q.E.D. This stands for quad eras demonstratum, which is latin for 'which was to be proved'.

RTP: Any two consecutive natural numbers are co-proime.

Proof: Let the 2 consecutive integers be n and n+1. Frist, find the gcd of n and n+1. Call this gcd(n,n+1) By the ecludian algorithm, gcd(n,n+1) = gcd(n, n+1-n) = gcd(n,1) But the greatest common divisior of any integer and 1, i.e. they are coprime. Thus, any two consecutive natural numbers are co-proime. Q.E.D.

Log in to reply

Thanks,but one question i want to ask is that ,why did you did this

gcd=(n,n+1-n)?Log in to reply

its a theorem called the ecludian algorithm... i will give a wikipedia definition ''The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. ''

In this case, the larger number is n+1, and the difference with the smaller number is n+1-n=1, so it is the same as the gcd(n,1). Which is always 1.

Log in to reply

Co-prime means that the two numbers dont have any common factor other than 1 or their gcd is 1

Log in to reply

@calvin sir help me

Log in to reply