Have you heard of Euclidean Algorithm?

( 7 + 7 + 7 + + 7 46 times ) ( 29 + 29 + 29 + + 29 11 times ) = 3 ( 7 + 7 + 7 + + 7 21 times ) ( 29 + 29 + 29 + + 29 5 times ) = 2 \begin{aligned} (\underbrace{7+7+7+\cdots+7}_{46 \text{ times}}) - (\underbrace{29+29+29+\cdots+29}_{11 \text{ times}}) &= 3 \\\\ (\underbrace{7+7+7+\cdots+7}_{21 \text{ times}}) - (\underbrace{29+29+29+\cdots+29}_{5 \text{ times}}) &= 2 \end{aligned}

Is it also possible to find positive integers m m and n n such that ( 7 + 7 + 7 + + 7 m times ) ( 29 + 29 + 29 + + 29 n times ) = 1 ? (\underbrace{7+7+7+\cdots+7}_{m \text{ times}}) - (\underbrace{29+29+29+\cdots+29}_{n \text{ times}}) = 1 ?

Yes No

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

6 solutions

Jon Haussmann
Apr 22, 2017

Subtract the given equations, which gives us 25 7 6 29 = 1 25 \cdot 7 - 6 \cdot 29 = 1 .

That's much easier than my idea!

Whitney Clark - 4 years ago

7 46 322 29 11 319 3; 7 21 147 29 5 145 2; = > 7 25 175 29 6 174 1

Michael Fitzgerald - 3 years, 9 months ago
Andrea Virgillito
Apr 22, 2017

From Bezout's Lemma it is always possible to find two integers x,y such that ax+by=G.C.M. (x,y) with a,b natural numbers. Since 7 and 29 are coprime numbers and the GCM is 1 the ans is Y E S YES

Moreover, we can guarantee that $m$, and $n$ are positive since if $(a,b)$ is a pair of Bezóut cofficients, so is $(a+y,b-x)$. We can repeat this until $b$ is negative and $a$ is positive, as required.

Ivan Barreto - 4 years, 1 month ago

Log in to reply

You are right! Now the solution is complete, thanks. Anyway I suggest you to use LaTex intead of Tex.

Andrea Virgillito - 4 years, 1 month ago
Whitney Clark
May 21, 2017

7x4 = 28.

7x4 - 29x1 = -1.

7(-4) - 29(-1) = 1.

7x29 - 29x7 = 0.

Adding the last two, 7x25 - 29x6 = 1. QED

Brenda Kock
Aug 1, 2017

Can 7m - 29n = 1 ?

7[m - 4n] - n = 1 is possible when m > 4n, n and m pos integers

For m = 4n + 1, n = 6 and m = 25

Avinash Kali
May 23, 2017

The equation can be re-written as

7 m 29 n = 1 7m - 29n = 1

or

7 m 28 n n = 1 7m-28n -n =1

or

7 ( m 4 n ) n = 1 7(m-4n)-n=1

Since n n is an integer, 4 n 4n is also an integer. Since m m is an integer, ( m 4 n ) (m-4n) is also an integer. For the sake of simplicity, let us assume k = m 4 n k=m-4n . The above equation can then be written as

7 k n = 1 7k-n=1

The smallest possible integer values of k k and n n that satisfy the above equation, given that n n is a positive integer are

k = 1 k=1 and n = 6 n=6

Plugging back the value of k k and n n in the previous equation k = m 4 n k=m-4n , we get m = 25 m=25 A quick cross-check shows that 7.25 29.6 = 1 7.25 - 29.6=1

Eric Lucas
May 23, 2017

4x7 - 1x29 = -1

Multiply by 6

24x7 - 6x29 = -6

Add one more 7

25x7 - 6x29 = 1

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...