Four theorems are given on the construction of magic squares. Theorem Iproves that substituting the number k in a N x N magic square by the kth incremental square of a m x m magic square, the resultant mN x mN square is a magic square. Theorem il shows that dividing an even rank N x N magic square i
โฆ LIBER โฆ
On Systematic Procedures for Constructing Magic Squares
โ Scribed by Y.H. Ku; Nan-Xian Chen
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 697 KB
- Volume
- 321
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
โฆ Synopsis
In thejrst part of the paper, a systematic procedure for constructing high-order magic squares as an extension of the lower-order basic magic squares is developed and demonstrated. For a 2N x 2N magic square, one can start with a basic N x N magic square,
๐ SIMILAR VOLUMES
Some theorems on construction of magic s
โ
Y.H. Ku; Nan-Xian Chen
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 661 KB
Systematic Procedure for Constructing Br
โ
J.S Waugh
๐
Article
๐
1982
๐
Elsevier Science
โ 362 KB
A remark on least-squares Galerkin proce
โ
Hui Guo; Hongxing Rui; Chao Lin
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 945 KB
In this paper, we introduce two split least-squares Galerkin finite element procedures for pseudohyperbolic equations arising in the modelling of nerve conduction process. By selecting the least-squares functional properly, the procedures can be split into two subprocedures, one of which is for the
A note on constructive procedure for unb
โ
Neeraj Tiwari; A.K. Nigam
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 362 KB
Efficient computational procedures for t
โ
Harvey Goldstein; Jon Rasbash
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 790 KB
Parallel Construction and Query of Index
โ
Raffaele Giancarlo; Roberto Grossi
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 497 KB