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

Home > Just Math
Sets' intersection (Posted on 2017-02-16) Difficulty: 3 of 5
Let k be a positive integer.
Prove that there must exist a positive integer n such that the sets
A( A={1^2, 2^2, 3^2, . . . }) and B ( B = {1^2+n, 2^2+n, 3^2+n, . . . }) share exactly k identical members.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: solution Comment 2 of 2 |
(In reply to solution by Paul)

Nice work, Paul
  Posted by Steve Herman on 2017-02-17 09:50:32

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information