Magazine et Edition

Volume 9 (2022): Edition 16 (June 2022)

Volume 8 (2021): Edition 15 (November 2021)

Volume 8 (2021): Edition 14 (October 2021)

Volume 7 (2020): Edition 13 (November 2020)

Volume 6 (2019): Edition 12 (December 2019)

Volume 6 (2019): Edition 11 (September 2019)

Volume 5 (2018): Edition 10 (December 2018)

Volume 5 (2018): Edition 9 (September 2018)

Volume 4 (2017): Edition 8 (December 2017)

Volume 4 (2017): Edition 7 (May 2017)

Volume 3 (2016): Edition 6 (December 2016)

Volume 3 (2016): Edition 5 (March 2016)

Détails du magazine
Format
Magazine
eISSN
2182-1976
Première publication
16 Apr 2016
Période de publication
2 fois par an
Langues
Anglais

Chercher

Volume 3 (2016): Edition 6 (December 2016)

Détails du magazine
Format
Magazine
eISSN
2182-1976
Première publication
16 Apr 2016
Période de publication
2 fois par an
Langues
Anglais

Chercher

5 Articles
Accès libre

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Publié en ligne: 08 Dec 2016
Pages: 5 - 42

Résumé

Abstract

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding polygons (whose explicit enumeration has not yet been resolved for an arbitrary number of squares) yet there are numerous differences, notably the fact that the geometric constraints are different than those of self-avoiding polygons. We present the methodology allowing the construction and enumeration of all of the possible tracks containing a given number of pieces. For small numbers of pieces, the exact enumeration will be treated. For greater numbers of pieces, only an estimation will be offered. In the latter case, a randomly construction of circuits is also given. We will give some routes for generalizations for similar problems.

Mots clés

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Accès libre

Where are (Pseudo)Science Fool’s Hoax Articles in April From?

Publié en ligne: 08 Dec 2016
Pages: 43 - 74

Résumé

Abstract

In this paper, we discuss in detail what is behind April Fool’s Day

Mots clés

  • April fool’s day
Accès libre

Finding the Year’s Share in Day-of-Week Calculations

Publié en ligne: 08 Dec 2016
Pages: 75 - 86

Résumé

Abstract

The dominant part in the mental calculation of the day of the week for any given date is to determine the year share, that is, the contribution of the two-digit year part of the date. This paper describes a number of year share computation methods, some well-known and some new. The “Parity Minus 3” method, in particular, is a new alternative to the popular “Odd+11” method. The paper categorizes the methods of year share computation, and presents simpler proofs of their correctness than usually provided.

Mots clés

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Accès libre

Quantum Distribution of a Sudoku Key

Publié en ligne: 08 Dec 2016
Pages: 87 - 94

Résumé

Abstract

Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.

Mots clés

  • sudoku
  • quantum key distribution methods
Accès libre

The Maximum Queens Problem with Pawns

Publié en ligne: 08 Dec 2016
Pages: 95 - 102

Résumé

Abstract

The classic n-queens problem asks for placements of just n mutually non-attacking queens on an n × n board. By adding enough pawns, we can arrange to fill roughly one-quarter of the board with mutually non-attacking queens. How many pawns do we need? We discuss that question for square boards as well as rectangular m × n boards.

Mots clés

  • chess
  • n-queens problem
  • combinatorics
5 Articles
Accès libre

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Publié en ligne: 08 Dec 2016
Pages: 5 - 42

Résumé

Abstract

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding polygons (whose explicit enumeration has not yet been resolved for an arbitrary number of squares) yet there are numerous differences, notably the fact that the geometric constraints are different than those of self-avoiding polygons. We present the methodology allowing the construction and enumeration of all of the possible tracks containing a given number of pieces. For small numbers of pieces, the exact enumeration will be treated. For greater numbers of pieces, only an estimation will be offered. In the latter case, a randomly construction of circuits is also given. We will give some routes for generalizations for similar problems.

Mots clés

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Accès libre

Where are (Pseudo)Science Fool’s Hoax Articles in April From?

Publié en ligne: 08 Dec 2016
Pages: 43 - 74

Résumé

Abstract

In this paper, we discuss in detail what is behind April Fool’s Day

Mots clés

  • April fool’s day
Accès libre

Finding the Year’s Share in Day-of-Week Calculations

Publié en ligne: 08 Dec 2016
Pages: 75 - 86

Résumé

Abstract

The dominant part in the mental calculation of the day of the week for any given date is to determine the year share, that is, the contribution of the two-digit year part of the date. This paper describes a number of year share computation methods, some well-known and some new. The “Parity Minus 3” method, in particular, is a new alternative to the popular “Odd+11” method. The paper categorizes the methods of year share computation, and presents simpler proofs of their correctness than usually provided.

Mots clés

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Accès libre

Quantum Distribution of a Sudoku Key

Publié en ligne: 08 Dec 2016
Pages: 87 - 94

Résumé

Abstract

Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.

Mots clés

  • sudoku
  • quantum key distribution methods
Accès libre

The Maximum Queens Problem with Pawns

Publié en ligne: 08 Dec 2016
Pages: 95 - 102

Résumé

Abstract

The classic n-queens problem asks for placements of just n mutually non-attacking queens on an n × n board. By adding enough pawns, we can arrange to fill roughly one-quarter of the board with mutually non-attacking queens. How many pawns do we need? We discuss that question for square boards as well as rectangular m × n boards.

Mots clés

  • chess
  • n-queens problem
  • combinatorics

Planifiez votre conférence à distance avec Sciendo