CrazyEngineers
CrazyEngineers

  • Simple One! - Flowers

    Prashanth_p@cchi

    Prashanth_p@cchi

    @prashanth-p-at-cchi-rg0z63
    Updated: Oct 26, 2024
    Views: 920
    Seeing 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.
    0
    Replies
Howdy guest!
Dear guest, you must be logged-in to participate on CrazyEngineers. We would love to have you as a member of our community. Consider creating an account or login.
Replies

  • Ramani Aswath

    Member • Jul 18, 2012

    One.
    Whatever N is, N flowers remain after doubling and giving away N.
    This is true evenif there are an infinity of temples.
    Are you sure? This action cannot be undone.
    Cancel

  • Anoop Kumar

    Member • Jul 18, 2012

    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.
    Are you sure? This action cannot be undone.
    Cancel

  • Ramani Aswath

    Member • Jul 18, 2012

    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.
    Are you sure? This action cannot be undone.
    Cancel

  • Prashanth_p@cchi

    Member • Jul 18, 2012

    bioramani
    One.
    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!
    Are you sure? This action cannot be undone.
    Cancel

  • Prashanth_p@cchi

    Member • Jul 18, 2012

    ianoop
    Initially 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.
    Are you sure? This action cannot be undone.
    Cancel

  • Prashanth_p@cchi

    Member • Jul 18, 2012

    ianoop
    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.

    I wonder how you arrived at the answer, If you have missed seeing the Note!!!!!!!!!!!
    Are you sure? This action cannot be undone.
    Cancel

  • Ramani Aswath

    Member • Jul 18, 2012

    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.
    Are you sure? This action cannot be undone.
    Cancel

  • Prashanth_p@cchi

    Member • Jul 18, 2012

    bioramani
    I 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.
    Are you sure? This action cannot be undone.
    Cancel

  • Anoop Kumar

    Member • Jul 18, 2012

    Prashanth_p@cchi
    I 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😉
    Are you sure? This action cannot be undone.
    Cancel

  • Prashanth_p@cchi

    Member • Jul 18, 2012

    ianoop
    I 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.
    Are you sure? This action cannot be undone.
    Cancel

  • sndgpr26

    Member • Aug 27, 2012

    there can be man
    Prashanth_p@cchi
    Seeing 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
    Are you sure? This action cannot be undone.
    Cancel

  • sndgpr26

    Member • Aug 27, 2012

    there can be man
    Prashanth_p@cchi
    Seeing 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
    Are you sure? This action cannot be undone.
    Cancel

  • sndgpr26

    Member • Aug 27, 2012

    there can be man
    Prashanth_p@cchi
    Seeing 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
    Are you sure? This action cannot be undone.
    Cancel
Home Channels Search Login Register