User The Masked Avenger

1 vote

What is the most ``diverse'' $k$-subset of $[0, 1]^m$?

answered May 28, 2014 at 16:20

1 vote

Covering a finite subset of $\mathbb{N}$ with prime arithmetic progressions

answered Sep 12, 2014 at 19:44

1 vote

Solving $Ax=e_k$ for standard basis vector $e_k$, sparse $A$

answered Apr 1, 2015 at 6:10

1 vote

Thales' semicircle theorem in higher dimensions

answered Apr 2, 2015 at 19:34

0 votes

Square filling self avoiding walk

answered Sep 21, 2014 at 6:29

0 votes

A prime sequence can be partitioned into two sets of equal or consecutive sum

answered Jan 6, 2015 at 19:40

0 votes

All Integers from the Smallest Digit Stream with a Window Filter

answered May 2, 2014 at 20:11

0 votes

Shortest supersequence of all permutations of $n$ elements

answered May 6, 2014 at 17:43

0 votes

Maximum value of the binomial coefficient as a polynomial

answered Jun 28, 2014 at 19:16

0 votes

Lower bound for Euler's totient for almost all integers

answered Aug 22, 2013 at 16:28

0 votes

A problem in the domino shuffling algorithm

answered Oct 31, 2013 at 17:58

0 votes

Submitting a companion paper with detailed proofs ?

answered Jan 16, 2014 at 16:31

0 votes

An easy-to-state elusive combinatorial problem

answered Jun 26, 2013 at 18:37

0 votes

Relatively free algebras in a variety generated by a single algebra

answered Jan 6, 2014 at 21:20

0 votes

Graphs with dangling edges

answered Feb 21, 2014 at 18:00

0 votes

Accepted

Finding the maximum of a multivariate polynomial of degree one

answered Feb 9, 2014 at 2:17

0 votes

A combinatorial problem - counting the solutions

answered Mar 7, 2014 at 20:24

-1 votes

Upper bound for number of prime numbers in a range

answered Jul 3, 2015 at 19:47

Stack Exchange Network

78 Answers

What is the most ``diverse'' $k$-subset of $[0, 1]^m$?

Covering a finite subset of $\mathbb{N}$ with prime arithmetic progressions

Solving $Ax=e_k$ for standard basis vector $e_k$, sparse $A$

Thales' semicircle theorem in higher dimensions

Square filling self avoiding walk

A prime sequence can be partitioned into two sets of equal or consecutive sum

All Integers from the Smallest Digit Stream with a Window Filter

Shortest supersequence of all permutations of $n$ elements

Maximum value of the binomial coefficient as a polynomial

Lower bound for Euler's totient for almost all integers

A problem in the domino shuffling algorithm

Submitting a companion paper with detailed proofs ?

An easy-to-state elusive combinatorial problem

Relatively free algebras in a variety generated by a single algebra

Graphs with dangling edges

Finding the maximum of a multivariate polynomial of degree one

A combinatorial problem - counting the solutions

Upper bound for number of prime numbers in a range