Zeszyty czasopisma

Tom 9 (2022): Zeszyt 16 (June 2022)

Tom 8 (2021): Zeszyt 15 (November 2021)

Tom 8 (2021): Zeszyt 14 (October 2021)

Tom 7 (2020): Zeszyt 13 (November 2020)

Tom 6 (2019): Zeszyt 12 (December 2019)

Tom 6 (2019): Zeszyt 11 (September 2019)

Tom 5 (2018): Zeszyt 10 (December 2018)

Tom 5 (2018): Zeszyt 9 (September 2018)

Tom 4 (2017): Zeszyt 8 (December 2017)

Tom 4 (2017): Zeszyt 7 (May 2017)

Tom 3 (2016): Zeszyt 6 (December 2016)

Tom 3 (2016): Zeszyt 5 (March 2016)

Informacje o czasopiśmie
Format
Czasopismo
eISSN
2182-1976
Pierwsze wydanie
16 Apr 2016
Częstotliwość wydawania
2 razy w roku
Języki
Angielski

Wyszukiwanie

Tom 3 (2016): Zeszyt 6 (December 2016)

Informacje o czasopiśmie
Format
Czasopismo
eISSN
2182-1976
Pierwsze wydanie
16 Apr 2016
Częstotliwość wydawania
2 razy w roku
Języki
Angielski

Wyszukiwanie

5 Artykułów
Otwarty dostęp

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Data publikacji: 08 Dec 2016
Zakres stron: 5 - 42

Abstrakt

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.

Słowa kluczowe

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Otwarty dostęp

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

Data publikacji: 08 Dec 2016
Zakres stron: 43 - 74

Abstrakt

Abstract

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

Słowa kluczowe

  • April fool’s day
Otwarty dostęp

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

Data publikacji: 08 Dec 2016
Zakres stron: 75 - 86

Abstrakt

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.

Słowa kluczowe

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Otwarty dostęp

Quantum Distribution of a Sudoku Key

Data publikacji: 08 Dec 2016
Zakres stron: 87 - 94

Abstrakt

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.

Słowa kluczowe

  • sudoku
  • quantum key distribution methods
Otwarty dostęp

The Maximum Queens Problem with Pawns

Data publikacji: 08 Dec 2016
Zakres stron: 95 - 102

Abstrakt

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.

Słowa kluczowe

  • chess
  • n-queens problem
  • combinatorics
5 Artykułów
Otwarty dostęp

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Data publikacji: 08 Dec 2016
Zakres stron: 5 - 42

Abstrakt

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.

Słowa kluczowe

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Otwarty dostęp

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

Data publikacji: 08 Dec 2016
Zakres stron: 43 - 74

Abstrakt

Abstract

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

Słowa kluczowe

  • April fool’s day
Otwarty dostęp

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

Data publikacji: 08 Dec 2016
Zakres stron: 75 - 86

Abstrakt

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.

Słowa kluczowe

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Otwarty dostęp

Quantum Distribution of a Sudoku Key

Data publikacji: 08 Dec 2016
Zakres stron: 87 - 94

Abstrakt

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.

Słowa kluczowe

  • sudoku
  • quantum key distribution methods
Otwarty dostęp

The Maximum Queens Problem with Pawns

Data publikacji: 08 Dec 2016
Zakres stron: 95 - 102

Abstrakt

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.

Słowa kluczowe

  • chess
  • n-queens problem
  • combinatorics

Zaplanuj zdalną konferencję ze Sciendo