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) .

Detalhes bibliográficos
Autor: Arenas, A. (Àngela), 1955-
Tipo de documento: artigo
Estado:Versão publicada
Data de publicação:1986
País:España
Recursos:Universidad de Barcelona
Repositório:Dipòsit Digital de la UB
OAI Identifier:oai:diposit.ub.edu:2445/132747
Acesso em linha:https://hdl.handle.net/2445/132747
Access Level:Acceso aberto
Palavra-chave:Optimització combinatòria
Combinatorial optimization
Descrição
Resumo: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) .