Koitaro

2 + (1000000-5) %/% 7 * 3

Koitaro

library(gmp)
library(hash)

h <- hash()

n <- 1
maxDigits <- Inf
repeat {
	v <- as.character(pow.bigz(n, 3))
	s <- strsplit(v, "")[[1]]

Koitaro

library(pracma)
library(gmp)

p <- primes(1e6%/%21)

answer <- 0
maxLength <- 0
while (length(p) > 0) {
	x <- rev((x <- cumsum(p))[x < 1e6])
	while (length(x) > 0) {

Koitaro

library(pracma)
 
xs <- colSums(t(perms(1:7)) * (10^(6:0)))
for (x in xs) if(isprime(x)) {answer <- x; break} else next
answer

Koitaro

limit <- 1
while (9^5*limit >= 10^limit) limit <- limit+1
n <- 2:(9^5*limit)
f <- function(x, y) (x %/% 10^y %% 10)^5
sum(n[n == rowSums(outer(n, limit:0, f))])

Koitaro

library(gmp)

n <- factorialZ(100)
sum(n %/% pow.bigz(10, (floor(log10(n)):0)) %% 10)

Koitaro

library(pracma)
sum(primes(2e6))

Koitaro

f <- function(n) {
	x <- 999%/%n
	x * (x + 1) / 2 * n
}
f(3) + f(5) - f(15)

Koitaro

package heap

type Node struct {
	Order
	tails
}

type Order interface {
	Ord(*Node) bool
}

Koitaro

package main

import (
	"fmt"
	"time"
)

type digits []int

func (xs digits) nexts() (answer []digits) {