Simple One! - Flowers

One.
Whatever N is, N flowers remain after doubling and giving away N.
This is true evenif there are an infinity of temples.

Initially he got N=15 flowers and offer 16 flowers at each temple.😀
I think you missed the condition that every time flowers get double after dipping in pond.

Let us see. I have one flower, which becomes two after dipping. I give one and have one left, which again becomes two. I just repeaat. This does not violate the given logic except that N=A, which is not a restriction given.

bioramaniOne.
Whatever N is, N flowers remain after doubling and giving away N.
This is true evenif there are an infinity of temples.

I don't think so..... Or may be I did not understand you Sir!

ianoopInitially he got N=15 flowers and offer 16 flowers at each temple.😀
Correct.....

I think you missed the condition that every time flowers get double after dipping in pond.

I did not miss that, I have put that in Note.

ianoopInitially he got N=15 flowers and offer 16 flowers at each temple.😀
I think you missed the condition that every time flowers get double after dipping in pond.

I wonder how you arrived at the answer, If you have missed seeing the Note!!!!!!!!!!!

The note says that if the flowers are dipped they double. I see a requirement that the flowers must be dipped every time.
Quote:Again dip the remaining flowers in the pond and so on...... until the 4th temple.Endquote
I assumed that you do not dip at the last temple.At the last but one temple if the flowers are dipped one has 2N flowers. Give N each to the two remaining temples.
In ianoop's solution the flowers are dipped at the fourth tank also.

bioramaniI assumed that you do not dip at the last temple

. We should dip the flowers that is remaining, after you give it to the third temple, and then proceed with the 4th temple.

Prashanth_p@cchiI did not miss that, I have put that in Note.

Ohh.. I over sighted assuming as signature footer😖.
I came across these type of question in childhood days😉

ianoopI came across these type of question in childhood days😉

Oh good. Then why don't you share "these type of question" with us. That would be nice.

there can be man

Prashanth_p@cchiSeeing No puzzle being posted from past three days, thought of posting one, but a simple one.

There is a pond, and it has four temples around it. The duty of a florist there is to distribute the flowers to these temples. Can you tell me what is the minimum number of flowers that he can get in the begging (N), keeping the following in mind?

He should get some flowers (N). {N not equal to 0}.
He should dip all of them in the pond.
Give some flowers (say A) to 1st temple.
Again dip the remaining flowers in the pond.
Give the same number of flowers(A) to 2nd temple.
Again dip the remaining flowers in the pond and so on...... until the 4th temple. After giving the flowers to the 4th temple, he should be remaining with nothing.

Note that, every time he dips the flowers, the number of flowers will be doubled.

there can be many answer to this
1.N=15 and he put 16 flower per temple
2.N=30.................32.......................
3.N=45.................48......................
.............
........
.....
and so on

there can be man

Prashanth_p@cchiSeeing No puzzle being posted from past three days, thought of posting one, but a simple one.

There is a pond, and it has four temples around it. The duty of a florist there is to distribute the flowers to these temples. Can you tell me what is the minimum number of flowers that he can get in the begging (N), keeping the following in mind?

He should get some flowers (N). {N not equal to 0}.
He should dip all of them in the pond.
Give some flowers (say A) to 1st temple.
Again dip the remaining flowers in the pond.
Give the same number of flowers(A) to 2nd temple.
Again dip the remaining flowers in the pond and so on...... until the 4th temple. After giving the flowers to the 4th temple, he should be remaining with nothing.

Note that, every time he dips the flowers, the number of flowers will be doubled.

there can be many answer to this
1.N=15 and he put 16 flower per temple
2.N=30.................32.......................
3.N=45.................48......................
.............
........
.....
and so on

there can be man

Prashanth_p@cchiSeeing No puzzle being posted from past three days, thought of posting one, but a simple one.

There is a pond, and it has four temples around it. The duty of a florist there is to distribute the flowers to these temples. Can you tell me what is the minimum number of flowers that he can get in the begging (N), keeping the following in mind?

He should get some flowers (N). {N not equal to 0}.
He should dip all of them in the pond.
Give some flowers (say A) to 1st temple.
Again dip the remaining flowers in the pond.
Give the same number of flowers(A) to 2nd temple.
Again dip the remaining flowers in the pond and so on...... until the 4th temple. After giving the flowers to the 4th temple, he should be remaining with nothing.

Note that, every time he dips the flowers, the number of flowers will be doubled.

there can be many answer to this
1.N=15 and he put 16 flower per temple
2.N=30.................32.......................
3.N=45.................48......................
.............
........
.....
and so on