Some years later, the sum of two of the three ages is double the remaining age.

One of the brothers is coming to age today.

The number of years since the first occasion is currently two-thirds of the sum of their ages at the time of the first occurrence.

What ages do the other two brothers have today?

]]>

+=20

x=?

]]>How shall Bill put all his coins on the table for greatest earnings?

]]>

Not sure if this is the right place to post this but I have been sent this card - Any ideas what it means - Thanks

]]>

for example say the rubber band shape is outlining these nails:

* - * - * - * - *

| /

* * * *

| /

* - * - *

Perimeter = 8 + 2*sqrt(2)

Nails = 12

Squares: 6 squares (5 - 1x1 and 1 - 2x2) --- the result of 6, at a minimum, is what we are trying to predict.

]]>Answer: 3, 4 (object from a kitchen)

]]>

I am pronounced as one letter, but written with three. Me and my twin

brother are blue, brown or green. What am I?

A Man in the Rain

A man walked outside in a heavy rainstorm for twenty minutes without

getting a single hair of his head wet. He didn't wear a hat, carry an umbrella,

or hold anything over his head. His clothes got soaking wet. How could this

happen?

The arcane voting rules for replacing Aldan are as follows. There is a large Praesidium with *n* people in it. At the moment all the members are in the VPP. Each member has an integer valued priority. The selection process will now go in rounds: At the beginning of a round Arcsin will propose some subset S of the remaining candidates *C* of the Praesidium. (Initially *C* will be the whole Praesidium). Arctan then has two choices. He can devour *S*, but then he is forced to decrease the priority value of each member of *C \ S* by one. Alternatively, *he* can devour* C \ S* and decrease the priority values of the members of *S* by one.

The process continues until one of two things happen: The whole Praesidium has been eaten and then Arctan can choose any member of his party to fill the vacancy. The other possibility is that someone will reach priority zero and then Arcsin can choose any zero priority person to fill the vacancy. Given that the initial priorities are *a _{1}*,

Imagine you have several distinguishable rows composed of several distinguishable columns

The intersection of the rows and columns either have a 1 or a 0.

Each row sums to the same value and the question is how many of the columns can you eliminate assuming the the 1's in each row are randomly distributed across the columns

Example, there are 30 rows and 20 columns with each row containing 7 randomly dispersed 1's. How many columns can be eliminated reducing the total in each row by no more than 2.

In 1988 my granny was quite a bit older than my grandpa. The difference between the square of their ages was 1988. How old were they?

]]>

5 ? 575

2 3 ?

? ? 3968

]]>The artist in the market is giving this painting for free (the last one on his rack). I asked him if I can take it but he replied "Why should I give it to you?" The frame could be useful but I don't want to tell him that so I ask him why should he give it for free. He answered "because I miss to paint something into it". It looks like straight edge drawing to me but Im curious so I asked him what is missing in his painting. He told me that I can take it if I figured it out. I offer to buy it if he would tell me but he just refused while people are now gathering around the painting. What is missing?

]]>- I've drawn 17 circles that at least partially overlap a rectangle.
- Their centers all lie within the rectangle.
- None of the circles overlap or even touch any of the other circles.
- There is no room for an 18th circle to be added to the group.

That is, the circles are drawn in such a way that even though there is space between them, it is impossible to draw another circle whose center lies within the rectangle that does not at least partially overlap one of the first 17 circles. That is all you know about the relative sizes of things. And it is enough information to answer the following question:

First, let's erase the circles that I drew. Then I will paint the rectangle red and give you a large supply of opaque white circles. What is the smallest number of circles you will need to completely cover the rectangle? (so that no red will be showing.) The centers of the circles, again, must lie within the rectangle, but now, of course, the circles can overlap each other,

Edit: The puzzle can be solved as stated, but in order to guarantee the solution is the absolute smallest number, the following constraint is added to the original placement: The 17 circles were drawn as densely as possible without overlap. Thanks to @Molly Mae for raising this point.

]]>

We have a three-wheel calculator and require the greatest amount of resultants based upon the five-colour combinations of the wheels (and some colourless results would also be much appreciated). Simply cut out the spaces at the center of the wheels so that they can align with the corresponding values underneath. I've included polygons at the center where the values can be added later. How would we go about solving this? Thx,

]]>(1^n + 2^n + 3^n + 4^n....+ n^n)

---------------------over---------------------

(n^1+ n^2 + n^3 + n^4 ... + n^n)

]]>y=x^x^x^x^x.....

Find an x value for which the derivative of this function converges.

If you are really clever you'll find the interval that converges.

]]>Sqrt ( i )

]]>On the 2 x 1 grid all 7- segment digits above can be formed one at a time as seen on clocks , calculators and other digital devices. If we are allowed to flip or rotate and overlap segments, how should these digits be configured inside the 3 x 4 grid ,so we can see all of them at the same time?

Spoiler

note: too much overlapping may cause some digits to disappear

]]>

Today I came across with this riddle. I find it a bit of a problem on finding de X and the Y values, so I ask you to help me on this one.

A friend told me that green and yellow rectangle values are example of what you have to do in the pink and blue ones.

I appreciate in advance your help.

Thank you!

]]>