Create programm to verify this circle is really amazing for perfect square just google

Attached Thumbnails

 

That's amazing, indeed.

Cool.

What do you mean by "Create programm (sic) to verify..."? Might there be other sequences of integers 1 thru 32 that work? Might there be other limits other than 1 thru 32?

Problem is to implement effectively "circle" as data structure - or ring. There is no "first" or "last" element in "circle".

That's not a problem any more than drawing a circle on paper is a problem - just pick any arbitrary position to begin at, and connect back to that point.

What's the context of this? Is it homework, a learning exercise, just a curiosity, or something else?

With this one-line InFile ...
... this awk ...
... produced this OutFile ...
Daniel B. Martin

.

1 members found this post helpful.

Perhaps i still don't understand your question, but it doesn't sound difficult. To operate on a 'ring' of data, you would have to start at some (random?) point on the ring, and proceed either clockwise or counter-clockwise until you returned to the starting point.

Programmatically, this could be achieved by defining the ring as a simple array, and then, starting from a random offset, process in a linear manner, logically wrapping around to the array's first element as needed, continuing until you return to the starting offset. For counter-clockwise, process in reverse order.

But here's an interesting programming challenge: Given the requirements that the numbers 1 thru 32 must exist exactly once, and that the sum of each adjacent pair of numbers must be a perfect square, write a program to generate a ring of data. The above methodology could be employed to do so, and to compare the sequence(s) generated against the ring of data shown in the jpg image.

While i was typing the above, danielbmartin supplied a program. My previous post tells how to treat the data as a 'ring'. Start at a random offest, and wrap as needed.

Note: You'd have to increase the for loop by one step, to connect the first and last element in the 'ring'.

The published solution does close the ring.

Daniel B. Martin

.

Well. . . not exactly. It merely adds an element to the linear array, with the added last element equal to the first. Same result, but not quite the same as wrapping around to form a logical ring.

I fail to see the distinction. Please explain.

Daniel B. Martin

.

In post #4, OP was asking
Your program works, but treats the data as a linear array. The better way to answer the OP would be to define a class 'Ring', in which processing could begin at any arbitrary point in the ring, and wrap around in a circular manner. In a non-oop program, you could still use a linear array, but allow processing to begin at any point in the array, and wrap around to the beginning as needed.

I may post a small C++ program to illustrate what i mean. But am out of connection minutes, so will wait until another day.

Post #1 in this thread asked for a program to test the validity of a Magic Circle. Quoting from the image in that post, "the sum of any two adjacent numbers is a perfect square."

Testing this assertion does not require any specific starting point, nor does it demand a direction of travel (clockwise or counterclockwise). If all number pairs sum to a perfect square the number sequence is validated.

Post #7 introduces the word random. That was not stipulated in post #1 nor does it strengthen the validation demonstrated by the solution offered in post #6. If every number pair sums to a perfect square, that is true regardless of travel direction or starting point.

A favorite maxim: "Don't make the job harder than it has to be."

Daniel B. Martin

.

verifying that circle is not an issue. You can do it without computer, calculator or any other tool in minutes (entering the numbers into any device will take longer than the check).
The "real" problem is to generate a circle like this. How many different amazing circle exist?

2 members found this post helpful.