# The Most DIFFICULT Riddle EVER!

Can you solve the most DIFFICULT riddle EVER!?

Only 3% can solve this!

Write in the comments if you have been able to solve this logic riddle.

Drawings by: https://www.instagram.com/felix_lumex/

On this Channel i upload a lot lot of riddles and puzzles. About lying people, escaping a prison or anything where you have to use your brain.

Enjoy! 🙂

source

I hate math….I'll skip this one thanks

Wha-?

Here is what i will do:

1. go on youtube

2. search IT'S EVERYDAY BRO but louder

3. play a other song called BABE but also louder

4. play a other song again called LOVE YOURSELF and it's also louder

5. wait until someone wakes up

6. they kidnap me

7. i do the same thing over again

Fuck uuu

this is bullshit

unless its specified on the wall which one is franky and which one is pete, the guy is screwed

2:00 why didnt he assume product as 35? There could have been two prime numbers 5 and 7. Why did he assume 20 only?

Ley guldu yaargadru helbitya! Paan agudhkond ugithare

Where was it stated that the sum or the product from these wanted numbers coudld not be higher than 100?

This is WAY too easy but u won't know the lock without luck because of 13-4 and 4-13

how is this possible!!!!!!!!!!!

The number is 13

wow I solve that riddle 😎😎😎

Brush Ima just get out through the already broken window

My ear cant perfectly hear what u say. Can u add the language next? It will be helpfull

Damn u math

Or at1:35 climb out the broken window! Lol, like if you thought this too

Who the fuck can get such a fucked up thing like that…

"Numbers add up to the sum"

Last time I checked the sum is the addition of two or more numbers. That makes this statement pointless to have in the riddle.

The numbers are 02 and 02

I didn't understand the solution too….

Can I use paper and a math book?? Wtf . The answer is longer than the riddle. 😂😂😂😂😂😊 what a waste of time

How it is a prime number?

what the heck was that……

it was simply useless……

,😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷😷

Love this riddle. This kept me busy for too long.

here is PYTHON3 code of my solution.

def is_prime(x):

# input: integer x

# output True if x is a prime number between 1 and 2447

# False otherwise

primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447]

is_prime_flag = False

for n in primes:

if x == n:

is_prime_flag = True

return is_prime_flag

def sum_check(x,y):

# input: two integers x,y

# output True if sum of x and y is 100 or less

# False otherwise

if x + y > 100:

return False

else:

return True

def get_all_addends(x):

# input: integer x

# output list of all pairs of 2 unique numbers

# > 1, largest first,

# that are addends of x

working_list = []

for i in range(2,x-2):

if not x-i == i and x-i > i:

working_list.append([x-i,i])

return working_list

def get_factors(x):

# input: integer x

# output list of all factors of x except for 1 and itself

my_list = []

working_x = x

space_taker = 0

while not is_prime(working_x):

for y in primes:

if y < working_x:

if working_x%y == 0:

my_list.append(y)

working_x = working_x/y

if not working_x == x:

my_list.append(int(working_x))

return my_list

def get_factor_pairs(x):

# input: integer x

# output list of all factor pairs of x except for 1 and itself or sqrt of x

import math

work_list = []

for i in range(2,math.ceil(math.sqrt(x))):

if x%i == 0:

work_list.append([int(x/i),i])

return work_list

def single_fp(x):

#input int x

#return True if only one set of factors can come out of the product (within the game parameters)

#otherwise False meaning P could not know

if len(get_factor_pairs(x)) == 0:

print("error############ invalid product tested", x)

elif len(get_factor_pairs(x)) == 1:

return True

else:

return False

def get_co_sums(x):

#input int x

#return list of co sums of x

work_list = []

for i in get_factor_pairs(x):

if i[0]+i[1] < 101:

work_list.append(i[0]+i[1])

return work_list

def get_co_products(x):

#input int x

#return list of co products of x

work_list = []

for i in get_all_addends(x):

work_list.append(i[0]*i[1])

return work_list

###############################################################################

###############################################################################

###############################################################################

###############################################################################

master_sums = []

master_products = []

###create lists of products and sum for each view

for i in range(3,101):

for j in range(2,i):

if sum_check(i,j):

master_products.append(i*j)

master_sums.append(i+j)

print("sums, valid sums",len(master_sums))

print("products, valid sums",len(master_products))

###remove duplicates and sort

master_sums = set(master_sums)

master_products = set(master_products)

master_sums = list(master_sums)

master_products = list(master_products)

master_sums.sort()

master_products.sort()

print("sums, no duplicate",len(master_sums))

print("products, no duplicate",len(master_products))

## though he never says it, its assumed that sam dont know by the sum

## TF: remove sums 5 and 6 from the possible sums list

## since 5 and 6 are the only sums with a single pair of valid addends

master_sums.remove(5)

master_sums.remove(6)

print("sums, remove 5 6",len(master_sums))

## paul says "i don't know"

## meaning the product paul sees has multiple factor pairs

## remove all products that have single factor pairs

prod_to_remove = []

for i in master_products:

if single_fp(i):

prod_to_remove.append(i)

for i in prod_to_remove:

master_products.remove(i)

print("products, only multi FP",len(master_products))

## Sam says "I knew you didn't know"

## meaning the sum sam sees, has co-products

## that are exclusively multiple factor paired

##

## TF: remove all sums that have any co-products

## that have a single factor pair

products_to_remove = []

sums_to_remove = []

for i in master_sums:

single_found_flg = False

for j in get_co_products(i):

if single_fp(j):

single_found_flg = True

if single_found_flg == True:

sums_to_remove.append(i)

for i in sums_to_remove:

master_sums.remove(i)

sums_to_remove = []

print("sums, only sums with Co-P exclusively multi PF" ,len(master_sums))

## paul says "well, now i do know"

## meaning paul must have been looking at a product

## with co-sums, all but one of which was removed in the last step.

##

## TF: all but one of the products co-sums

## have co-products with a single_fp

##

match_found_flg = False

counter = 0

for i in master_products:

for j in get_co_sums(i):

for k in master_sums:

if k == j:

match_found_flg = True

if match_found_flg == True:

counter += 1

match_found_flg = False

if not counter == 1:

products_to_remove.append(i)

counter = 0

for i in products_to_remove:

master_products.remove(i)

products_to_remove = []

print("products, final",len(master_products))

## sam says "well, now i do too"

match_found_flg = False

counter = 0

for i in master_sums:

for j in get_co_products(i):

for k in master_products:

if k == j:

match_found_flg = True

if match_found_flg == True:

counter += 1

match_found_flg = False

if not counter == 1:

sums_to_remove.append(i)

counter = 0

for i in sums_to_remove:

master_sums.remove(i)

sums_to_remove = []

print("sums, final" ,len(master_sums))

The_Sum = master_sums[0]

#what co-products of The_Sum are still on the products list

for i in get_co_products(The_Sum):

for j in master_products:

if j == i:

print("found one product")

The_Product = j

print("#######################################################")

print("The sum is",The_Sum,"The product is",The_Product)

print("#######################################################")

#find the matching addends and factor_pairs

for i in get_all_addends(The_Sum):

for j in get_factor_pairs(The_Product):

if i == j:

Y = i[0]

X = i[1]

print("X =",X,"Y =",Y)

print("#######################################################")