Two packing problems

In this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed into the rectangle of size 71105 × 1518243407 and remarked that all the rectangles of size 1n × 1n+1, n = 1,2,3,…, can be packed into the square (501500)2 and also into the rectangle of area 1.0024.