Is it possible to fill each circle with a distinct integer from 0 to 10 (inclusive) such that the sum of all 3 values on each side is a distinct prime number?
Note: Only 8 integers will be used.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There are also many arrangement which satisfy that condition...
Log in to reply
You can also use non zero positive single digit for this question...such that...
9 3 5 8 2 6 7 4
Log in to reply
Nice. But I was considering distinct prime numbers.
This configuration will not work.
Log in to reply
@Munem Shahriar – oho!! I didn't notice that. Did you update the question,bro?
Log in to reply
@Md Mehedi Hasan – No. I didn't.
Though, the problem was edited for some clarity.
''Use the digits exactly once'' was changed to ''Only 8 integers will be used.''
Digits was changed to values
As far as I remember, I didn't edited the distinct prime numbers part.
Log in to reply
@Munem Shahriar – sorry,bro. It's my mistake. May be I didn't read the question properly.
The question didnot specify repetition of digits: My approach from top left clockwise: 0,1,2,3,6,4,5,8
Problem Loading...
Note Loading...
Set Loading...