Usually when I see no-computers, it's used to deter people from using brute force. In my time here, I have only seen this tag used to exclude brute-forcing a solution with a computer. However, the tag wiki reads A puzzle designed to be solved without using calculators, online decoders or com...

In honor of National Poetry Day (which happens to be March 21st - go figure), I have crafted a puzzle which I hope will do a small bit of justice to this day. Carefully hidden in the four sections below (which may or may not be related) are the names of five of my favorite poets (admittedly, I h...

Suppose we are given an equation in ax+by=c. Now we have to find for how many values of c where c belongs to [1,inf) will have a negative integral solution. I'm new to diophantine equation, so i can think of a brute force approach..but can it be found mathematically?

There are 4 missing members in this small series...labeled ???. Complete the series. $191$, $426$, $931$, $???$, $???$, $646$, $971$, $???$, $???$

We twist and turn, going round and round. No need to worry, we can take the strain. While some of us are delicate and timely, Others can lift more than the strongest man. I myself prefer to peacefully take notes in a diary. Who are we, and where am I?

Suppose you are give n currency notes from k to k+n i.e k, k+1,k+2.....k+n. Where $k,n>0$ It's asked the total number of denomination of money that can't be formed using any number of these notes. My approch. I can solve this when n=1. Ans is k*(k-1)/2 But How should i approach when n ≥1?

An integer is round if it is greater than 0 and the sum of its digits in decimal representation is a multiple of 10. Find an optimal procedure to compute the N−th smallest round integer. E.g. If N=2 then Answer is 28 As the first round integer is 19(1+9=10) and the second round integer is 28(2+8...

You have to reach Four from Five in minimum number of tries with the following rules. You are only allowed to change one letter at a time. You have to keep the word length the same. For example....How do you go from $LAND$ to $SANE$? $LAND$....$SAND$(1).....$SANE$(2)...done in 2 steps.

Find a scramble which will produce a Rubik's cube fulfilling the following criteria which uses as few turns of faces as possible (Half-Turn-Metric): Each of the six faces show exactly three colours No face shows its opposite colour (the colour of the centre of the opposite face) Each of the eig...

Got sent this on Discord, and I need help with identifying if it's like anything secretive or etc. If anyone can help that'd be thankful (Edit) Here's a zoomed version of that string: "a67340824040cbf489c23ec04eb88c3e"

Can you please help me out with the above question? "Example case 1: For example, the sequence A can be divided into subsequences B=(4,4,6) and C=(7)." But how the output comes out to be 9 As gcd of 7 is 1 itself.

Grandpa says, " This is not algebra or may be it is! IF X = 2 R + C = 6 B + P = 5 or 6 Then What is I + T ? There are, with my logic, three different answers!"

$X$ is 5. $U$ is 9. $O$ is 0 or 7. $I$ is 4 or 5 or 7. What is $V$? And what is $K$ (two options)?