Search results for query: *

A mistake in my computations. x_{i+1}=3x_i+4n_i+1 n_{i+1}=2x_i+3n_i+1 is the recursion which gives the solutions.

For those who didn't read the previous post beyond the first line (who wants to spoil the fun by getting a bad solution early?), here's an extra twist to the original problem: The maximum number of rectangles of different area we can put into any shape is clearly 1+2+3+4...+x (since this uses...

Let us take a trivial example: square board of 2x2. Then there isn't a solution. If I try e.g. AB xB" There is a solution: AA AA I'm sorry using the word Lebesgue measure. As a mathematician I just think areas as Lebesgue measures. So nxn board has measure n^2.

As I understand it, you have to split up an integer-sized square into the maximum number of integer-sized rectangles, where no two rectangles have the same size." True. And no two rectangles overlaps. "Do the rectangles have to be, well, rectangles? Are squares allowed?" Squares are allowed...

I have to list the lengths of every A_i " Sorry. Sctually I have to list width and height of every A_i and their position on a board. So for example 6x6 board can be split into four pieces like this: SSSS)) SSSS)) hhhh)) $$$$$$ $$$$$$ $$$$$$

I meant that I have an nxn-board (or chessboard). Then I have to find rectangles A_1,...,A_m with integer sides such that A_i intersection A_j = emptyset for every i < j, |A_1|<|A_2|<...<|A_m| (|A_i| means the size of A_i, 2-dimensional Lebesgue measure) if they are ordered by size, and A_1...

I have been given a square board with side length n. I have to split it as many rectangles as possible with different areas. What is a suitable algorithm to do the job? (n is not very large, say n about 50).

I found that in Cobol there are alphanumeric strings and numeric strings. I wondered how to make a program where we have an input like "A30" and we want to multiply the number 30 by 11 to get output "A330".