Please post solution to the given problem. I am not able to figure out the solution, so please help. Thank You.

What is the remainder of \(m\) satisfying \[\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{133}=\frac{m}{133!}\] upon division by \(67 ?\)

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestThank you

Log in to reply

To get the \(133!\) in the denominator's place of the sum of fraction,you will have to multiply \(1\) with \(2 \times 3\times4\times....\times132\times133\) and \(2\) with \(1\times3\times4\times5...\times132\times133\) and so on till \(133\).Then observe that \(m\) will be the sum of these products,now observe that every product,except for one,will have 67 in it.The one which will not have it will be,\(\dfrac{1}{67}\) that is,\(1\times2\times3\times...66\times68\times69\times....132\times133\).You basically have to find that mod \(67\).That will be,\(1*2*3*...*66*1*2*3*...66=(66!)^2=(-1)^2=1(\pmod{67}\),this we have from Wilson's theorem!Swapnil Das

Log in to reply

Remainder is 0 as m is 133*133!

Log in to reply

Delete the post.

Log in to reply

Is the answer 1?

Log in to reply

@Swapnil Das

Log in to reply

Yes, really thank you Adarsh sir!

Log in to reply

Log in to reply