Double Logic Sequence

Find the Next Number in the Sequence

2 9 3 1 8 4 3 6 5 7 ?




Similar Riddles

In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.

Connect the Stars

Asked by Neha on 17 May 2021


What can jump higher than a building?

Asked by Neha on 24 Oct 2025

When it's bad luck to meet a black cat?

Asked by Neha on 01 Mar 2025


What common phrase is represented by the below lines

Easy going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Medium going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Tough going:
Weak, 'I can't do it, I'm staying!'
Tough, 'Let's get going.'

Asked by Neha on 19 Nov 2024

Can you find out the missing number?

? 4 5 3 5

9 5 7 10 3

Asked by Neha on 03 Mar 2024

You see a boat filled with people, yet there isn’t a single person on board. How is that possible?

Asked by Neha on 12 Feb 2022


What is the next number in this matchsticks series riddle?

Next Number In Matchstick Series

Asked by Neha on 27 Apr 2021

I am a five-letter word and comprises two different vowels and three same consonants. I am so strong that I can spoil your entire work.

Can you find out who am I?

Asked by Neha on 13 Dec 2024

A network of 20 x 10 squares is given to you.

Can you calculate how many unique squares and rectangles can be formed combining two or more individual squares ?

Asked by Neha on 24 Jan 2021


There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.

How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?

Asked by Neha on 29 May 2023

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki