A basic calculator in C that uses a loop
Indentation

Frankly, your indentation is all over the place!

The basic idea of indentation is that you indent based on scope. A scope begins with { and ends with } (you can omit the { } sometimes but you shouldn't). I'll indent a few snippets of your code and you can do the rest. You seem to put { on the next line more often than you put { on the same line so that's the convention I've used. Using this convention, the { should be indented to the same depth as the matching }.

printf("Please enter any number:\n");
if (scanf("%f", &amp;a) != 1) 
{
    fprintf(stderr, "error: first input must be a number\n");
    return EXIT_FAILURE;
}

// ...

switch(n)
{
    case 1:
        c = a + b;
        printf("The answer is:%f\n", c);
        break;
}
printf("would you like to try again? (y/n)\n");
scanf(" %c", &amp;choice);


Indentation is really the only major problem with this code. 

Extensibility

You could use doubles instead of floats to gain a little bit of extra precision. If you want to make this program really easy to extend (after you've learnt about a bunch of new stuff) then you could store the operations in an array. Then the user will type add you'll look up a function pointer in an array. Something like this:

typedef struct {
    const char *name;
    double (*func)(double, double);
} Operation;

const Operation ops[] = {
    {"add", add},
    {"sub", sub}
    // ...
};


I'll let you figure out the details. Some things you'll need to look up are arrays, structs, function pointers and string comparison (strcmp).

Unary operations

You could complicate things further by allowing unary operations (e.g. sin, sqrt). You'll need separate arrays for unary and binary operations.

typedef struct {
    const char *name;
    double (*func)(double);
} UnaryOperation;

typedef struct {
    const char *name;
    double (*func)(double, double);
} BinaryOperation;


Parsing

If you're up for a real challenge you could allow the user to enter an expression like 14 + 2 * sin(0.8) and evaluate the expression. This sort of thing is quite tricky indeed! You'll need to learn about recursive descent parsing (there are other types of parsing but this is probably the easiest), memory management and pointers. The last time I did something like that, the resulting program was 700 lines so it's quite a step up from the code in your question.