Find all the prime numbers less than a given number

import java.util.Scanner;
class BeforePrimeNumber
{
void checkBeforePrimeNumber(int number)
{
if(number==2)
System.out.print("2");
else
System.out.print(2+"\t"+3+"\t");
for(int j=4;j<number;j++)
{
boolean found=true;
for(int i=2;i*i<=number;i++)
{
if(j%i==0)
{
found=false;
}
}
if(found==true)
System.out.print(j+"\t");
}
}
}
class BeforePrimeNumberTest
{
public static void main(String args[])
{
BeforePrimeNumber p1=new BeforePrimeNumber();
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number you want to insert:");
int n=sc.nextInt();
p1.checkBeforePrimeNumber(n);
}
}