Sums + number theory

lcm ( 1 , 77 ) + lcm ( 2 , 77 ) + lcm ( 3 , 77 ) + + lcm ( 77 , 77 ) = ? \text{lcm}(1,77) + \text{lcm}(2,77) + \text{lcm}(3,77) + \cdots + \text{lcm}(77,77) = \, ?

Notation : lcm ( a , b ) \text{lcm}(a,b) denote the Lowest Common Multiple of a a and b b .


The answer is 183799.

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.

3 solutions

Otto Bretscher
Dec 7, 2015

Relevant wiki: Lowest Common Divisor - Problem Solving

There is a formula for this sum, n 2 ( 1 + Σ d n d × ϕ ( d ) ) \frac{n}{2}\left(1+\Sigma_{d|n}d\times\phi(d)\right) , which we can use for n = 77 n=77 : We find 77 2 ( 1 + 1 1 + 7 6 + 11 10 + 77 60 ) = 183799 \frac{77}{2}(1+1*1+7*6+11*10+77*60)=\boxed{183799} .

Let me outline a proof of the formula n 2 ( 1 + Σ d n d × ϕ ( d ) ) \frac{n}{2}\left(1+\Sigma_{d|n}d\times\phi(d)\right) . The sum we seek is n Σ k = 1 n k gcd ( k , n ) . n\Sigma_{k=1}^{n}\frac{k}{\gcd(k,n)}. Now add up the terms such that gcd ( k , n ) \gcd(k,n) is a given divisor d d of n n . There are ϕ ( n / d ) \phi(n/d) such terms and the average value of k k is n 2 \frac{n}{2} by symmetry (except when d = n ) d=n) . Thus the sum is n 2 ( 1 + d n n d ϕ ( n / d ) ) \frac{n}{2}\left(1+\sum_{d|n}\frac{n}{d}\phi(n/d)\right) , where the added 1 accounts for the special case d = n d=n . We obtain our formula by substituting d d for n d \frac{n}{d} .

Thanks for this formula

Dev Sharma - 5 years, 6 months ago

So theres a formula like that. I had to do a little hardwork To get the answer

Shreyash Rai - 5 years, 5 months ago
Curtis Clement
Dec 6, 2015

Solution: A = l c m [ 7 , 77 ] + l c m [ 14 , 77 ] + . . . + l c m [ 70 , 77 ] = 77 ( 1 + 2 + . . . + 10 ] = 77 × 55 = 4235 \ A = lcm[7,77] +lcm[14,77]+...+lcm[70,77] = 77(1+2+...+10] = 77 \times\ 55 = 4235 B = l c m [ 11 , 77 ] + l c m [ 22 , 77 ] + . . . + l c m [ 66 , 77 ] = 77 ( 1 + 2 + . . . + 6 ) = 77 × 21 = 1617 \ B = lcm[11,77] +lcm[22,77]+...+lcm[66,77] = 77(1+2+...+6) = 77 \times\ 21 = 1617 Now let x be a positive integer such that: g c d ( x , 77 ) = 1 \ gcd(x,77) = 1 then C = l c m [ x , 77 ] = 77 ( ( k = 1 k = 76 k ) 7 ( 1 + 2 + . . . + 10 ) 11 ( 1 + 2 + . . . + 6 ) ) = 77 ( 2926 231 385 ) \ C = \sum_{}^{} lcm[x,77] = 77(( \displaystyle\sum_{k=1}^{k=76} k )-7(1+2+...+10) - 11(1+2+...+6) ) = 77(2926 -231-385) = 77 × 2310 = 177870 \ = 77 \times\ 2310 = 177870 k = 1 k = 77 l c m [ k , 77 ] = A + B + C + l c m [ 77 , 77 ] = 4235 + 1617 + 177870 + 77 = 183799 \therefore\displaystyle\sum_{k=1}^{k=77} lcm[k,77] = A+B+C+lcm[77,77] = 4235 +1617 +177870 +77 = \boxed{183 799}

Exactly the same !

Sami Mohamed Mansour - 4 years, 2 months ago

the ans should be 179179

Dev Sharma - 5 years, 6 months ago

Log in to reply

Can you explain why? Note that you could report the problem to ensure a response.

Calvin Lin Staff - 5 years, 6 months ago

Log in to reply

Let me explain how I got the same answer. The sum can be written like 11 7 ( 1 + 2 + 3 + 2 2 + 5 + 2 3 + 1 ( ! ) + 2 3 + 3 2 + 2 5 + 1 ( ! ) + 2 2 3 + . . . ) 11*7*(1+2+3+2^2+5+2*3+1(!)+2^3+3^2+2*5+1(!)+2^2*3+...) . We can notice that in the brackets there is a sequence from 1 to 77 with an exception for multiples of 7 and 11 when we keep only primes (to some power) different to 11 or 7.

The formula: 11 7 ( i = 1 77 i i = 1 11 7 i + i = 1 11 i i = 1 7 11 i + i = 1 7 i ) 11*7*(\sum_{i=1}^{77} i - \sum_{i=1}^{11} 7*i +\sum_{i=1}^{11} i - \sum_{i=1}^7 11*i +\sum_{i=1}^7 i)

Sergei Krestianskov - 5 years, 6 months ago

Log in to reply

@Sergei Krestianskov Thanks for the explanation. This helps me track down the reason for why your answer differs.

Review the Principle of Inclusion and Exclusion (PIE) , to learn how to deal with counting such cases of duplicity. You are right in saying "We want all numbers, with an exception for multiples of 7 and 11". However, in your count, you didn't do exactly that. You removed 77 twice, once as a multiple of 7 (and added 11 to the count), and again as a multiple of 11 (and added 7 to the count). Instead, you should have only removed 77 once, and added 1 to the count (because it only adds 77 × 1 77 \times 1 , and not 77 × 7 77 \times 7 or ( 77 × 11 ( 77 \times 11 ).

As such, your answer would be smaller by 77 × ( 77 11 7 + 1 ) = 77 × 60 = 4620 = 183799 179179 77 \times ( 77 - 11 - 7 + 1 ) = 77 \times 60 = 4620 = 183799 - 179179 . Thus, you had the right idea, but performed the wrong calculation.

@Dev Sharma See this explanation.

Calvin Lin Staff - 5 years, 6 months ago

Log in to reply

@Calvin Lin Thanks....

Dev Sharma - 5 years, 6 months ago

I'm afraid the consensus is that the numerical answer is 183799. I'll make sure to post a full solution when I have enough time

Curtis Clement - 5 years, 6 months ago

Log in to reply

I concur it is 183799. I tallied it up on a spreadsheet. The majority of the numbers {1,2,3,...,77} are relative prime to 77 besides the multiples of 7 and 11. There are only 17 pairs that the lcm(a,b) is something other than a*b. This method took all of 3 minutes. Sometimes the brute force method is the best method.

Ken Hodson - 5 years, 6 months ago
Kafi Shabbir
Dec 14, 2015

I don't know how I did it but I got it right

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...