brain

tamnd's digital brain — notes, problems, research

43815 notes

Project Euler Problem 402

It can be shown that the polynomial n^4 + 4n^3 + 2n^2 + 5n is a multiple of 6 for every integer n.

eulermathematicscompetitive-programming
Project Euler Problem 79

A common security method used for online banking is to ask the user for three random characters from a passcode.

eulermathematicscompetitive-programming
Project Euler Problem 403

For integers a and b, we define D(a, b) as the domain enclosed by the parabola y = x^2 and the line y = acdot x + b: D(a

eulermathematicscompetitive-programming
Project Euler Problem 112

Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for examp

eulermathematicscompetitive-programming
Project Euler Problem 460

On the Euclidean plane, an ant travels from point A(0, 1) to point B(d, 1) for an integer d.

eulermathematicscompetitive-programming
Project Euler Problem 357

Consider the divisors of 30: 1,2,3,5,6,10,15,30.

eulermathematicscompetitive-programming
Project Euler Problem 174

We shall define a square lamina to be a square outline with a square "hole" so that the shape possesses vertical and hor

eulermathematicscompetitive-programming
Project Euler Problem 895

Gary and Sally play a game using gold and silver coins arranged into a number of vertical stacks, alternating turns.

eulermathematicscompetitive-programming
Project Euler Problem 212

An axis-aligned cuboid, specified by parameters (x0, y0, z0), (dx, dy, dz), consists of all points (X,Y,Z) such that x0

eulermathematicscompetitive-programming
Project Euler Problem 140

Consider the infinite polynomial series AG(x) = x G1 + x^2 G2 + x^3 G3 + cdots, where Gk is the kth term of the second o

eulermathematicscompetitive-programming
Project Euler Problem 738

Define d(n,k) to be the number of ways to write n as a product of k ordered integers Further define D(N,K) to be the sum

eulermathematicscompetitive-programming
Project Euler Problem 168

Consider the number 142857.

eulermathematicscompetitive-programming
Project Euler Problem 435

The Fibonacci numbers fn, n ge 0 are defined recursively as fn = f{n-1} + f{n-2} with base cases f0 = 0 and f1 = 1.

eulermathematicscompetitive-programming
Project Euler Problem 580

A Hilbert number is any positive integer of the form 4k+1 for integer kgeq 0.

eulermathematicscompetitive-programming
Project Euler Problem 625

G(N)=sum{j=1}^Nsum{i=1}^j gcd(i,j).

eulermathematicscompetitive-programming
Project Euler Problem 590

Let H(n) denote the number of sets of positive integers such that the least common multiple of the integers in the set e

eulermathematicscompetitive-programming
Project Euler Problem 102

Three distinct points are plotted at random on a Cartesian plane, for which -1000 le x, y le 1000, such that a triangle

eulermathematicscompetitive-programming
Project Euler Problem 621

Gauss famously proved that every positive integer can be expressed as the sum of three triangular numbers (including 0 a

eulermathematicscompetitive-programming
Project Euler Problem 610

A random generator produces a sequence of symbols drawn from the set {I, V, X, L, C, D, M, }.

eulermathematicscompetitive-programming
Project Euler Problem 126

The minimum number of cubes to cover every visible face on a cuboid measuring 3 times 2 times 1 is twenty-two.

eulermathematicscompetitive-programming
Project Euler Problem 507

Let tn be the tribonacci numbers defined as: t0 = t1 = 0; t2 = 1; tn = t{n-1} + t{n-2} + t{n-3} for n ge 3 and let rn =

eulermathematicscompetitive-programming
Project Euler Problem 141

A positive integer, n, is divided by d and the quotient and remainder are q and r respectively.

eulermathematicscompetitive-programming
Project Euler Problem 629

Alice and Bob are playing a modified game of Nim called Scatterstone Nim, with Alice going first, alternating turns with

eulermathematicscompetitive-programming
Project Euler Problem 556

A Gaussian integer is a number z = a + bi where a, b are integers and i^2 = -1.

eulermathematicscompetitive-programming
Project Euler Problem 526

Let f(n) be the largest prime factor of n.

eulermathematicscompetitive-programming
Project Euler Problem 135

Given the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least value of the pos

eulermathematicscompetitive-programming
Project Euler Problem 347

The largest integer le 100 that is only divisible by both the primes 2 and 3 is 96, as 96=32times 3=2^5 times 3.

eulermathematicscompetitive-programming
Project Euler Problem 250

Find the number of non-empty subsets of 1^1, 2^2, 3^3,dots, 250250^{250250}, the sum of whose elements is divisible by 2

eulermathematicscompetitive-programming
Project Euler Problem 531

Let g(a, n, b, m) be the smallest non-negative solution x to the system: x = a bmod n x = b bmod m if such a solution ex

eulermathematicscompetitive-programming
Project Euler Problem 613

Dave is doing his homework on the balcony and, preparing a presentation about Pythagorean triangles, has just cut out a

eulermathematicscompetitive-programming
Project Euler Problem 596

Let T(r) be the number of integer quadruplets x, y, z, t such that x^2 + y^2 + z^2 + t^2 le r^2.

eulermathematicscompetitive-programming
Project Euler Problem 342

Consider the number 50.

eulermathematicscompetitive-programming
Project Euler Problem 259

A positive integer will be called reachable if it can result from an arithmetic expression obeying the following rules:

eulermathematicscompetitive-programming
Project Euler Problem 661

Two friends A and B are great fans of Chess.

eulermathematicscompetitive-programming
Project Euler Problem 316

Let p = p1 p2 p3 cdots be an infinite sequence of random digits, selected from 0,1,2,3,4,5,6,7,8,9 with equal probabilit

eulermathematicscompetitive-programming
Project Euler Problem 569

A mountain range consists of a line of mountains with slopes of exactly 45^circ, and heights governed by the prime numbe

eulermathematicscompetitive-programming
Project Euler Problem 472

There are N seats in a row.

eulermathematicscompetitive-programming
Project Euler Problem 730

For a non-negative integer k, the triple (p,q,r) of positive integers is called a k-shifted Pythagorean triple if (p, q,

eulermathematicscompetitive-programming
Project Euler Problem 716

Consider a directed graph made from an orthogonal lattice of Htimes W nodes.

eulermathematicscompetitive-programming
Project Euler Problem 608

Let D(m,n)=displaystylesum{dmid m}sum{k=1}^nsigma0(kd) where d runs through all divisors of m and sigma0(n) is the numbe

eulermathematicscompetitive-programming
Project Euler Problem 127

The radical of n, operatorname{rad}(n), is the product of distinct prime factors of n.

eulermathematicscompetitive-programming
Project Euler Problem 682

5-smooth numbers are numbers whose largest prime factor doesn't exceed 5.

eulermathematicscompetitive-programming
Project Euler Problem 429

A unitary divisor d of a number n is a divisor of n that has the property gcd(d, n/d) = 1.

eulermathematicscompetitive-programming
Project Euler Problem 178

Consider the number 45656.

eulermathematicscompetitive-programming
Project Euler Problem 105

Let S(A) represent the sum of elements in set A of size n.

eulermathematicscompetitive-programming
Project Euler Problem 536

Let S(n) be the sum of all positive integers m not exceeding n having the following property: a^{m + 4} equiv a pmod m f

eulermathematicscompetitive-programming
Project Euler Problem 517

For every real number a gt 1 is given the sequence ga by: g{a}(x)=1 for x lt a g{a}(x)=g{a}(x-1)+ga(x-a) for x ge a G(n)

eulermathematicscompetitive-programming
Project Euler Problem 857

A graph is made up of vertices and coloured edges.

eulermathematicscompetitive-programming
Project Euler Problem 874

Let p(t) denote the (t+1)th prime number.

eulermathematicscompetitive-programming
Project Euler Problem 558

Let r be the real root of the equation x^3 = x^2 + 1.

eulermathematicscompetitive-programming
Project Euler Problem 828

It is a common recreational problem to make a target number using a selection of other numbers.

eulermathematicscompetitive-programming
Project Euler Problem 788

A dominating number is a positive integer that has more than half of its digits equal.

eulermathematicscompetitive-programming
Project Euler Problem 96

Su Doku (Japanese meaning number place) is the name given to a popular puzzle concept.

eulermathematicscompetitive-programming
Project Euler Problem 701

Consider a rectangle made up of W times H square cells each with area 1.

eulermathematicscompetitive-programming
Project Euler Problem 390

Consider the triangle with sides sqrt 5, sqrt {65} and sqrt {68}.

eulermathematicscompetitive-programming
Project Euler Problem 133

A number consisting entirely of ones is called a repunit.

eulermathematicscompetitive-programming
Project Euler Problem 324

Let f(n) represent the number of ways one can fill a 3 times 3 times n tower with blocks of 2 times 1 times 1.

eulermathematicscompetitive-programming
Project Euler Problem 640

Bob plays a single-player game of chance using two standard 6-sided dice and twelve cards numbered 1 to 12.

eulermathematicscompetitive-programming
Project Euler Problem 873

Let W(p,q,r) be the number of words that can be formed using the letter A p times, the letter B q times and the letter C

eulermathematicscompetitive-programming
Project Euler Problem 562

Construct triangle ABC such that: - Vertices A, B and C are lattice points inside or on the circle of radius r centered

eulermathematicscompetitive-programming
Project Euler Problem 291

A prime number p is called a Panaitopol prime if p = dfrac{x^4 - y^4}{x^3 + y^3} for some positive integers x and y.

eulermathematicscompetitive-programming
Project Euler Problem 781

Let F(n) be the number of connected graphs with blue edges (directed) and red edges (undirected) containing: - two verti

eulermathematicscompetitive-programming
Project Euler Problem 550

Two players are playing a game, alternating turns.

eulermathematicscompetitive-programming
Project Euler Problem 651

An infinitely long cylinder has its curved surface fully covered with different coloured but otherwise identical rectang

eulermathematicscompetitive-programming
Project Euler Problem 786

The following diagram shows a billiard table of a special quadrilateral shape.

eulermathematicscompetitive-programming
Project Euler Problem 800

An integer of the form p^q q^p with prime numbers p neq q is called a hybrid-integer.

eulermathematicscompetitive-programming
Project Euler Problem 123

Let pn be the nth prime: 2, 3, 5, 7, 11, dots, and let r be the remainder when (pn - 1)^n + (pn + 1)^n is divided by pn^

eulermathematicscompetitive-programming
Project Euler Problem 434

Recall that a graph is a collection of vertices and edges connecting the vertices, and that two vertices connected by an

eulermathematicscompetitive-programming
Project Euler Problem 442

An integer is called eleven-free if its decimal expansion does not contain any substring representing a power of 11 exce

eulermathematicscompetitive-programming
Project Euler Problem 128

A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, starting at "12 o'clock" and numbering th

eulermathematicscompetitive-programming
Project Euler Problem 138

Consider the isosceles triangle with base length, b = 16, and legs, L = 17.

eulermathematicscompetitive-programming
Project Euler Problem 338

A rectangular sheet of grid paper with integer dimensions w times h is given.

eulermathematicscompetitive-programming
Project Euler Problem 712

For any integer n0 and prime number p, define nup(n) as the greatest integer r such that p^r divides n.

eulermathematicscompetitive-programming
Project Euler Problem 401

The divisors of 6 are 1,2,3 and 6.

eulermathematicscompetitive-programming
Project Euler Problem 330

An infinite sequence of real numbers a(n) is defined for all integers n as follows: For example, a(0) = dfrac{1}{1!} + d

eulermathematicscompetitive-programming
Project Euler Problem 746

n families, each with four members, a father, a mother, a son and a daughter, were invited to a restaurant.

eulermathematicscompetitive-programming
Project Euler Problem 277

A modified Collatz sequence of integers is obtained from a starting value a1 in the following way: a{n+1} = frac {an} 3

eulermathematicscompetitive-programming
Project Euler Problem 587

A square is drawn around a circle as shown in the diagram below on the left.

eulermathematicscompetitive-programming
Project Euler Problem 545

The sum of the kth powers of the first n positive integers can be expressed as a polynomial of degree k+1 with rational

eulermathematicscompetitive-programming
Project Euler Problem 695

Three points, P1, P2 and P3, are randomly selected within a unit square.

eulermathematicscompetitive-programming
Project Euler Problem 68

Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.

eulermathematicscompetitive-programming
Project Euler Problem 209

A k-input binary truth table is a map from k input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit.

eulermathematicscompetitive-programming
Project Euler Problem 75

It turns out that pu{12 cm} is the smallest length of wire that can be bent to form an integer sided right angle triangl

eulermathematicscompetitive-programming
Project Euler Problem 286

Barbara is a mathematician and a basketball player.

eulermathematicscompetitive-programming
Project Euler Problem 693

Two positive integers x and y (x y) can generate a sequence in the following manner: - ax = y is the first term, - a{z+1

eulermathematicscompetitive-programming
Project Euler Problem 518

Let S(n) = sum a + b + c over all triples (a, b, c) such that: - a, b and c are prime numbers.

eulermathematicscompetitive-programming
Project Euler Problem 689

For 0 le x lt 1, define di(x) to be the ith digit after the binary point of the binary representation of x.

eulermathematicscompetitive-programming
Project Euler Problem 58

Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.

eulermathematicscompetitive-programming
Project Euler Problem 486

Let F5(n) be the number of strings s such that: - s consists only of '0's and '1's, - s has length at most n, and - s co

eulermathematicscompetitive-programming
Project Euler Problem 680

Let N and K be two positive integers.

eulermathematicscompetitive-programming
Project Euler Problem 878

We use xoplus y for the bitwise XOR of x and y.

eulermathematicscompetitive-programming
Project Euler Problem 339

"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of

eulermathematicscompetitive-programming
Project Euler Problem 631

Let (p1 p2 ldots pk) denote the permutation of the set {1, ..., k} that maps pimapsto i.

eulermathematicscompetitive-programming
Project Euler Problem 147

In a 3 times 2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in

eulermathematicscompetitive-programming
Project Euler Problem 214

Let phi be Euler's totient function, i.e.

eulermathematicscompetitive-programming
Project Euler Problem 210

Consider the set S(r) of points (x,y) with integer coordinates satisfying |x| + |y| le r.

eulermathematicscompetitive-programming
Project Euler Problem 837

Amidakuji (Japanese: 阿弥陀籤) is a method for producing a random permutation of a set of objects.

eulermathematicscompetitive-programming
Project Euler Problem 644

Sam and Tom are trying a game of (partially) covering a given line segment of length L by taking turns in placing unit s

eulermathematicscompetitive-programming
Project Euler Problem 561

Let S(n) be the number of pairs (a,b) of distinct divisors of n such that a divides b.

eulermathematicscompetitive-programming
Project Euler Problem 581

A number is p-smooth if it has no prime factors larger than p.

eulermathematicscompetitive-programming