The number of different $$n \times n$$ symmetric matrices with each elements being either $$0$$ or $$1$$ is

$$A$$ system of equations represented by $$AX=0$$ where $$X$$ is a column vector of unknown and $$A$$ is a square matrix containing coefficients has a non-trival solution when $$A$$ is.

The rank of the matrix$$\left[ {\matrix{ 1 & 1 \cr 0 & 0 \cr } } \right]\,\,is$$

Consider the following statements:
S1: The sum of two singular n x n matrices may be non-singular
S2: The sum of two n x n non-singular matrices may be singular

Which of the following statements is correct?