The concept of k-level for positive integers
It is said (cf . [4]) that a positive integer n satisfies property (N) if there exists a representation of n as a sum of 3 squares, n = x1+x2+x3 , with (x 1 ,n) = 1 and x~ < n31 . It has been checked that every positive integer n < 600000, n - 3(mod 8), verifies property (N) .
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 1986 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:2445/132747 |
| Acceso en línea: | https://hdl.handle.net/2445/132747 |
| Access Level: | acceso abierto |
| Palabra clave: | Optimització combinatòria Combinatorial optimization |
| Sumario: | It is said (cf . [4]) that a positive integer n satisfies property (N) if there exists a representation of n as a sum of 3 squares, n = x1+x2+x3 , with (x 1 ,n) = 1 and x~ < n31 . It has been checked that every positive integer n < 600000, n - 3(mod 8), verifies property (N) . |
|---|