lcm ( 1 , 7 7 ) + lcm ( 2 , 7 7 ) + lcm ( 3 , 7 7 ) + ⋯ + lcm ( 7 7 , 7 7 ) = ?
Notation : lcm ( a , b ) denote the Lowest Common Multiple of a and b .
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.
Thanks for this formula
So theres a formula like that. I had to do a little hardwork To get the answer
Solution: A = l c m [ 7 , 7 7 ] + l c m [ 1 4 , 7 7 ] + . . . + l c m [ 7 0 , 7 7 ] = 7 7 ( 1 + 2 + . . . + 1 0 ] = 7 7 × 5 5 = 4 2 3 5 B = l c m [ 1 1 , 7 7 ] + l c m [ 2 2 , 7 7 ] + . . . + l c m [ 6 6 , 7 7 ] = 7 7 ( 1 + 2 + . . . + 6 ) = 7 7 × 2 1 = 1 6 1 7 Now let x be a positive integer such that: g c d ( x , 7 7 ) = 1 then C = ∑ l c m [ x , 7 7 ] = 7 7 ( ( k = 1 ∑ k = 7 6 k ) − 7 ( 1 + 2 + . . . + 1 0 ) − 1 1 ( 1 + 2 + . . . + 6 ) ) = 7 7 ( 2 9 2 6 − 2 3 1 − 3 8 5 ) = 7 7 × 2 3 1 0 = 1 7 7 8 7 0 ∴ k = 1 ∑ k = 7 7 l c m [ k , 7 7 ] = A + B + C + l c m [ 7 7 , 7 7 ] = 4 2 3 5 + 1 6 1 7 + 1 7 7 8 7 0 + 7 7 = 1 8 3 7 9 9
Exactly the same !
the ans should be 179179
Log in to reply
Can you explain why? Note that you could report the problem to ensure a response.
Log in to reply
Let me explain how I got the same answer. The sum can be written like 1 1 ∗ 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: 1 1 ∗ 7 ∗ ( ∑ i = 1 7 7 i − ∑ i = 1 1 1 7 ∗ i + ∑ i = 1 1 1 i − ∑ i = 1 7 1 1 ∗ i + ∑ i = 1 7 i )
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 7 7 × 1 , and not 7 7 × 7 or ( 7 7 × 1 1 ).
As such, your answer would be smaller by 7 7 × ( 7 7 − 1 1 − 7 + 1 ) = 7 7 × 6 0 = 4 6 2 0 = 1 8 3 7 9 9 − 1 7 9 1 7 9 . Thus, you had the right idea, but performed the wrong calculation.
@Dev Sharma See this explanation.
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
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.
I don't know how I did it but I got it right
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Lowest Common Divisor - Problem Solving
There is a formula for this sum, 2 n ( 1 + Σ d ∣ n d × ϕ ( d ) ) , which we can use for n = 7 7 : We find 2 7 7 ( 1 + 1 ∗ 1 + 7 ∗ 6 + 1 1 ∗ 1 0 + 7 7 ∗ 6 0 ) = 1 8 3 7 9 9 .
Let me outline a proof of the formula 2 n ( 1 + Σ d ∣ n d × ϕ ( d ) ) . The sum we seek is n Σ k = 1 n g cd ( k , n ) k . Now add up the terms such that g cd ( k , n ) is a given divisor d of n . There are ϕ ( n / d ) such terms and the average value of k is 2 n by symmetry (except when d = n ) . Thus the sum is 2 n ( 1 + ∑ d ∣ n d n ϕ ( n / d ) ) , where the added 1 accounts for the special case d = n . We obtain our formula by substituting d for d n .