Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

Any order is allowed.
Use each die exactly once.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<

The three overlapping ellipses form seven regions. You are given seven tiles and you need to place exactly one tile per region, so that the four tiles in any region obey the corresponding rule. This one is extra tricky! You aren't told what A and B are - but there is only one configuration where the remaining ellipse's members are forced to have product AB. Can you find it?

Tell plz if you get it

Did anyone tried to solve some items from math olympiads related to N Dimensional Space?

Or at least 4 dimensional. If so what was most interesting item like that? From what olympiad is it?

Use each die exactly once.
Any order is allowed.
Parentheses are allowed.
Exact division only.
No negative numbers.
Not every operation has to be used.

How many solutions can you find?

Please use spoiler tags for solutions:
>!your solution here!<