A problem due to Martin LaBar is to find a 3x3 magic square with 9 distinct perfect square entries or prove that such a magic square cannot exist (LaBar [1]). This problem has been tied to various domains including arithmetic progressions, rational right triangles, and elliptic curves (Robertson [2]). However, there are some interesting properties that can be derived without ever leaving the do...

Magic squares have turned up throughout history, some in a mathematical context, others in philosophical or religious contexts. According to legend, the first magic square was discovered in China by an unknown mathematician sometime before the first century A.D. It was a magic square of order three thought to have appeared on the back of a turtle emerging from a river. Other magic squares surfa...

In this paper Freud's work on animism and magic is elaborated. Those two subjects are presented mainly in his work "Totem and Taboo" (1913). The true motives, which lead primitive man to practice magic are, according to Freud, human whishes and his immense belief in their power. Importance attached to wishes and to the will has been extended from them to all those psychical acts, which are subj...

An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to the integers {1, ..., q} such that all p vertex sums are pairwise distinct, where the vertex sum on a vertex is the sum of labels of all edges incident to such vertex. A graph is called anti-magic if it has an anti-magic labeling. Hartsfield and Ringel [3] conjectured t...

The purpose of the present investigation was to analyse interviews of highly regarded Finnish magicians. Social network analysis (N = 120) was used to identify Finland's most highly regarded magicians (N = 16). The selected participants' careers in professional magic and various aspects of their professional conduct were examined by relying on semi-structured interviews. The results revealed th...

We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we extend the enumeration of the total labelings on these classes of graphs.