All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Sum Inverse LCMs (Posted on 2008-10-03) Difficulty: 3 of 5
Each of P, Q, R, S and T are positive integers with P < Q < R < S < T. Determine the maximum value of the following expression.

[P, Q] -1 + [Q, R] -1 + [R, S] -1 + [S, T] -1

Note: [x, y] represents the LCM of x and y.

No Solution Yet Submitted by K Sengupta    
Rating: 3.5000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: Extension (and ideas)Steve Herman2008-10-05 11:05:39
Hints/TipsExtension (and ideas)Gamer2008-10-04 13:51:26
re(2): a stab (proof)Steve Herman2008-10-04 01:06:44
SolutionSolutionDej Mar2008-10-03 21:22:54
re: a stab (proof)Daniel2008-10-03 14:24:29
Some Thoughtsa stabLeming2008-10-03 14:12:20
looks obvious .......spoilerAdy TZIDON2008-10-03 12:36:47
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information