2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/94697We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direct bijections.12 pages, 5 figures; incorporated referee suggestions, simplified definition of (k,m)-rank, to appear in JCT(A)CombinatoricsA combinatorial proof of the Rogers-Ramanujan and Schur identitiestext