22:["$","div",null,{"data-slot":"card","className":"bg-card text-card-foreground flex flex-col gap-6 rounded-xl border py-6 shadow-sm w-full","children":[["$","div",null,{"data-slot":"card-header","className":"@container/card-header grid auto-rows-min grid-rows-[auto_auto] items-start gap-2 px-6 has-data-[slot=card-action]:grid-cols-[1fr_auto] [.border-b]:pb-6 space-y-4","children":[["$","div",null,{"className":"flex justify-between items-start gap-4","children":[["$","div",null,{"className":"space-y-2","children":[["$","div",null,{"data-slot":"card-title","className":"text-2xl font-bold","children":"color finite no of straight lines in the plane with 3 colors"}],["$","p",null,{"className":"text-sm text-muted-foreground","children":["Source: ","6th QEDMO problem 2 (22. - 29. 8. 2009) https://artofproblemsolving.com/community/c1512515_qedmo_200507"]}]]}],["$","div",null,{"className":"text-sm text-muted-foreground whitespace-nowrap","children":"May 8, 2021"}]]}],["$","div",null,{"className":"flex flex-wrap gap-2","children":[["$","span","21",{"data-slot":"badge","className":"inline-flex items-center justify-center rounded-full border px-2 py-0.5 text-xs font-medium w-fit whitespace-nowrap shrink-0 [&>svg]:size-3 gap-1 [&>svg]:pointer-events-none focus-visible:border-ring focus-visible:ring-ring/50 focus-visible:ring-[3px] aria-invalid:ring-destructive/20 dark:aria-invalid:ring-destructive/40 aria-invalid:border-destructive transition-[color,box-shadow] overflow-hidden border-transparent bg-secondary text-secondary-foreground [a&]:hover:bg-secondary/90","children":"combinatorics"}],["$","span","187",{"data-slot":"badge","className":"inline-flex items-center justify-center rounded-full border px-2 py-0.5 text-xs font-medium w-fit whitespace-nowrap shrink-0 [&>svg]:size-3 gap-1 [&>svg]:pointer-events-none focus-visible:border-ring focus-visible:ring-ring/50 focus-visible:ring-[3px] aria-invalid:ring-destructive/20 dark:aria-invalid:ring-destructive/40 aria-invalid:border-destructive transition-[color,box-shadow] overflow-hidden border-transparent bg-secondary text-secondary-foreground [a&]:hover:bg-secondary/90","children":"Coloring"}],["$","span","360",{"data-slot":"badge","className":"inline-flex items-center justify-center rounded-full border px-2 py-0.5 text-xs font-medium w-fit whitespace-nowrap shrink-0 [&>svg]:size-3 gap-1 [&>svg]:pointer-events-none focus-visible:border-ring focus-visible:ring-ring/50 focus-visible:ring-[3px] aria-invalid:ring-destructive/20 dark:aria-invalid:ring-destructive/40 aria-invalid:border-destructive transition-[color,box-shadow] overflow-hidden border-transparent bg-secondary text-secondary-foreground [a&]:hover:bg-secondary/90","children":"lines"}]]}]]}],["$","div",null,{"data-slot":"card-content","className":"px-6 space-y-8","children":[["$","section",null,{"className":"space-y-3","children":[["$","h2",null,{"className":"text-lg font-semibold","children":"Problem Statement"}],["$","div",null,{"className":"prose dark:prose-invert max-w-none bg-muted/30 p-4 rounded-lg","children":["$","div",null,{"className":"latex","children":["$","span",null,{"className":"__Latex__","dangerouslySetInnerHTML":{"__html":"Let there be a finite number of straight lines in the plane, none of which are three in one point to cut. Show that the intersections of these straight lines can be colored with

3

colors so that that no two points of the same color are adjacent on any of the straight lines. (Two points of intersection are called adjacent if they both lie on one of the finitely many straight lines and there is no other such intersection on their connecting line.)"}}]}]}]]}],"$L24"]}]]}]