perplexus.info :: Logic : No doubles

No doubles (Posted on 2022-05-02)

Can you create a subset of (1, 2, 3, ..., 3k) such that none of its 2k-1 members is twice the value of another?

Either provide such a set or show none exists.

Inspired by: Austrian-Polish Math. Competition.

Submitted by Ady TZIDON

Rating: 4.5000 (2 votes)

Solution: (Hide)

Not always, it depends on k.
See broll’s detailed comment

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
A final note on the original question	broll	2022-05-03 06:16:53
re(3): Idea, no proof	broll	2022-05-03 03:07:36
re: Another Idea	broll	2022-05-03 02:59:24
re(3): Idea, no proof	broll	2022-05-02 23:23:29
re(3): Idea, no proof	Kenny M	2022-05-02 15:22:59
re(2): Idea, no proof	Jer	2022-05-02 13:35:07
Another Idea	Brian Smith	2022-05-02 10:35:31
re: Idea, no proof	broll	2022-05-02 09:35:53
Possible Solution	broll	2022-05-02 08:21:47
Idea, no proof	Jer	2022-05-02 07:32:24

Please log in:

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

Chatterbox:


perplexus dot info