raphaelvallat

import numpy as np

def find_closest_divisor(n, m): 
    """Find the divisor of n closest to m
    """
    divisors = np.array([ i for i in range(1, int(np.sqrt(n)+1)) if n % i == 0 ])
    divisions = n / divisors 
    return divisions[np.argmin(np.abs(m - divisions))]

number, divisor = 1024, 100

raphaelvallat

library(ez)
library(lsmeans)
library(effsize)

# Load the file
df <- read.csv(file="", head=TRUE, sep=",")

# Choose dependant variable (e.g. reaction time)
df$dv <- df$RT