The best way to learn math and computer science.

Log in with Facebook Log in with Google Log in with email

Join using Facebook Join using Google Join using email

Forgot password? New user? Sign up

Existing user? Log in

Lott Naryk

Computer Science

We have a Caesar Cipher of shift magnitude \( x \). We start with Lott Naryk and get Finn Hulse! Cool!

Let \( y = 2014x\text{ (mod 26)} \).

Find \( x+y \).

View solutions

Your answer seems reasonable. Find out if you're right!

Sign up to access problem solutions.

That seems reasonable. Find out if you're right!

Sign up to save your progress!

Log in with Facebook Log in with Google Log in with email

Join using Facebook Join using Google Join using email

Forgot password? New user? Sign up

Existing user? Log in

by David Lee

×

Problem Loading...

Note Loading...

Set Loading...