Authors: Valerio Bencini
The aim of this paper is to lower down the current upper bound for the Ripà's n_1 X n_2 X n_3 Dots Problem, with n1>n_2>=n_3, using the same method Ripà and I used for the case n_1=n_2=n_3:=n. The new value is 1/2*floor(1/(3*n_1-3*n_2-3*n_3+5))*((n_1-n_2-n_3)*(n_1-n_2-n_3+1)-2*floor(1/2*(-n_1+n_2+n_3)))+2*n_2*n_3-1. At the end of the article, I also extend this result, and that I previously found with Ripà for n_1=n_2=n_3:=n, to the k-dimensional problem n_1 X n_2 X n_3 X n_4 X ... X n_k, using the equation found by Ripà in 2013.
Comments: 8 Pages.
Unique-IP document downloads: 19 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.