how do i load the array with primes and print

[seungyeon]

rules -
if the array size is 100 or more
print last 100 element

#include <iostream>
#include <cmath>
#include <iomanip>

using namespace std;

int prime(int n)
{
	int div = 1;
	
	while(++div <= sqrt(n))
		{
			if(n % div == 0)
			{
				return false;
			}
		}
	return n;
}

int main()
{



	int max;
	int primeindex = 2;
	//int storage;
	int *primearr;
	primearr = new int [max];
	
	cout << "Enter a max number between 2-5000 to find all primes: ";
	cin >> max;
	if (max > 5000)
	{
		cout << "Too big, enter a number lower than 5000: ";
		cin >> max;
	}
	
	//load the array with primes and print
	for (int i = 0; i < max; i++)
	{
	primearr[i] = prime(primeindex);
	primeindex++;
	if(primearr[i] == 0)
	{
		cout << "";
	}
	if (max > 100)
	{
		for (int j = max-1-100 ; j < max; j++) // to print last 100 elements
		{
			cout << setw(3) << prime[j];
		}
	}
		else
			{
			cout << setw(3) << primearr[i];
			}
		}
	









	
	

		
	return 0;
}