14 problems
Let have positive lower logarithmic density. Must contain a chain such that …
Let be such that there is no solution to with and the smallest prime factor of is . Estimate the maximum of…
Is it true that, for every , if is a primitive set of integers—meaning that whenever and , the integers and are associated, h…
A set is primitive if no member of divides another. Prove that for every primitive set whose elements are all at least , …
For a finite set , call a subset-sum antichain if, whenever are distinct nonempty subsets, the two sums and…
Let be a sequence of integers. A sequence of positive integers is primitive if no term divides a distinct term. The first question asks for necess…
Let be an integer. Starting with no selected integers, two players alternately add an integer from to a common set , subject to the rule that no two…
Let , let , and, for each , let be an arbitrary subset of the residue ring . Define the survivor…
Let be a countably infinite subset of satisfying the separation condition that for every pair of distinct and every integer , … The question as…
Banks–Martin conjecture analogue. For each , the inequalities
Let and be the functions defined in the paper for . Equality conjecture. … This is one of the paper's open questions concerning the relationship betwe…
Let be the number of prime factors of , counted with multiplicity, and let . For a set of odd primes , write…
For , let denote the integers at least , and let for a primitive set . Erdős–Sárközy–Szemerédi conjecture. … This questio…
Banks–Martin conjecture. The sequence of sums is strictly decreasing: