Prove that for every natural number n, fraction 21 n + 4

encamineu2cki

encamineu2cki

Answered question

2022-04-12

Prove that for every natural number n, fraction 21 n + 4 14 n + 3 is irreducible. I deduced that if we can prove that numerator and denominator have 1 as their GCD, we can get the result, but I cannot get it from thereon.

Answer & Explanation

Mollie Roberts

Mollie Roberts

Beginner2022-04-13Added 21 answers

Going by Euclidean algorithm:
G C D ( 21 n + 4 , 14 n + 3 ) = G C D ( 7 n + 1 , 14 n + 3 ) = G C D ( 7 n + 1 , 1 ) = 1
Azzalictpdv

Azzalictpdv

Beginner2022-04-14Added 2 answers

21 n + 4 = ( 14 n + 3 ) + 7 n + 1
14 n + 3 = 2 ( 7 n + 1 ) + 1

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?