On Hardy's Apology Numbers

03/11/2021
by   Peyman Nasehpour, Ph.D., et al.
0

Twelve well-known "Recreational" numbers are generalized and classified in three generalized types Hardy, Dudeney, and Wells. A novel proof method to limit the search for the numbers is exemplified for each of the types. Combinatorial operators are defined to ease programming the search.

READ FULL TEXT
research
07/26/2022

Searching on the boundary of abundance for odd weird numbers

Weird numbers are abundant numbers that are not pseudoperfect. Since the...
research
07/19/2020

Approaches to the implementation of generalized complex numbers in the Julia language

In problems of mathematical physics, to study the structures of spaces u...
research
02/07/2022

L^2-Betti numbers and computability of reals

We study the computability degree of real numbers arising as L^2-Betti n...
research
08/29/2020

A remark on entropy numbers

Talagrand's fundamental result on the entropy numbers is slightly improv...
research
07/28/2019

Uniform Orderings for Generalized Coloring Numbers

The generalized coloring numbers scol_r(G) and wcol_r(G) of a graph G we...
research
01/24/2017

Computations with p-adic numbers

This document contains the notes of a lecture I gave at the "Journées Na...
research
09/05/2020

Machine Learning Calabi-Yau Four-folds

Hodge numbers of Calabi-Yau manifolds depend non-trivially on the underl...

Please sign up or login with your details

Forgot password? Click here to reset