This thread invites participants to share and solve various puzzles, problems, and enigmas that require creative thinking. The scope includes cryptograms, logic puzzles, and hypothetical scenarios, with an emphasis on engaging the community in playful problem-solving.
Participants express a range of interpretations and solutions to the puzzles, with no clear consensus on the best approaches or answers. Disagreements arise regarding the phrasing of the original puzzle and the nature of the solutions proposed.
Some puzzles rely on specific assumptions about language and context, while others depend on the physical properties of objects involved. The discussions reflect varying levels of understanding and engagement with the puzzles presented.
Individuals interested in puzzles, logic problems, and creative thinking challenges may find this thread engaging and stimulating.
Enigman said:
EDIT: not writing a computer program would be appreciated...
Darn it.Enigman said:
Enigman said:
Enigman said:
collinsmark said:
Enigman said:Btw collinsmark I did solved it with C++... the clause was just so that I could see if someone's able to solve without programming...I couldn't.
using System;
// This is a C# program that finds the
// smallest perfect square that
// is palindromic in base 10,
// and has an even number of
// digits in base 10.
namespace Enigman_Palindrome_thing
{
class Program
{
static void Main(string[] args)
{
int n = 2; // This is the root of the perfect square.
// Now let's loop through the natural numbers to find
// the palindromic, even digited, perfect square.
bool foundIt = false;
while(!foundIt)
{
int nSquared = n * n; // this is the number to check.
string nSquaredString = nSquared.ToString(); // string form.
// Let the console know which number we're checking.
Console.WriteLine("Currently checking " + nSquaredString);
// check if it has even number of digits.
if((nSquaredString.Length)%2 == 0)
{
// If we're here it's even. Check if it's a palindrome.
bool palindromeFlag = true;
for(int i = 0; i<nSquaredString.Length/2; i++)
{
// If symetric characters are not equal,
// then it's not a palindrome.
if (!(nSquaredString[i]
== nSquaredString[nSquaredString.Length - 1 - i]))
palindromeFlag = false;
}
if(palindromeFlag)
{
// Found it! let's report it to screen
// and finish up.
foundIt = true;
Console.WriteLine(Environment.NewLine
+ "Found it! The number is "
+ nSquaredString + " which is "
+ n.ToString() + " squared.");
}
}
// Increment n for next number to check.
n++;
}
// Keep console alive until ready to leave.
Console.ReadKey();
// Goodbye!
}
}
}Enigman said:
Enigman said:
Jonathan Scott said:
Travis_King said:
By trial and error only:Enigman said:
zoobyshoe said:
Enigman said:
Travis_King said:
Enigman said:
AlephZero said:64, if they are all black or all white
Enigman said:
That's why I included 'independent' in the edit.AlephZero said:64, if they are all black or all white
Travis_King said: