Let L be a language and R an infinite regular one. If L intersection R is a regular language, then L is a regular one too?
No. Let L = {1^p: p is prime} and R = {1^(2n) : n belongs to N}.
Source