[4] viXra:2208.0167 [pdf] submitted on 2022-08-30 23:34:46
Authors: Nikos Dimitris Fakotakis
Comments: 1 Page. P = NP
The generalized Sudoku problem, with S as the setof the symbols, is known to be NP-complete and it is equivalent to any other NP-complete problem. In this paper, we present a method that solves the Sudoku Problem in polynomial time and proves that P = NP.
Category: General Mathematics
[3] viXra:2208.0163 [pdf] submitted on 2022-08-29 13:59:33
Authors: Volker W. Thürey
Comments: 4 Pages.
We introduce boards others than the usual chessboard. Further we define meeples which can move in other ways than the usual chess meeples. We ask whether these meeples can reach every field, like a knight can reach every field on the chessboard.
Category: General Mathematics
[2] viXra:2208.0136 [pdf] submitted on 2022-08-25 21:24:34
Authors: Yuji Masuda
Comments: 1 Page.
In this chapter, I describe how to prove my definition, in particular, ∞=3, using random functions in EXCEL.
Category: General Mathematics
[1] viXra:2208.0108 [pdf] submitted on 2022-08-19 21:27:22
Authors: Yuji Masuda
Comments: 1 Page.
In this chapter, I will explain a new method of proof, which is both mathematical induction and deduction at the same time, based on my definition series, with concrete examples.
Category: General Mathematics