• Support PF! Buy your school textbooks, materials and every day products Here!

Prime number proof

  • Thread starter zoxee
  • Start date
  • #1
37
0
prove if the statement is true, else form it's negation and prove that is true:

## \forall y \in (x | x \in \mathbb Z , x \geq 1), 5y^2 + 5y + 1 ##

I think it's true, but I can't really even get started to prove it

I really suck at these and need help please, thank you!
 

Answers and Replies

  • #2
34,053
9,913
There is no statement that could be evaluated as true or false.
It is like "prove that this is true or false: 5".

I guess there is "is prime" missing. Did you test some numbers to check it? Don't just check small numbers, consider larger numbers as well.


Big hint:
There is no known useful formula to generate an arbitrary number of primes without excessive calculations.
 
  • #3
.Scott
Homework Helper
2,455
851
Put this text into an *.vbs file and run it:

For y = 1 To 100
z = 5*y*y + 5*y + 1
if (z mod 11)=0 then MsgBox("f(" & y & ") is divisible by 11.")
if (z mod 19)=0 then MsgBox("f(" & y & ") is divisible by 19.")
Next
 
  • #4
HallsofIvy
Science Advisor
Homework Helper
41,808
933
Where did "divisible by 5" and "divisible by 11" come from?
 

Related Threads on Prime number proof

  • Last Post
Replies
5
Views
4K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
2
Views
12K
  • Last Post
Replies
10
Views
3K
Replies
6
Views
685
  • Last Post
Replies
12
Views
1K
  • Last Post
Replies
2
Views
4K
  • Last Post
Replies
7
Views
923
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
5
Views
2K
Top