We study integral similitude 3 × 3-matrices and those positive integers which occur as products of their row elements, when matrices are symmetric with the same numbers in each row. It turns out that integers for which nontrivial matrices of this type exist define elliptic curves of nonzero rank and are closely related to generalized cubic Fermat equations.

For any positive integer $k\ge 2$, let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence which starts with $0,\cdots ,0,1$ ($k$ terms) with the linear recurrence $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}\text{for}n\ge 2.$$ Let ${\left(N_n\right)}_{n\ge 0}$ be Narayana’s sequence given by $$N_0=N_1=N_2=1\text{and}{N}_{n+3}=N_{n+2}+N_n.$$ The purpose of this paper is to determine all $k$-Pell numbers which are sums of two Narayana’s numbers. More precisely, we study the Diophantine equation $$P_p^{\left(k\right)}=N_n+N_m$$ in nonnegative integers $k$, $p$, $n$ and $m$.

This paper is concerned with non-trivial solvability in $p$-adic integers of systems of additive forms. Assuming that the congruence equation $a{x}^k+b{y}^k+c{z}^k\equiv d\left(modp\right)$ has a solution with $xyz\not\equiv 0\left(modp\right)$ we have proved that any system of $R$ additive forms of degree $k$ with at least $2·3^{R-1}·k+1$ variables, has always non-trivial $p$-adic solutions, provided $p\nmid k$. The assumption of the solubility of the above congruence equation is guaranteed, for example, if $p\>k^4$.

Let $k\ge 2$ and let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence defined by $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}$$ for $n\ge 2$ with initial conditions $$P_{-(k-2)}^{\left(k\right)}=P_{-(k-3)}^{\left(k\right)}=\cdots =P_{-1}^{\left(k\right)}=P_0^{\left(k\right)}=0,P_1^{\left(k\right)}=1.$$ In this study, we handle the equation $P_n^{\left(k\right)}=y^m$ in positive integers $n$, $m$, $y$, $k$ such that $k,y\ge 2,$ and give an upper bound on $n.$ Also, we will show that the equation $P_n^{\left(k\right)}=y^m$ with $2\le y\le 1000$ has only one solution given by $P_7^{\left(2\right)}={13}^2.$