1. From the integers 1 to 100, select two numbers without repetition to form an ordered pair (x,y), such that the product xy is not divisible by 3. How many such pairs can be formed?
A number or a short expression. Spacing and $ signs are ignored.
Solution
1. 4422 .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.