# Search by Topic

#### Resources tagged with Algorithms similar to A Roman Conversion?:

Filter by: Content type:
Stage:
Challenge level:

##### Other tags that relate to A Roman Conversion?
Codes and cryptography. Number bases. Experimental probability. Combinatorics. Statistics generally. Video. Algorithms. Probability.

### There are 24 results

Broad Topics > Decision Mathematics and Combinatorics > Algorithms

### Stage 5 Cipher Challenge

##### Stage: 5 Challenge Level:

Can you crack these very difficult challenge ciphers? How might you systematise the cracking of unknown ciphers?

### Probably a Code?

##### Stage: 5 Challenge Level:

Is the regularity shown in this encoded message noise or structure?

### Sorted

##### Stage: 5 Challenge Level:

How can you quickly sort a suit of cards in order from Ace to King?

### Jluuis or Even Asutguus?

##### Stage: 5 Challenge Level:

Sixth challenge cipher

### Weekly Challenge 41: Happy Birthday

##### Stage: 5 Challenge Level:

A weekly challenge concerning the interpretation of an algorithm to determine the day on which you were born.

### The Best Square

##### Stage: 4 and 5 Challenge Level:

How would you judge a competition to draw a freehand square?

### Ip?

##### Stage: 5 Challenge Level:

Seventh challenge cipher

### Vital?

##### Stage: 5 Challenge Level:

Third challenge cipher

### A Fine Thing?

##### Stage: 5 Challenge Level:

Second challenge cipher

### Tournament Scheduling

##### Stage: 3, 4 and 5

Scheduling games is a little more challenging than one might desire. Here are some tournament formats that sport schedulers use.

### Up a Semitone?

##### Stage: 5 Challenge Level:

Fifth challenge cipher

### Procedure Solver

##### Stage: 5 Challenge Level:

Can you think like a computer and work out what this flow diagram does?

### Odd One Out

##### Stage: 5 Short Challenge Level:

In this short problem, can you deduce the likely location of the odd ones out in six sets of random numbers?

### Divided Differences

##### Stage: 5

When in 1821 Charles Babbage invented the `Difference Engine' it was intended to take over the work of making mathematical tables by the techniques described in this article.

### Geomlab

##### Stage: 3, 4 and 5 Challenge Level:

A geometry lab crafted in a functional programming language. Ported to Flash from the original java at web.comlab.ox.ac.uk/geomlab

### Vedic Sutra - All from 9 and Last from 10

##### Stage: 4 Challenge Level:

Vedic Sutra is one of many ancient Indian sutras which involves a cross subtraction method. Can you give a good explanation of WHY it works?

### Zeller's Birthday

##### Stage: 4 Challenge Level:

What day of the week were you born on? Do you know? Here's a way to find out.

### Peaches in General

##### Stage: 4 Challenge Level:

It's like 'Peaches Today, Peaches Tomorrow' but interestingly generalized.

### Semicircle

##### Stage: 5 Challenge Level:

Fourth challenge cipher

### Stretching Fractions

##### Stage: 4 Challenge Level:

Imagine a strip with a mark somewhere along it. Fold it in the middle so that the bottom reaches back to the top. Stetch it out to match the original length. Now where's the mark?

### Unusual Long Division - Square Roots Before Calculators

##### Stage: 4 Challenge Level:

However did we manage before calculators? Is there an efficient way to do a square root if you have to do the work yourself?

### Route to Root

##### Stage: 5 Challenge Level:

A sequence of numbers x1, x2, x3, ... starts with x1 = 2, and, if you know any term xn, you can find the next term xn+1 using the formula: xn+1 = (xn + 3/xn)/2 . Calculate the first six terms of this. . . .

### An Introduction to Computer Programming and Mathematics

##### Stage: 5

This article explains the concepts involved in scientific mathematical computing. It will be very useful and interesting to anyone interested in computer programming or mathematics.

### Triangle Incircle Iteration

##### Stage: 4 Challenge Level:

Start with any triangle T1 and its inscribed circle. Draw the triangle T2 which has its vertices at the points of contact between the triangle T1 and its incircle. Now keep repeating this. . . .