Find Exactly One Triple from $n$ Objects: $\mod{6}$

  • Context: MHB 
  • Thread starter Thread starter maxkor
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around the problem of finding exactly one triple from a set of $n$ objects, specifically when $n \equiv 3 (\mod{6})$. Participants explore the possibility of forming $\frac{\binom{n}{2}}{3}$ triples such that every pair of objects appears in exactly one triple. The scope includes mathematical reasoning and problem-solving within the context of combinatorial design.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • Post 1 presents the main problem statement regarding the formation of triples from $n$ objects.
  • Post 2 reiterates the problem and provides links to related concepts such as Kirkman's schoolgirl problem and Steiner systems, suggesting these may offer insights.
  • Post 3 encourages participants to share their solutions after a week has passed without any responses.
  • Post 4 expresses a lack of solution from one participant, indicating the challenge of the problem.
  • Post 5, from a moderator, emphasizes the guideline that challenge problems should have a known solution ready to share, reflecting on the expectations for posting in the forum.

Areas of Agreement / Disagreement

There is no consensus on a solution to the problem, and multiple participants express uncertainty or lack of solutions. The discussion remains unresolved regarding the approach to solving the problem.

Contextual Notes

Participants have not provided specific assumptions or mathematical steps that could clarify the problem further. The discussion reflects a range of experiences with problem-solving in this context.

maxkor
Messages
79
Reaction score
0
Let $n \equiv 3 (\mod{6})$ objects $a_1, a_2, \dots, a_n$, show one can find $\frac{\binom{n}{2}}{3}$ triples $(a_i,a_j,a_k)$ such that every pair $(a_i,a_j) (i \ne j)$ appears in exactly one triple.
 
Mathematics news on Phys.org
maxkor said:
Let $n \equiv 3 (\mod{6})$ objects $a_1, a_2, \dots, a_n$, show one can find $\frac{\binom{n}{2}}{3}$ triples $(a_i,a_j,a_k)$ such that every pair $(a_i,a_j) (i \ne j)$ appears in exactly one triple.

A week has now gone by...perhaps you would like to share with us your solution to this problem. :D
 
MarkFL said:
A week has now gone by...perhaps you would like to share with us your solution to this problem. :D

I do not have a solution
 
maxkor said:
I do not have a solution

Hi maxkor, welcome to MHB and you're certainly welcome to post challenging problem(s) at our Challenge Questions and Puzzles sub forum because our members love all those fun for solving interesting and challenging math problems!:)

But, as the moderator of this sub forum, I need to remind you one of the guidelines that the posters of the challenge problems should adhere to and follow:

This forum is for the posting of problems and puzzles which our members find challenging, instructional or interesting and who wish to share them with others. As such, the OP should already have the correct solution ready to post in the event that no correct solution is given within at least 1 week's time.

Since you are new to this sub forum, I know perhaps you are not aware of such a guideline might exist and as such, please bear in mind that when you wanted to post for any challenge problem(s) here, please also be certain that you have already the solution in full at hand.

As a frequent challenge problems poster, I always solved any hard problem first before I made them a challenge here, and if I don't solve it by myself but have solution of other at hand and that the problem is interesting and challenging, I would post them here too. On the other hand, if I saw a great and hard problem of which I couldn't solve but eagerly wanted to know how to tackle it, then I would post it to ask for help from our members, rather than posing them as a challenge problem. This is my experience that I want to share it with you.:)
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K