Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 041 (N-fractions) — Constraint detection

Find 3n non-zero digits satisfying : $ 1 = \ sum _ -LCB- i \ in 1 , ... , n -RCB- x_i / y_iz_i $ where $ y_iz_i $ is shorthand for $ 10y_i + z_i $ and the number of occurrences of each digit in $ 1 , ... ,9 $ is between $ 1 $ and $ ceil -LRB- n/3 -RRB- $ . Since each fraction is at least $ 1/99 $ , this family of problems has solutions for at most $ n > = 99 $ .

Problem 041 (N-fractions) — Detection of the decisions and objects to be modeled

Find 3n non-zero digits satisfying : $ 1 = \ sum _ -LCB- i \ in 1 , ... , n -RCB- x_i / y_iz_i $ where $ y_iz_i $ is shorthand for $ 10y_i + z_i $ and the number of occurrences of each digit in $ 1 , ... ,9 $ is between $ 1 $ and $ ceil -LRB- n/3 -RRB- $ . Since each fraction is at least $ 1/99 $ , this family of problems has solutions for at most $ n > = 99 $ .

Back to list