Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1981 USAMO Problems/Problem 5

Revision as of 10:09, 5 October 2012 by 1=2 (talk | contribs) (Created page with "==Problem== Show that for any positive real <math>x</math>, <math>[nx]\ge \sum_{1}^{n}\left(\frac{[kx]}{k}\right)</math> ==Solution== {{solution}} ==See Also== {{USAMO box|year=...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Show that for any positive real $x$, $[nx]\ge \sum_{1}^{n}\left(\frac{[kx]}{k}\right)$

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1981 USAMO (Problems • Resources)
Preceded by
Problem 4 		Followed by
Last Question
1 • 2 • 3 • 4 • 5
All USAMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1981_USAMO_Problems/Problem_5&oldid=48798"