The classic problem of decomposing an even number, 2N, where N is a composite number, to be expressed as the sum of two prime numbers, is considered. In this work we state two sufficient (and ap-parently indepe11cl'-'fll qf each other) onditions to achieve it. The prou.f of the ·orrespo11di11 :r theorems is based on well-known mathe-mati al results. Finally, cm ulgorithm that retums the aforemen-tioned decomposition is detailed.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados