In this note we characterize all regular tetrahedra whose vertices in R 3 have integer coordinates. The main result is a consequence of the characterization of all equilateral triangles having integer coordinates ([3]). Previous work on this topic began in [4]. We will use this characterization to point out some corollaries. The number of such tetrahedra whose vertices are in the finite set {0, 1, 2, ..., n} 3 , n ∈ N, is related to the sequence A103158 in the Online Encyclopedia of Integer Sequences ([9])
This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in ...
If one has three sticks (lengths), when can you make a triangle with the sticks? As long as any two...
This largely expository lecture deals with aspects of traditional solid geometry suitable for applic...
In this note we characterize all regular tetrahedra whose vertices in R 3 have integer coordinates. ...
AbstractTextIn this note we characterize all regular tetrahedra whose vertices in R3 have integer co...
In this paper we introduce theoretical arguments for constructing a procedure that allows one to fin...
We study the existence of equilateral triangles of given side lengths and with integer coordinates i...
Extending previous results on a characterization of all equilateral triangle in space having vertice...
AbstractTextExtending previous results on a characterization of all equilateral triangle in space ha...
The main aim of this paper is to describe a procedure for calculating the number of cubes that have ...
In this paper we describe a procedure for calculating the number of regular octahedra, RO(n), which ...
In this paper we calculate the Ehrhart’s polynomial associated with a 2-dimensional regular polytope...
This paper is a continuation of the work started by the second author in a series of papers. We exte...
The problem of tiling or tessellating (i.e., completely filling) three-dimensional Euclidean space R...
First, we calculate the Ehrhart polynomial associated with an arbitrary cube with integer coordinate...
This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in ...
If one has three sticks (lengths), when can you make a triangle with the sticks? As long as any two...
This largely expository lecture deals with aspects of traditional solid geometry suitable for applic...
In this note we characterize all regular tetrahedra whose vertices in R 3 have integer coordinates. ...
AbstractTextIn this note we characterize all regular tetrahedra whose vertices in R3 have integer co...
In this paper we introduce theoretical arguments for constructing a procedure that allows one to fin...
We study the existence of equilateral triangles of given side lengths and with integer coordinates i...
Extending previous results on a characterization of all equilateral triangle in space having vertice...
AbstractTextExtending previous results on a characterization of all equilateral triangle in space ha...
The main aim of this paper is to describe a procedure for calculating the number of cubes that have ...
In this paper we describe a procedure for calculating the number of regular octahedra, RO(n), which ...
In this paper we calculate the Ehrhart’s polynomial associated with a 2-dimensional regular polytope...
This paper is a continuation of the work started by the second author in a series of papers. We exte...
The problem of tiling or tessellating (i.e., completely filling) three-dimensional Euclidean space R...
First, we calculate the Ehrhart polynomial associated with an arbitrary cube with integer coordinate...
This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in ...
If one has three sticks (lengths), when can you make a triangle with the sticks? As long as any two...
This largely expository lecture deals with aspects of traditional solid geometry suitable for applic...