Yes! Lots of it! Try different reasoning ! :lol:Quote:
Originally Posted by NM
Printable View
Yes! Lots of it! Try different reasoning ! :lol:Quote:
Originally Posted by NM
NM: (n+1)x(n+3) = [(n+2) -1] x[(n+2) +1 ]
= [ (n+2)^2 - 1 ]
Does this give you a clue? :)
hi uncle -Quote:
Originally Posted by rajraj
are you saying its wrong?
I thought the sequence should be
3, 8, 15, 24, 35, 48, 63,80, 99, 120 etc......
so the number that's odd is 25 :(
Quote:
Originally Posted by NM
I did not say it was wrong! I asked for different reasoning! You have it in the series you gave! What is common to those numbers? :) To make it plain what is the relationship between 25 and 24 ? :)
oooooh! appadiya - its always (the perfect square of a number - 1) .... sorry - didn't quite understand was was required.
(0+2)^2 - 1 = 3
(1+2)^2 - 1 = 8
(2+2)^2 - 1 = 15 etc
ippO naan elementary-thaana illa foundtaion-a? :lol: :lol:
I will tell you after ten more puzzles! :lol: A professor has to give enough tests before awarding a grade ! :lol:Quote:
Originally Posted by NM
You always try for a simple solution ! :)
Another simple one with numbers ( 4x4 matrix of 16 numbers):
3 7 2 6
4 1 5 8
6 4 5 3
5 6 x 1
What is x ?
6.
Both row-wise and column-wise the sum is 18.
ivlO semipleA kuduthirukka vEndaam.
naan play school ku eligibleA?
Stress relief ! :lol:Quote:
Originally Posted by GP
For the clock puzzle,
The repairman has put minute hand on the place of seconds hand.
Another simple one for stress relief. :wink:
How can you split Rs. 1.15 in six denominations so that you can not have change for one rupee, 50 paise, 25 paise, 10 paise and 5 paise?
I leave this to those in India to solve! :) I have not handled Indian coins in a long time! I don't even remember what denominations are available now ! :)
5 Paise, 10 paise, 20 paise, 25 paise, 50 paise and one rupee denominations can be used. (1 Rupee = 100 paise)
50+25+10+10+10+10?
:clap: Kirukkan :thumbsup:
Splendid! :clap:Quote:
Originally Posted by kirukan
I am no good at programming, just script some timepass kirukkals but you call yours a kirukkal!! :shock: You have coded everything from scratch!
Anyway this must be much quicker since we just have to square 9000 numbers and check if they have unique digit, whereas my method would have to undergo at least 9! iterations to arrive at solution! :thumbsup:
idhu correct thaana?Quote:
Originally Posted by GP
Yes.. yes! Forgot to reply.. Good work! :2thumbsup:Quote:
Originally Posted by GP
This one is pretty simple!
"A half is a third of it. What is it?" :P
1.5.
half is one third of 1.5.
:huh:
Karnan film dialogue, Krishna to Arjuna: "naan thaan konnEn, naandhaan konnEn!" :lol2:Quote:
Originally Posted by GP
:shock: comparing me to Lord Krishna.Quote:
Originally Posted by NOV
Yes! Avlo thaan.. :)Quote:
Originally Posted by GP
Try this one.
You have 180 pounds of gravel and a balance. You need to weigh out 150 pounds and 30 pounds of gravel. You only have 6 pound and 9 pound standard weights. How would you do that?
:PQuote:
Originally Posted by GP
It was Arjuna who said that dialogue with Krishna mimicking him. :P
Karnan died earlier; arjuna's last arrow just confirmed his death. :P
any restriction on number of times the balance can be used or maximum weight the balance can hold?Quote:
Originally Posted by Benny Lava
Weigh 30 pounds of Gravel in 2 attempts using 15 pound (6+9) standard weight. Remaining should be 150 pounds. :|
Should we also check whether the remaining quantity has 150 pounds of Gravel?
if yes,
1) weigh 45 pounds gravel using 15 pound standard weight and 30 pound gravel (that was already weighed). We now have 15 pound standard weight, 30 pound gravel, 45 pound gravel.
2) Weigh 90 pound gravel using 15 pound standard weight, 30 pound gravel, 45 pound gravel. We now have 15 pound standard weight, 30 pound gravel, 45 pound gravel, 90 pound gravel.
3) Check whether the remaining gravel weighs 15 pound using 15 pound standard weight.
2 steps to get 30 pound gravel and 5 steps to confirm whether the remaining gravel weighs 150 pound.
Too much of stress relief ! :)
Try this one for a change:
You are given a 4x4 matrix of 16 dots. How can you connect them using maximum number of lines without crossing or retracing a line already drawn without lifting your pen? A line is a vertical or horizontal connection between two adjacent dots. No diagonal lines!
Ohh.. sorry.. I forgot to mention that limitation is 3 attempts.Quote:
Originally Posted by GP
Anyway, your answer is right. Now how can we separate 180 pounds of gravel into 40 pounds and 140 pounds using just 1 pound and 4 pounds standard measure? :D
The answer must be 15 and the solution seems to be easy, unless I am missing something here :confused2:Quote:
Originally Posted by rajraj
Maximum number of lines? :) Your solution is the number of lines in a spiral connection! :)Quote:
Originally Posted by Benny Lava
Assuming you have an old style scale with two pans:Quote:
Originally Posted by Benny Lava
180
90 90 (divide equally)
90 45 45 (divide 90 lb equally)
90 45 5 40 (weigh 5 lb from one 45 lb heap)
90+45+5 40
Be a little more clever! :)
Quote:
Originally Posted by rajraj
17 :huh:Quote:
Originally Posted by rajraj
lets number the 16 dots as
01-02-03-04
05-06-07-08
09-10-11-12
13-14-15-16
Connection like this 02-06-05-01-02-03-04-08-12-16-15-14-13-09-10-11-07-03
I hope better solution exist.
Try again ! I will give one for stress relief later ! :lol:Quote:
Originally Posted by GP
Excellent once again! :clap:Quote:
Originally Posted by rajraj
Oh, sorry! When you said "without crossing" I thought it meant that only two edges can be drawn from a node.Quote:
Originally Posted by rajraj
And for your question, it can be solved easily if we apply Graph theory. The requirement is basically to construct an Euler's path through 16 nodes (number of edges are indeterminate at the moment).
For an Euler's path to exist, the graph must have zero or two nodes with odd number of edges. The maximum number of edges for a nxn matrix without considering Euler's path would be 2*n*(n-1). In this case it is 24. In such a setup the node properties is as such:
4 nodes with 2 edges
8 nodes with 3 edges
4 nodes with 4 edges
Clearly, the 8 nodes with 3 edges bothers us since we can not have more than 2 nodes as such. This means 6 nodes have to shed 1 edge each. If we want to maximize the number of edges, this can be accomplished by shedding merely 3 edges (shared by 6 nodes as a pair).
So the final solution is 24 - 3 = 21 edges.
Diagramatically, the 3 edges to remove are the middle edges of any three exterior sides. Like:
(1,2) to (1,3) &
(2,4) to (3,4) &
(4,2) to (4,3)
and other symmetrical variation of the same topology.
yellAm ok, yeppadi andha 21 lines connect pannuveengannu sollunga. :?
2-1-5-6-2-3-7-6-10-9-13-14-10-11-15-16-12-11-7-8-4-3.
Kirukan kirukkiya kodugal 21
is it right?
:clap: :clap: kirukan