Browse problems

11 problems

Beal conjecture counterexample open

Find positive integers A, B, C, x, y, z with x, y, z ≥ 3 and \gcd(A, B, C) = 1 such that

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Perfect cuboid open

Find positive integers a, b, c such that all four of

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Aliquot 3-cycle open

With s(n) = \sigma(n) - n (the sum of the proper divisors of n ), find three distinct positive integers with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Third Wieferich prime open

Find a prime p with 2^{64} < p < 10^{24} and

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
PSW $620 pseudoprime open

Find an odd composite n with n \equiv \pm 2 \pmod 5 that passes both

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
abc quality record open

Find coprime positive integers a, b with c = a + b whose quality

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Sum of three cubes: 114 open

Find integers x, y, z with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Factor of F₂₀ open

Find a nontrivial divisor d of the Fermat number F_{20} = 2^{2^{20}} + 1 , i.e. 1 < d < F_{20} with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Any nontrivial factor of M1277 = 2^1277 − 1 open

Statement. Find any nontrivial divisor of M_{1277} = 2^{1277} - 1 (385 digits). No factor is known; it is the smallest Mersenne number with prime exponent…

Buyers offer
€500
no seller
Sellers ask
—
♥ 0
Magic square of squares open

Find a 3 × 3 magic square whose nine entries are distinct perfect squares. Give positive roots r_1, …, r_9 in row-major order, so the square is

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Six sixth powers open

Find 2 ≤ k ≤ 6 positive integers t_1, …, t_k and a positive integer b with

Buyers offer
—
no quotes
Sellers ask
—
♥ 0