Prove Irreducibility of (21n+4)/(14n+3) for n ∈ N

  • Context: Graduate 
  • Thread starter Thread starter symplectic_manifold
  • Start date Start date
Click For Summary
SUMMARY

The fraction (21n + 4)/(14n + 3) is irreducible for every natural number n, as established by demonstrating that the greatest common divisor (gcd) of the numerator and denominator is 1. This is achieved by showing that there exist integers x and y such that x(21n + 4) + y(14n + 3) = 1. The proof relies on the property that if a common divisor K divides both expressions, it must also divide 1, leading to the conclusion that K equals ±1. This confirms that gcd(21n + 4, 14n + 3) = 1.

PREREQUISITES
  • Understanding of greatest common divisor (gcd) concepts
  • Familiarity with linear combinations of integers
  • Basic knowledge of number theory
  • Experience with mathematical proofs
NEXT STEPS
  • Study the Euclidean algorithm for calculating gcd
  • Explore linear Diophantine equations and their solutions
  • Learn about irreducibility in rational functions
  • Review the implications of the properties of integers in number theory
USEFUL FOR

Mathematicians, students studying number theory, educators teaching mathematical proofs, and anyone interested in the properties of rational functions.

symplectic_manifold
Messages
60
Reaction score
0
Hey, Guys...the following problem from IMO 1959, the very first: Prove that the fraction (21n+4)/(14n+3) is irreducible for every natural number n.
...just can't get what is meant by the given solution: 3(14n+3)-2(21n+4)=1...I mean, what is their "sample" method?!...can't see through...tried to get the same...no chance.
Please, help!
 
Mathematics news on Phys.org
Showing that (21n + 4)/(14n + 3) is irreducible is equivalent to showing that 21n + 4 and 14n + 3 share no common factors, i.e. that gcd(21n + 4, 14n + 3) = 1 (where gcd = greatest common divisor). That, in turn, is equivalent to showing that there exists integers x, y such that x(21n + 4) + y(14n + 3) = 1 (which is what whoever wrote the solution did).

One of the implications of the last theorem: if K divides both 21n + 4 and 14n + 3, then K divides x(21n + 4) + y(14n + 3), which implies that K divides 1. But then K = +/- 1, so gcd(21n + 4, 14n + 3) = 1.

The proof of the other implication can be found http://www.math.swt.edu/~haz/prob_sets/notes/node7.html#SECTION00230000000000000000 .
 
Last edited by a moderator:

Similar threads

  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 55 ·
2
Replies
55
Views
6K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K